YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 01:51:12,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 01:51:12,085 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 01:51:12,096 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 01:51:12,096 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 01:51:12,097 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 01:51:12,098 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 01:51:12,100 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 01:51:12,101 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 01:51:12,102 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 01:51:12,103 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 01:51:12,103 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 01:51:12,104 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 01:51:12,105 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 01:51:12,106 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 01:51:12,107 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 01:51:12,107 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 01:51:12,109 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 01:51:12,111 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 01:51:12,112 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 01:51:12,113 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 01:51:12,114 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 01:51:12,116 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 01:51:12,117 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 01:51:12,117 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 01:51:12,118 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 01:51:12,118 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 01:51:12,119 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 01:51:12,119 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 01:51:12,120 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 01:51:12,120 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 01:51:12,121 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 01:51:12,122 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 01:51:12,122 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 01:51:12,123 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 01:51:12,123 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 01:51:12,123 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 01:51:12,124 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 01:51:12,125 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 01:51:12,125 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 01:51:12,139 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 01:51:12,139 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 01:51:12,140 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 01:51:12,140 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 01:51:12,140 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 01:51:12,141 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 01:51:12,141 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 01:51:12,141 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 01:51:12,141 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 01:51:12,141 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 01:51:12,141 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 01:51:12,142 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 01:51:12,142 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 01:51:12,142 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 01:51:12,142 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:12,142 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 01:51:12,142 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 01:51:12,143 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 01:51:12,143 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 01:51:12,143 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 01:51:12,143 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 01:51:12,143 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 01:51:12,144 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 01:51:12,144 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 01:51:12,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 01:51:12,144 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 01:51:12,144 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 01:51:12,144 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 01:51:12,145 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 01:51:12,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 01:51:12,183 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 01:51:12,186 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 01:51:12,188 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 01:51:12,188 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 01:51:12,189 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 01:51:12,252 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/c98ec0a6231b48fcbdb50f435dd8c003/FLAG5fd989de9 [2020-06-22 01:51:12,589 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 01:51:12,589 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 01:51:12,596 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/c98ec0a6231b48fcbdb50f435dd8c003/FLAG5fd989de9 [2020-06-22 01:51:13,013 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/c98ec0a6231b48fcbdb50f435dd8c003 [2020-06-22 01:51:13,024 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 01:51:13,026 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 01:51:13,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 01:51:13,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 01:51:13,031 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 01:51:13,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 01:51:13" (1/1) ... [2020-06-22 01:51:13,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d95b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:51:13, skipping insertion in model container [2020-06-22 01:51:13,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 01:51:13" (1/1) ... [2020-06-22 01:51:13,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 01:51:13,059 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 01:51:13,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 01:51:13,222 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 01:51:13,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 01:51:13,316 INFO L195 MainTranslator]: Completed translation [2020-06-22 01:51:13,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:51:13 WrapperNode [2020-06-22 01:51:13,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 01:51:13,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 01:51:13,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 01:51:13,318 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 01:51:13,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:51:13" (1/1) ... [2020-06-22 01:51:13,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:51:13" (1/1) ... [2020-06-22 01:51:13,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 01:51:13,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 01:51:13,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 01:51:13,355 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 01:51:13,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:51:13" (1/1) ... [2020-06-22 01:51:13,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:51:13" (1/1) ... [2020-06-22 01:51:13,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:51:13" (1/1) ... [2020-06-22 01:51:13,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:51:13" (1/1) ... [2020-06-22 01:51:13,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:51:13" (1/1) ... [2020-06-22 01:51:13,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:51:13" (1/1) ... [2020-06-22 01:51:13,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:51:13" (1/1) ... [2020-06-22 01:51:13,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 01:51:13,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 01:51:13,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 01:51:13,373 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 01:51:13,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:51:13" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 01:51:13,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 01:51:13,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 01:51:13,445 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2020-06-22 01:51:13,445 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2020-06-22 01:51:13,616 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 01:51:13,617 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2020-06-22 01:51:13,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:51:13 BoogieIcfgContainer [2020-06-22 01:51:13,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 01:51:13,619 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 01:51:13,619 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 01:51:13,621 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 01:51:13,622 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:51:13" (1/1) ... [2020-06-22 01:51:13,639 INFO L313 BlockEncoder]: Initial Icfg 20 locations, 27 edges [2020-06-22 01:51:13,641 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 01:51:13,641 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 01:51:13,642 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 01:51:13,642 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 01:51:13,644 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 01:51:13,645 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 01:51:13,645 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 01:51:13,661 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 01:51:13,678 INFO L200 BlockEncoder]: SBE split 4 edges [2020-06-22 01:51:13,683 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 01:51:13,685 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 01:51:13,693 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 01:51:13,695 INFO L70 RemoveSinkStates]: Removed 10 edges and 5 locations by removing sink states [2020-06-22 01:51:13,697 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 01:51:13,697 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 01:51:13,704 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 01:51:13,705 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 01:51:13,705 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 01:51:13,705 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 01:51:13,706 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 01:51:13,706 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 01:51:13,706 INFO L313 BlockEncoder]: Encoded RCFG 12 locations, 17 edges [2020-06-22 01:51:13,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 01:51:13 BasicIcfg [2020-06-22 01:51:13,707 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 01:51:13,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 01:51:13,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 01:51:13,712 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 01:51:13,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 01:51:13" (1/4) ... [2020-06-22 01:51:13,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ac761e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:51:13, skipping insertion in model container [2020-06-22 01:51:13,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:51:13" (2/4) ... [2020-06-22 01:51:13,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ac761e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:51:13, skipping insertion in model container [2020-06-22 01:51:13,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:51:13" (3/4) ... [2020-06-22 01:51:13,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ac761e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:51:13, skipping insertion in model container [2020-06-22 01:51:13,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 01:51:13" (4/4) ... [2020-06-22 01:51:13,716 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 01:51:13,726 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 01:51:13,737 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 01:51:13,753 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 01:51:13,781 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 01:51:13,782 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 01:51:13,782 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 01:51:13,782 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 01:51:13,783 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 01:51:13,783 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 01:51:13,783 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 01:51:13,783 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 01:51:13,783 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 01:51:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-06-22 01:51:13,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 01:51:13,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-06-22 01:51:13,869 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 01:51:13,869 INFO L451 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: true [2020-06-22 01:51:13,869 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. [2020-06-22 01:51:13,870 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-06-22 01:51:13,870 INFO L451 ceAbstractionStarter]: At program point additionENTRY(lines 13 23) the Hoare annotation is: true [2020-06-22 01:51:13,870 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 16) no Hoare annotation was computed. [2020-06-22 01:51:13,870 INFO L448 ceAbstractionStarter]: For program point additionEXIT(lines 13 23) no Hoare annotation was computed. [2020-06-22 01:51:13,870 INFO L448 ceAbstractionStarter]: For program point additionFINAL(lines 13 23) no Hoare annotation was computed. [2020-06-22 01:51:13,870 INFO L451 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: true [2020-06-22 01:51:13,871 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 22) no Hoare annotation was computed. [2020-06-22 01:51:13,871 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2020-06-22 01:51:13,871 INFO L451 ceAbstractionStarter]: At program point L18(line 18) the Hoare annotation is: true [2020-06-22 01:51:13,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:51:13 BasicIcfg [2020-06-22 01:51:13,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 01:51:13,875 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 01:51:13,875 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 01:51:13,879 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 01:51:13,880 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:51:13,880 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 01:51:13" (1/5) ... [2020-06-22 01:51:13,881 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36a9ff4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 01:51:13, skipping insertion in model container [2020-06-22 01:51:13,881 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:51:13,881 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:51:13" (2/5) ... [2020-06-22 01:51:13,881 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36a9ff4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 01:51:13, skipping insertion in model container [2020-06-22 01:51:13,882 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:51:13,882 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:51:13" (3/5) ... [2020-06-22 01:51:13,882 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36a9ff4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 01:51:13, skipping insertion in model container [2020-06-22 01:51:13,882 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:51:13,882 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 01:51:13" (4/5) ... [2020-06-22 01:51:13,883 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36a9ff4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 01:51:13, skipping insertion in model container [2020-06-22 01:51:13,883 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:51:13,883 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:51:13" (5/5) ... [2020-06-22 01:51:13,885 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 01:51:13,911 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 01:51:13,912 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 01:51:13,912 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 01:51:13,912 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 01:51:13,912 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 01:51:13,912 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 01:51:13,912 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 01:51:13,912 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 01:51:13,913 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 01:51:13,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-06-22 01:51:13,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 01:51:13,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:51:13,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:51:13,945 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 01:51:13,946 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 01:51:13,946 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 01:51:13,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-06-22 01:51:13,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 01:51:13,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:51:13,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:51:13,948 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 01:51:13,948 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 01:51:13,953 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue [91] ULTIMATE.startENTRY-->L35: Formula: (and (<= v_ULTIMATE.start_main_~m~0_11 2147483647) (<= 0 v_ULTIMATE.start_main_~n~0_11) (<= v_ULTIMATE.start_main_~n~0_11 2147483647) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_11, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_7|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret4, ULTIMATE.start_main_~result~0] 11#L35true [68] L35-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_1| v_ULTIMATE.start_main_~m~0_9) (= |v_addition_#in~nInParam_1| v_ULTIMATE.start_main_~n~0_8)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{addition_#in~m=|v_addition_#in~mInParam_1|, addition_#in~n=|v_addition_#in~nInParam_1|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 3#additionENTRYtrue [2020-06-22 01:51:13,954 INFO L796 eck$LassoCheckResult]: Loop: 3#additionENTRYtrue [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 8#L14true [85] L14-->L17: Formula: (< 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 13#L17true [57] L17-->L18: Formula: (< 0 v_addition_~n_9) InVars {addition_~n=v_addition_~n_9} OutVars{addition_~n=v_addition_~n_9} AuxVars[] AssignedVars[] 10#L18true [56] L18-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_2| (+ v_addition_~m_5 1)) (= |v_addition_#in~nInParam_2| (+ v_addition_~n_10 (- 1)))) InVars {addition_~n=v_addition_~n_10, addition_~m=v_addition_~m_5} OutVars{addition_#in~m=|v_addition_#in~mInParam_2|, addition_#in~n=|v_addition_#in~nInParam_2|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 3#additionENTRYtrue [2020-06-22 01:51:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:51:13,960 INFO L82 PathProgramCache]: Analyzing trace with hash 3850, now seen corresponding path program 1 times [2020-06-22 01:51:13,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:51:13,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:51:13,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:13,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:51:13,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:51:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:51:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:51:14,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2794489, now seen corresponding path program 1 times [2020-06-22 01:51:14,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:51:14,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:51:14,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:14,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:51:14,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:51:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:51:14,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:51:14,048 INFO L82 PathProgramCache]: Analyzing trace with hash -737540478, now seen corresponding path program 1 times [2020-06-22 01:51:14,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:51:14,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:51:14,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:14,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:51:14,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:51:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:51:14,151 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:51:14,152 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:51:14,153 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:51:14,153 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:51:14,153 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 01:51:14,153 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:14,153 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:51:14,153 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:51:14,154 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 01:51:14,154 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:51:14,154 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:51:14,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:14,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:14,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:14,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:14,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:14,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:14,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:14,274 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:51:14,275 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:14,282 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:51:14,282 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:51:14,291 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:51:14,291 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_~m=0} Honda state: {addition_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:14,321 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:51:14,321 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:51:14,325 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:51:14,325 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret1=0} Honda state: {addition_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:14,357 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:51:14,357 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:51:14,361 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:51:14,361 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret0=0} Honda state: {addition_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:14,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:51:14,388 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:14,420 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 01:51:14,420 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:51:14,437 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:51:14,437 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#in~m=0} Honda state: {addition_#in~m=0} Generalized eigenvectors: [{addition_#in~m=5}, {addition_#in~m=4}, {addition_#in~m=-8}] Lambdas: [1, 3, 1] Nus: [0, 1] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:14,464 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:51:14,464 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:51:14,468 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:51:14,468 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#res=0} Honda state: {addition_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:14,515 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:51:14,515 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:14,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 01:51:14,546 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:51:14,575 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 01:51:14,577 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:51:14,577 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:51:14,577 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:51:14,577 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:51:14,578 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 01:51:14,578 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 01:51:14,578 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:51:14,578 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:51:14,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 01:51:14,578 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:51:14,578 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:51:14,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:14,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:14,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:14,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:14,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:14,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:14,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:14,660 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:51:14,665 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 01:51:14,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:51:14,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:51:14,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:51:14,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:51:14,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:51:14,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:51:14,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:51:14,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:51:14,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:51:14,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:51:14,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:51:14,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:51:14,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:51:14,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:51:14,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:51:14,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:51:14,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:51:14,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:51:14,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:51:14,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:51:14,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:51:14,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:51:14,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:51:14,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:51:14,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:51:14,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:51:14,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:51:14,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:51:14,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:51:14,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:51:14,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:51:14,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:51:14,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:51:14,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:51:14,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:51:14,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:51:14,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:51:14,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:51:14,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:51:14,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:51:14,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:51:14,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:51:14,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:51:14,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:51:14,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:51:14,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:51:14,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:51:14,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:51:14,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:51:14,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:51:14,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:51:14,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:51:14,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:51:14,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:51:14,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:51:14,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:51:14,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:51:14,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:51:14,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:51:14,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:51:14,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:51:14,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:51:14,705 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 01:51:14,709 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 01:51:14,710 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 01:51:14,712 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 01:51:14,712 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 01:51:14,712 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 01:51:14,713 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(addition_#in~n) = 1*addition_#in~n Supporting invariants [] [2020-06-22 01:51:14,714 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 01:51:14,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:51:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:51:14,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:51:14,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:51:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:51:14,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 01:51:14,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:51:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:51:14,841 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 01:51:14,846 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 01:51:14,848 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states. Second operand 4 states. [2020-06-22 01:51:14,997 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states.. Second operand 4 states. Result 80 states and 114 transitions. Complement of second has 19 states. [2020-06-22 01:51:14,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 01:51:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 01:51:15,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2020-06-22 01:51:15,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 2 letters. Loop has 4 letters. [2020-06-22 01:51:15,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:51:15,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 4 letters. [2020-06-22 01:51:15,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:51:15,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 2 letters. Loop has 8 letters. [2020-06-22 01:51:15,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:51:15,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 114 transitions. [2020-06-22 01:51:15,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 01:51:15,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 26 states and 32 transitions. [2020-06-22 01:51:15,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-06-22 01:51:15,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 01:51:15,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2020-06-22 01:51:15,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 01:51:15,039 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-06-22 01:51:15,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2020-06-22 01:51:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2020-06-22 01:51:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 01:51:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-06-22 01:51:15,070 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-06-22 01:51:15,071 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-06-22 01:51:15,071 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 01:51:15,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-06-22 01:51:15,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 01:51:15,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:51:15,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:51:15,072 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 01:51:15,072 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 01:51:15,073 INFO L794 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY [91] ULTIMATE.startENTRY-->L35: Formula: (and (<= v_ULTIMATE.start_main_~m~0_11 2147483647) (<= 0 v_ULTIMATE.start_main_~n~0_11) (<= v_ULTIMATE.start_main_~n~0_11 2147483647) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_11, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_7|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret4, ULTIMATE.start_main_~result~0] 157#L35 [68] L35-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_1| v_ULTIMATE.start_main_~m~0_9) (= |v_addition_#in~nInParam_1| v_ULTIMATE.start_main_~n~0_8)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{addition_#in~m=|v_addition_#in~mInParam_1|, addition_#in~n=|v_addition_#in~nInParam_1|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 159#additionENTRY [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 161#L14 [86] L14-->L17: Formula: (> 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 165#L17 [78] L17-->L20: Formula: (>= 0 v_addition_~n_2) InVars {addition_~n=v_addition_~n_2} OutVars{addition_~n=v_addition_~n_2} AuxVars[] AssignedVars[] 154#L20 [2020-06-22 01:51:15,073 INFO L796 eck$LassoCheckResult]: Loop: 154#L20 [49] L20-->L21: Formula: (< v_addition_~n_3 0) InVars {addition_~n=v_addition_~n_3} OutVars{addition_~n=v_addition_~n_3} AuxVars[] AssignedVars[] 156#L21 [52] L21-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_3| (+ v_addition_~m_6 (- 1))) (= |v_addition_#in~nInParam_3| (+ v_addition_~n_11 1))) InVars {addition_~n=v_addition_~n_11, addition_~m=v_addition_~m_6} OutVars{addition_#in~m=|v_addition_#in~mInParam_3|, addition_#in~n=|v_addition_#in~nInParam_3|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 163#additionENTRY [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 168#L14 [85] L14-->L17: Formula: (< 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 167#L17 [78] L17-->L20: Formula: (>= 0 v_addition_~n_2) InVars {addition_~n=v_addition_~n_2} OutVars{addition_~n=v_addition_~n_2} AuxVars[] AssignedVars[] 154#L20 [2020-06-22 01:51:15,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:51:15,074 INFO L82 PathProgramCache]: Analyzing trace with hash 114755754, now seen corresponding path program 1 times [2020-06-22 01:51:15,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:51:15,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:51:15,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:15,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:51:15,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:51:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:51:15,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:51:15,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 01:51:15,127 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 01:51:15,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:51:15,128 INFO L82 PathProgramCache]: Analyzing trace with hash 75491185, now seen corresponding path program 1 times [2020-06-22 01:51:15,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:51:15,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:51:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:15,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:51:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:51:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:51:15,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:51:15,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 01:51:15,161 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 01:51:15,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 01:51:15,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 01:51:15,165 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-06-22 01:51:15,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:51:15,180 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2020-06-22 01:51:15,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 01:51:15,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2020-06-22 01:51:15,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 01:51:15,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2020-06-22 01:51:15,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-06-22 01:51:15,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 01:51:15,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2020-06-22 01:51:15,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 01:51:15,186 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-06-22 01:51:15,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2020-06-22 01:51:15,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-06-22 01:51:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 01:51:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-06-22 01:51:15,189 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-06-22 01:51:15,189 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-06-22 01:51:15,189 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 01:51:15,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2020-06-22 01:51:15,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 01:51:15,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:51:15,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:51:15,190 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 01:51:15,190 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 01:51:15,191 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY [91] ULTIMATE.startENTRY-->L35: Formula: (and (<= v_ULTIMATE.start_main_~m~0_11 2147483647) (<= 0 v_ULTIMATE.start_main_~n~0_11) (<= v_ULTIMATE.start_main_~n~0_11 2147483647) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_11, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_7|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret4, ULTIMATE.start_main_~result~0] 204#L35 [68] L35-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_1| v_ULTIMATE.start_main_~m~0_9) (= |v_addition_#in~nInParam_1| v_ULTIMATE.start_main_~n~0_8)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{addition_#in~m=|v_addition_#in~mInParam_1|, addition_#in~n=|v_addition_#in~nInParam_1|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 209#additionENTRY [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 202#L14 [86] L14-->L17: Formula: (> 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 210#L17 [78] L17-->L20: Formula: (>= 0 v_addition_~n_2) InVars {addition_~n=v_addition_~n_2} OutVars{addition_~n=v_addition_~n_2} AuxVars[] AssignedVars[] 203#L20 [2020-06-22 01:51:15,191 INFO L796 eck$LassoCheckResult]: Loop: 203#L20 [49] L20-->L21: Formula: (< v_addition_~n_3 0) InVars {addition_~n=v_addition_~n_3} OutVars{addition_~n=v_addition_~n_3} AuxVars[] AssignedVars[] 197#L21 [52] L21-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_3| (+ v_addition_~m_6 (- 1))) (= |v_addition_#in~nInParam_3| (+ v_addition_~n_11 1))) InVars {addition_~n=v_addition_~n_11, addition_~m=v_addition_~m_6} OutVars{addition_#in~m=|v_addition_#in~mInParam_3|, addition_#in~n=|v_addition_#in~nInParam_3|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 195#additionENTRY [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 198#L14 [86] L14-->L17: Formula: (> 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 207#L17 [78] L17-->L20: Formula: (>= 0 v_addition_~n_2) InVars {addition_~n=v_addition_~n_2} OutVars{addition_~n=v_addition_~n_2} AuxVars[] AssignedVars[] 203#L20 [2020-06-22 01:51:15,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:51:15,191 INFO L82 PathProgramCache]: Analyzing trace with hash 114755754, now seen corresponding path program 2 times [2020-06-22 01:51:15,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:51:15,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:51:15,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:15,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:51:15,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:51:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:51:15,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:51:15,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 01:51:15,217 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 01:51:15,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:51:15,218 INFO L82 PathProgramCache]: Analyzing trace with hash 75491216, now seen corresponding path program 1 times [2020-06-22 01:51:15,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:51:15,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:51:15,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:15,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 01:51:15,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:51:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:51:15,307 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:51:15,307 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:51:15,307 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:51:15,308 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:51:15,308 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 01:51:15,308 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:15,308 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:51:15,308 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:51:15,308 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 01:51:15,308 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:51:15,308 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:51:15,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:15,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:15,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:15,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:15,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:15,391 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:51:15,391 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:15,396 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:51:15,397 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:51:15,401 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:51:15,401 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret1=0} Honda state: {addition_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:15,435 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:51:15,435 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:15,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 01:51:15,474 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:51:15,631 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:51:15,632 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#in~m=-8, addition_~m=-8} Honda state: {addition_#in~m=-8, addition_~m=-8} Generalized eigenvectors: [{addition_#in~m=7, addition_~m=-1}, {addition_#in~m=-8, addition_~m=0}, {addition_#in~m=0, addition_~m=0}] Lambdas: [1, 0, 15] Nus: [1, 0] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:15,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:51:15,659 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:51:15,663 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:51:15,663 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#res=0} Honda state: {addition_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:15,689 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:51:15,689 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:51:15,692 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 01:51:15,693 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret0=0} Honda state: {addition_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:15,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:51:15,719 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:51:15,753 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 01:51:15,753 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:51:27,231 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 01:51:27,235 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:51:27,248 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:51:27,249 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:51:27,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:51:27,249 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 01:51:27,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 01:51:27,249 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:51:27,249 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:51:27,249 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 01:51:27,249 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:51:27,249 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:51:27,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:27,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:27,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:27,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:27,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:51:27,333 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:51:27,333 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 01:51:27,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:51:27,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:51:27,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:51:27,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:51:27,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:51:27,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:51:27,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:51:27,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:51:27,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:51:27,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:51:27,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:51:27,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:51:27,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:51:27,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:51:27,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:51:27,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:51:27,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:51:27,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:51:27,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:51:27,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:51:27,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:51:27,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:51:27,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:51:27,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:51:27,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:51:27,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:51:27,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:51:27,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:51:27,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:51:27,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:51:27,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:51:27,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:51:27,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:51:27,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:51:27,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:51:27,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:51:27,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:51:27,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:51:27,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:51:27,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:51:27,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:51:27,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:51:27,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:51:27,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:51:27,359 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 01:51:27,362 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 01:51:27,362 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 01:51:27,363 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 01:51:27,363 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 01:51:27,363 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 01:51:27,363 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(addition_~n) = -1*addition_~n Supporting invariants [] [2020-06-22 01:51:27,364 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 01:51:27,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:51:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:51:27,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:51:27,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:51:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:51:27,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 01:51:27,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:51:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:51:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:51:27,453 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 01:51:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:51:27,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 01:51:27,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:51:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:51:27,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 01:51:27,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:51:27,536 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 01:51:27,536 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-06-22 01:51:27,537 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-06-22 01:51:27,610 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 21 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 112 states and 141 transitions. Complement of second has 83 states. [2020-06-22 01:51:27,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2020-06-22 01:51:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 01:51:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2020-06-22 01:51:27,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 5 letters. Loop has 5 letters. [2020-06-22 01:51:27,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:51:27,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 10 letters. Loop has 5 letters. [2020-06-22 01:51:27,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:51:27,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 5 letters. Loop has 10 letters. [2020-06-22 01:51:27,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:51:27,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 141 transitions. [2020-06-22 01:51:27,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-06-22 01:51:27,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 30 states and 37 transitions. [2020-06-22 01:51:27,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 01:51:27,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-06-22 01:51:27,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2020-06-22 01:51:27,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 01:51:27,621 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-06-22 01:51:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2020-06-22 01:51:27,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2020-06-22 01:51:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 01:51:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-06-22 01:51:27,623 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-06-22 01:51:27,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 01:51:27,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 01:51:27,624 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 5 states. [2020-06-22 01:51:27,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:51:27,663 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2020-06-22 01:51:27,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 01:51:27,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2020-06-22 01:51:27,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 01:51:27,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 29 transitions. [2020-06-22 01:51:27,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 01:51:27,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 01:51:27,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2020-06-22 01:51:27,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 01:51:27,669 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-06-22 01:51:27,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2020-06-22 01:51:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2020-06-22 01:51:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 01:51:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2020-06-22 01:51:27,672 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-06-22 01:51:27,672 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-06-22 01:51:27,672 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 01:51:27,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2020-06-22 01:51:27,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 01:51:27,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:51:27,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:51:27,673 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:51:27,673 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:51:27,674 INFO L794 eck$LassoCheckResult]: Stem: 547#ULTIMATE.startENTRY [91] ULTIMATE.startENTRY-->L35: Formula: (and (<= v_ULTIMATE.start_main_~m~0_11 2147483647) (<= 0 v_ULTIMATE.start_main_~n~0_11) (<= v_ULTIMATE.start_main_~n~0_11 2147483647) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_11, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_7|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret4, ULTIMATE.start_main_~result~0] 536#L35 [68] L35-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_1| v_ULTIMATE.start_main_~m~0_9) (= |v_addition_#in~nInParam_1| v_ULTIMATE.start_main_~n~0_8)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{addition_#in~m=|v_addition_#in~mInParam_1|, addition_#in~n=|v_addition_#in~nInParam_1|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 535#additionENTRY [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 537#L14 [85] L14-->L17: Formula: (< 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 549#L17 [57] L17-->L18: Formula: (< 0 v_addition_~n_9) InVars {addition_~n=v_addition_~n_9} OutVars{addition_~n=v_addition_~n_9} AuxVars[] AssignedVars[] 539#L18 [56] L18-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_2| (+ v_addition_~m_5 1)) (= |v_addition_#in~nInParam_2| (+ v_addition_~n_10 (- 1)))) InVars {addition_~n=v_addition_~n_10, addition_~m=v_addition_~m_5} OutVars{addition_#in~m=|v_addition_#in~mInParam_2|, addition_#in~n=|v_addition_#in~nInParam_2|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 538#additionENTRY [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 541#L14 [86] L14-->L17: Formula: (> 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 548#L17 [78] L17-->L20: Formula: (>= 0 v_addition_~n_2) InVars {addition_~n=v_addition_~n_2} OutVars{addition_~n=v_addition_~n_2} AuxVars[] AssignedVars[] 542#L20 [2020-06-22 01:51:27,674 INFO L796 eck$LassoCheckResult]: Loop: 542#L20 [49] L20-->L21: Formula: (< v_addition_~n_3 0) InVars {addition_~n=v_addition_~n_3} OutVars{addition_~n=v_addition_~n_3} AuxVars[] AssignedVars[] 544#L21 [52] L21-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_3| (+ v_addition_~m_6 (- 1))) (= |v_addition_#in~nInParam_3| (+ v_addition_~n_11 1))) InVars {addition_~n=v_addition_~n_11, addition_~m=v_addition_~m_6} OutVars{addition_#in~m=|v_addition_#in~mInParam_3|, addition_#in~n=|v_addition_#in~nInParam_3|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 546#additionENTRY [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 555#L14 [85] L14-->L17: Formula: (< 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 551#L17 [57] L17-->L18: Formula: (< 0 v_addition_~n_9) InVars {addition_~n=v_addition_~n_9} OutVars{addition_~n=v_addition_~n_9} AuxVars[] AssignedVars[] 543#L18 [56] L18-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_2| (+ v_addition_~m_5 1)) (= |v_addition_#in~nInParam_2| (+ v_addition_~n_10 (- 1)))) InVars {addition_~n=v_addition_~n_10, addition_~m=v_addition_~m_5} OutVars{addition_#in~m=|v_addition_#in~mInParam_2|, addition_#in~n=|v_addition_#in~nInParam_2|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 550#additionENTRY [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 554#L14 [86] L14-->L17: Formula: (> 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 553#L17 [78] L17-->L20: Formula: (>= 0 v_addition_~n_2) InVars {addition_~n=v_addition_~n_2} OutVars{addition_~n=v_addition_~n_2} AuxVars[] AssignedVars[] 542#L20 [2020-06-22 01:51:27,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:51:27,674 INFO L82 PathProgramCache]: Analyzing trace with hash 984366642, now seen corresponding path program 1 times [2020-06-22 01:51:27,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:51:27,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:51:27,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:27,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:51:27,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:51:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:51:27,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:51:27,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 01:51:27,699 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 01:51:27,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:51:27,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1767848472, now seen corresponding path program 1 times [2020-06-22 01:51:27,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:51:27,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:51:27,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:27,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:51:27,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:51:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:51:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 01:51:27,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:51:27,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 01:51:27,725 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 01:51:27,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 01:51:27,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 01:51:27,726 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-06-22 01:51:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:51:27,761 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-06-22 01:51:27,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 01:51:27,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2020-06-22 01:51:27,763 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 01:51:27,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2020-06-22 01:51:27,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 01:51:27,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 01:51:27,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 01:51:27,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 01:51:27,764 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 01:51:27,764 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 01:51:27,764 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 01:51:27,764 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 01:51:27,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 01:51:27,765 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 01:51:27,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 01:51:27,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 01:51:27 BasicIcfg [2020-06-22 01:51:27,771 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 01:51:27,772 INFO L168 Benchmark]: Toolchain (without parser) took 14746.61 ms. Allocated memory was 514.9 MB in the beginning and 619.7 MB in the end (delta: 104.9 MB). Free memory was 440.0 MB in the beginning and 428.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 116.0 MB. Max. memory is 50.3 GB. [2020-06-22 01:51:27,773 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 462.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 01:51:27,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.60 ms. Allocated memory was 514.9 MB in the beginning and 591.9 MB in the end (delta: 77.1 MB). Free memory was 439.4 MB in the beginning and 561.4 MB in the end (delta: -121.9 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. [2020-06-22 01:51:27,774 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.05 ms. Allocated memory is still 591.9 MB. Free memory was 561.4 MB in the beginning and 559.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-06-22 01:51:27,775 INFO L168 Benchmark]: Boogie Preprocessor took 18.18 ms. Allocated memory is still 591.9 MB. Free memory was 559.7 MB in the beginning and 558.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 01:51:27,775 INFO L168 Benchmark]: RCFGBuilder took 245.76 ms. Allocated memory is still 591.9 MB. Free memory was 558.7 MB in the beginning and 544.8 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 50.3 GB. [2020-06-22 01:51:27,776 INFO L168 Benchmark]: BlockEncodingV2 took 88.07 ms. Allocated memory is still 591.9 MB. Free memory was 544.8 MB in the beginning and 538.9 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 50.3 GB. [2020-06-22 01:51:27,776 INFO L168 Benchmark]: TraceAbstraction took 166.75 ms. Allocated memory is still 591.9 MB. Free memory was 538.4 MB in the beginning and 528.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 50.3 GB. [2020-06-22 01:51:27,777 INFO L168 Benchmark]: BuchiAutomizer took 13896.03 ms. Allocated memory was 591.9 MB in the beginning and 619.7 MB in the end (delta: 27.8 MB). Free memory was 527.5 MB in the beginning and 428.8 MB in the end (delta: 98.7 MB). Peak memory consumption was 126.5 MB. Max. memory is 50.3 GB. [2020-06-22 01:51:27,781 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 20 locations, 27 edges - StatisticsResult: Encoded RCFG 12 locations, 17 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 462.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 290.60 ms. Allocated memory was 514.9 MB in the beginning and 591.9 MB in the end (delta: 77.1 MB). Free memory was 439.4 MB in the beginning and 561.4 MB in the end (delta: -121.9 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 36.05 ms. Allocated memory is still 591.9 MB. Free memory was 561.4 MB in the beginning and 559.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 18.18 ms. Allocated memory is still 591.9 MB. Free memory was 559.7 MB in the beginning and 558.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 245.76 ms. Allocated memory is still 591.9 MB. Free memory was 558.7 MB in the beginning and 544.8 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 88.07 ms. Allocated memory is still 591.9 MB. Free memory was 544.8 MB in the beginning and 538.9 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 50.3 GB. * TraceAbstraction took 166.75 ms. Allocated memory is still 591.9 MB. Free memory was 538.4 MB in the beginning and 528.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 13896.03 ms. Allocated memory was 591.9 MB in the beginning and 619.7 MB in the end (delta: 27.8 MB). Free memory was 527.5 MB in the beginning and 428.8 MB in the end (delta: 98.7 MB). Peak memory consumption was 126.5 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 0 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 4 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function \old(n) and consists of 6 locations. One nondeterministic module has affine ranking function -1 * n and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.8s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 13.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 46 SDtfs, 71 SDslu, 40 SDs, 0 SdLazy, 130 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq168 hnf92 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 11.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 01:51:09.703 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 01:51:28.013 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check