YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 05:40:10,153 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 05:40:10,155 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 05:40:10,166 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 05:40:10,167 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 05:40:10,167 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 05:40:10,169 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 05:40:10,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 05:40:10,172 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 05:40:10,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 05:40:10,173 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 05:40:10,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 05:40:10,174 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 05:40:10,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 05:40:10,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 05:40:10,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 05:40:10,178 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 05:40:10,179 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 05:40:10,181 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 05:40:10,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 05:40:10,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 05:40:10,185 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 05:40:10,187 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 05:40:10,187 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 05:40:10,187 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 05:40:10,188 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 05:40:10,188 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 05:40:10,189 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 05:40:10,190 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 05:40:10,190 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 05:40:10,191 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 05:40:10,192 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 05:40:10,192 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 05:40:10,193 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 05:40:10,193 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 05:40:10,194 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 05:40:10,194 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 05:40:10,195 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 05:40:10,195 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 05:40:10,196 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 05:40:10,210 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 05:40:10,210 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 05:40:10,211 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 05:40:10,211 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 05:40:10,211 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 05:40:10,212 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:40:10,212 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 05:40:10,212 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 05:40:10,212 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 05:40:10,212 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 05:40:10,212 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 05:40:10,213 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 05:40:10,213 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 05:40:10,213 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 05:40:10,213 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:40:10,213 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 05:40:10,213 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 05:40:10,214 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 05:40:10,214 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 05:40:10,214 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 05:40:10,214 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 05:40:10,214 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 05:40:10,214 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 05:40:10,215 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 05:40:10,215 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:40:10,215 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 05:40:10,215 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 05:40:10,215 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 05:40:10,215 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 05:40:10,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 05:40:10,252 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 05:40:10,256 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 05:40:10,257 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 05:40:10,257 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 05:40:10,258 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 05:40:10,328 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/d8c1b8e127ca45ffbc2e959b3a97295c/FLAG92f6a8547 [2020-06-22 05:40:10,663 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 05:40:10,664 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 05:40:10,670 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/d8c1b8e127ca45ffbc2e959b3a97295c/FLAG92f6a8547 [2020-06-22 05:40:11,075 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/d8c1b8e127ca45ffbc2e959b3a97295c [2020-06-22 05:40:11,087 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 05:40:11,089 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 05:40:11,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 05:40:11,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 05:40:11,094 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 05:40:11,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:40:11" (1/1) ... [2020-06-22 05:40:11,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d4fac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:40:11, skipping insertion in model container [2020-06-22 05:40:11,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:40:11" (1/1) ... [2020-06-22 05:40:11,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 05:40:11,123 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 05:40:11,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:40:11,284 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 05:40:11,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:40:11,374 INFO L195 MainTranslator]: Completed translation [2020-06-22 05:40:11,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:40:11 WrapperNode [2020-06-22 05:40:11,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 05:40:11,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 05:40:11,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 05:40:11,376 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 05:40:11,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:40:11" (1/1) ... [2020-06-22 05:40:11,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:40:11" (1/1) ... [2020-06-22 05:40:11,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 05:40:11,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 05:40:11,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 05:40:11,412 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 05:40:11,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:40:11" (1/1) ... [2020-06-22 05:40:11,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:40:11" (1/1) ... [2020-06-22 05:40:11,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:40:11" (1/1) ... [2020-06-22 05:40:11,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:40:11" (1/1) ... [2020-06-22 05:40:11,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:40:11" (1/1) ... [2020-06-22 05:40:11,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:40:11" (1/1) ... [2020-06-22 05:40:11,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:40:11" (1/1) ... [2020-06-22 05:40:11,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 05:40:11,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 05:40:11,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 05:40:11,430 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 05:40:11,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:40:11" (1/1) ... No working directory specified, using /export/starexec/sandbox2/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 05:40:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2020-06-22 05:40:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2020-06-22 05:40:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2020-06-22 05:40:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2020-06-22 05:40:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 05:40:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 05:40:11,683 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 05:40:11,683 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2020-06-22 05:40:11,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:40:11 BoogieIcfgContainer [2020-06-22 05:40:11,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 05:40:11,685 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 05:40:11,686 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 05:40:11,690 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 05:40:11,691 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:40:11" (1/1) ... [2020-06-22 05:40:11,709 INFO L313 BlockEncoder]: Initial Icfg 20 locations, 24 edges [2020-06-22 05:40:11,711 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 05:40:11,711 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 05:40:11,712 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 05:40:11,712 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:40:11,714 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 05:40:11,715 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 05:40:11,715 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 05:40:11,729 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 05:40:11,737 INFO L200 BlockEncoder]: SBE split 0 edges [2020-06-22 05:40:11,742 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:40:11,743 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:40:11,755 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 05:40:11,758 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-06-22 05:40:11,759 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:40:11,760 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:40:11,760 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 05:40:11,761 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 05:40:11,761 INFO L313 BlockEncoder]: Encoded RCFG 16 locations, 20 edges [2020-06-22 05:40:11,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:40:11 BasicIcfg [2020-06-22 05:40:11,762 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 05:40:11,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 05:40:11,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 05:40:11,766 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 05:40:11,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 05:40:11" (1/4) ... [2020-06-22 05:40:11,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103128ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:40:11, skipping insertion in model container [2020-06-22 05:40:11,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:40:11" (2/4) ... [2020-06-22 05:40:11,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103128ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:40:11, skipping insertion in model container [2020-06-22 05:40:11,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:40:11" (3/4) ... [2020-06-22 05:40:11,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103128ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:40:11, skipping insertion in model container [2020-06-22 05:40:11,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:40:11" (4/4) ... [2020-06-22 05:40:11,769 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:40:11,780 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 05:40:11,787 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 05:40:11,805 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 05:40:11,838 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:40:11,838 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 05:40:11,839 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 05:40:11,839 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:40:11,839 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:40:11,839 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:40:11,839 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 05:40:11,839 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:40:11,839 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 05:40:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-06-22 05:40:11,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 05:40:11,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-06-22 05:40:11,937 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 5 9) the Hoare annotation is: true [2020-06-22 05:40:11,938 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 5 9) no Hoare annotation was computed. [2020-06-22 05:40:11,938 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 5 9) no Hoare annotation was computed. [2020-06-22 05:40:11,938 INFO L451 ceAbstractionStarter]: At program point L8(line 8) the Hoare annotation is: true [2020-06-22 05:40:11,938 INFO L451 ceAbstractionStarter]: At program point L8-1(line 8) the Hoare annotation is: true [2020-06-22 05:40:11,938 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 7) no Hoare annotation was computed. [2020-06-22 05:40:11,939 INFO L448 ceAbstractionStarter]: For program point L8-2(line 8) no Hoare annotation was computed. [2020-06-22 05:40:11,939 INFO L451 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: true [2020-06-22 05:40:11,939 INFO L451 ceAbstractionStarter]: At program point L14-1(line 14) the Hoare annotation is: true [2020-06-22 05:40:11,939 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2020-06-22 05:40:11,939 INFO L448 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2020-06-22 05:40:11,939 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 11 15) the Hoare annotation is: true [2020-06-22 05:40:11,940 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 11 15) no Hoare annotation was computed. [2020-06-22 05:40:11,940 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 11 15) no Hoare annotation was computed. [2020-06-22 05:40:11,940 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 05:40:11,940 INFO L451 ceAbstractionStarter]: At program point L19(line 19) the Hoare annotation is: true [2020-06-22 05:40:11,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:40:11 BasicIcfg [2020-06-22 05:40:11,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 05:40:11,944 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 05:40:11,944 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 05:40:11,948 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 05:40:11,949 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:40:11,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 05:40:11" (1/5) ... [2020-06-22 05:40:11,950 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@531e85a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:40:11, skipping insertion in model container [2020-06-22 05:40:11,950 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:40:11,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:40:11" (2/5) ... [2020-06-22 05:40:11,950 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@531e85a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:40:11, skipping insertion in model container [2020-06-22 05:40:11,951 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:40:11,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:40:11" (3/5) ... [2020-06-22 05:40:11,951 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@531e85a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:40:11, skipping insertion in model container [2020-06-22 05:40:11,951 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:40:11,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:40:11" (4/5) ... [2020-06-22 05:40:11,952 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@531e85a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:40:11, skipping insertion in model container [2020-06-22 05:40:11,952 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:40:11,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:40:11" (5/5) ... [2020-06-22 05:40:11,954 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:40:11,982 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:40:11,983 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 05:40:11,983 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 05:40:11,983 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:40:11,983 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:40:11,983 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:40:11,983 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 05:40:11,984 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:40:11,984 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 05:40:11,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-06-22 05:40:12,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:40:12,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:40:12,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:40:12,019 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 05:40:12,019 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:40:12,019 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 05:40:12,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-06-22 05:40:12,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:40:12,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:40:12,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:40:12,022 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 05:40:12,022 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:40:12,028 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue [47] ULTIMATE.startENTRY-->L19: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 10#L19true [45] L19-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_3| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_3|} AuxVars[] AssignedVars[rec2_#in~j]< 3#rec2ENTRYtrue [2020-06-22 05:40:12,029 INFO L796 eck$LassoCheckResult]: Loop: 3#rec2ENTRYtrue [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 4#L12true [59] L12-->L14: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 8#L14true [42] L14-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 3#rec2ENTRYtrue [2020-06-22 05:40:12,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:40:12,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2463, now seen corresponding path program 1 times [2020-06-22 05:40:12,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:40:12,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:40:12,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:12,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:40:12,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:40:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:40:12,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:40:12,104 INFO L82 PathProgramCache]: Analyzing trace with hash 65297, now seen corresponding path program 1 times [2020-06-22 05:40:12,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:40:12,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:40:12,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:12,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:40:12,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:40:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:40:12,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:40:12,123 INFO L82 PathProgramCache]: Analyzing trace with hash 73410739, now seen corresponding path program 1 times [2020-06-22 05:40:12,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:40:12,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:40:12,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:12,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:40:12,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:40:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:40:12,209 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:40:12,211 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:40:12,211 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:40:12,211 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:40:12,211 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:40:12,212 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:40:12,212 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:40:12,212 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:40:12,212 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:40:12,212 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:40:12,212 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:40:12,230 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 05:40:12,239 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 05:40:12,241 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 05:40:12,246 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 05:40:12,257 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 05:40:12,305 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:40:12,306 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/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 05:40:12,313 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:40:12,314 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:40:12,323 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:40:12,323 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#res=0} Honda state: {rec2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/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 05:40:12,355 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:40:12,355 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:40:12,359 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:40:12,359 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret2=0} Honda state: {rec2_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/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 05:40:12,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:40:12,388 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:40:12,394 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:40:12,394 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret3=0} Honda state: {rec2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/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 05:40:12,429 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:40:12,429 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/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 05:40:12,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:40:12,462 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:40:12,494 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:40:12,496 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:40:12,497 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:40:12,497 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:40:12,497 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:40:12,497 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:40:12,497 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:40:12,497 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:40:12,497 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:40:12,498 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:40:12,498 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:40:12,498 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:40:12,499 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 05:40:12,502 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 05:40:12,507 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 05:40:12,515 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 05:40:12,527 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 05:40:12,580 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:40:12,586 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:40:12,588 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 05:40:12,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:40:12,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:40:12,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:40:12,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:40:12,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:40:12,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:40:12,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:40:12,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:40:12,599 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 05:40:12,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:40:12,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:40:12,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:40:12,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:40:12,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:40:12,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:40:12,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:40:12,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:40:12,603 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 05:40:12,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:40:12,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:40:12,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:40:12,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:40:12,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:40:12,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:40:12,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:40:12,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:40:12,607 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 05:40:12,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:40:12,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:40:12,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:40:12,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:40:12,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:40:12,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:40:12,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:40:12,617 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:40:12,622 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:40:12,623 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:40:12,625 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:40:12,625 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:40:12,625 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:40:12,626 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2020-06-22 05:40:12,627 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:40:12,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:40:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:40:12,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:40:12,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:40:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:40:12,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:40:12,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:40:12,731 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 05:40:12,755 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 05:40:12,760 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 05:40:12,762 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states. Second operand 4 states. [2020-06-22 05:40:12,848 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states.. Second operand 4 states. Result 38 states and 48 transitions. Complement of second has 16 states. [2020-06-22 05:40:12,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 05:40:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 05:40:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-06-22 05:40:12,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-22 05:40:12,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:40:12,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 05:40:12,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:40:12,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 05:40:12,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:40:12,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2020-06-22 05:40:12,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:40:12,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 36 transitions. [2020-06-22 05:40:12,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 05:40:12,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 05:40:12,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2020-06-22 05:40:12,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:40:12,879 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-06-22 05:40:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2020-06-22 05:40:12,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2020-06-22 05:40:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 05:40:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-06-22 05:40:12,915 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-06-22 05:40:12,916 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-06-22 05:40:12,916 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 05:40:12,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2020-06-22 05:40:12,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:40:12,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:40:12,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:40:12,918 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:40:12,919 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:40:12,919 INFO L794 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L19: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 111#L19 [45] L19-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_3| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_3|} AuxVars[] AssignedVars[rec2_#in~j]< 110#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 112#L12 [59] L12-->L14: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 115#L14 [42] L14-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 113#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 117#L12 [36] L12-->rec2FINAL: Formula: (and (<= v_rec2_~j_2 0) (= |v_rec2_#res_2| 0)) InVars {rec2_~j=v_rec2_~j_2} OutVars{rec2_~j=v_rec2_~j_2, rec2_#res=|v_rec2_#res_2|} AuxVars[] AssignedVars[rec2_#res] 118#rec2FINAL [44] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 131#rec2EXIT >[54] rec2EXIT-->L14-1: AOR: Formula: (= |v_rec2_#t~ret2_4| |v_rec2_#resOutParam_2|) InVars {rec2_#res=|v_rec2_#resOutParam_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_4|} AuxVars[] AssignedVars[rec2_#t~ret2] LVA: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j] 125#L14-1 [46] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 123#rec1ENTRY [2020-06-22 05:40:12,919 INFO L796 eck$LassoCheckResult]: Loop: 123#rec1ENTRY [39] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 127#L6 [60] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 126#L8 [49] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 1)) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 123#rec1ENTRY [2020-06-22 05:40:12,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:40:12,920 INFO L82 PathProgramCache]: Analyzing trace with hash 753569552, now seen corresponding path program 1 times [2020-06-22 05:40:12,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:40:12,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:40:12,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:12,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:40:12,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:40:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:40:12,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:40:12,933 INFO L82 PathProgramCache]: Analyzing trace with hash 69179, now seen corresponding path program 1 times [2020-06-22 05:40:12,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:40:12,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:40:12,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:12,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:40:12,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:40:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:40:12,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:40:12,939 INFO L82 PathProgramCache]: Analyzing trace with hash -203493172, now seen corresponding path program 1 times [2020-06-22 05:40:12,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:40:12,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:40:12,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:12,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:40:12,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:40:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 05:40:13,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:40:13,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 05:40:13,035 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:40:13,035 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:40:13,036 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:40:13,036 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:40:13,036 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:40:13,036 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:40:13,036 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:40:13,036 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:40:13,036 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 05:40:13,036 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:40:13,036 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:40:13,038 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 05:40:13,043 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 05:40:13,045 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 05:40:13,048 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 05:40:13,052 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 05:40:13,090 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:40:13,090 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/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 05:40:13,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:40:13,104 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/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 05:40:13,141 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:40:13,141 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:40:13,152 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:40:13,152 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#in~i=1} Honda state: {rec1_#in~i=1} Generalized eigenvectors: [{rec1_#in~i=1}, {rec1_#in~i=0}, {rec1_#in~i=0}] Lambdas: [1, 0, 0] Nus: [0, 0] No working directory specified, using /export/starexec/sandbox2/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 05:40:13,181 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:40:13,181 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:40:13,184 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:40:13,184 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/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 05:40:13,213 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:40:13,213 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:40:13,217 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:40:13,217 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/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 05:40:13,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:40:13,246 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:40:13,250 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:40:13,250 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/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 05:40:13,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:40:13,280 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:40:13,284 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:40:13,284 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2020-06-22 05:40:13,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 05:40:13,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 05:40:13,312 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. cyclomatic complexity: 10 Second operand 6 states. [2020-06-22 05:40:13,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:40:13,363 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2020-06-22 05:40:13,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 05:40:13,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2020-06-22 05:40:13,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:40:13,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 44 transitions. [2020-06-22 05:40:13,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-06-22 05:40:13,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-06-22 05:40:13,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2020-06-22 05:40:13,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:40:13,374 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-06-22 05:40:13,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2020-06-22 05:40:13,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-06-22 05:40:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 05:40:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2020-06-22 05:40:13,379 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2020-06-22 05:40:13,379 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2020-06-22 05:40:13,379 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 05:40:13,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 40 transitions. [2020-06-22 05:40:13,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:40:13,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:40:13,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:40:13,382 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:40:13,382 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:40:13,383 INFO L794 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L19: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 186#L19 [45] L19-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_3| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_3|} AuxVars[] AssignedVars[rec2_#in~j]< 185#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 187#L12 [59] L12-->L14: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 189#L14 [42] L14-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 188#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 191#L12 [59] L12-->L14: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 190#L14 [42] L14-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 188#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 192#L12 [36] L12-->rec2FINAL: Formula: (and (<= v_rec2_~j_2 0) (= |v_rec2_#res_2| 0)) InVars {rec2_~j=v_rec2_~j_2} OutVars{rec2_~j=v_rec2_~j_2, rec2_#res=|v_rec2_#res_2|} AuxVars[] AssignedVars[rec2_#res] 193#rec2FINAL [44] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 206#rec2EXIT >[54] rec2EXIT-->L14-1: AOR: Formula: (= |v_rec2_#t~ret2_4| |v_rec2_#resOutParam_2|) InVars {rec2_#res=|v_rec2_#resOutParam_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_4|} AuxVars[] AssignedVars[rec2_#t~ret2] LVA: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j] 199#L14-1 [46] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 198#rec1ENTRY [39] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 200#L6 [50] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 210#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 207#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 194#L14-2 [38] L14-2-->rec2FINAL: Formula: (= |v_rec2_#res_1| |v_rec2_#t~ret3_2|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_1|, rec2_#t~ret3=|v_rec2_#t~ret3_1|, rec2_#res=|v_rec2_#res_1|} AuxVars[] AssignedVars[rec2_#t~ret2, rec2_#t~ret3, rec2_#res] 197#rec2FINAL [44] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 216#rec2EXIT >[54] rec2EXIT-->L14-1: AOR: Formula: (= |v_rec2_#t~ret2_4| |v_rec2_#resOutParam_2|) InVars {rec2_#res=|v_rec2_#resOutParam_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_4|} AuxVars[] AssignedVars[rec2_#t~ret2] LVA: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j] 202#L14-1 [2020-06-22 05:40:13,384 INFO L796 eck$LassoCheckResult]: Loop: 202#L14-1 [46] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 209#rec1ENTRY [39] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 214#L6 [60] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 203#L8 [49] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 1)) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 209#rec1ENTRY [39] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 214#L6 [50] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 201#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 204#rec1EXIT >[56] rec1EXIT-->L8-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 1)) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 195#L8-1 [48] L8-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec1_#t~ret0_5|) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 205#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 212#L12 [59] L12-->L14: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 196#L14 [42] L14-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 205#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 212#L12 [59] L12-->L14: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 196#L14 [42] L14-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 205#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 212#L12 [36] L12-->rec2FINAL: Formula: (and (<= v_rec2_~j_2 0) (= |v_rec2_#res_2| 0)) InVars {rec2_~j=v_rec2_~j_2} OutVars{rec2_~j=v_rec2_~j_2, rec2_#res=|v_rec2_#res_2|} AuxVars[] AssignedVars[rec2_#res] 213#rec2FINAL [44] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 215#rec2EXIT >[54] rec2EXIT-->L14-1: AOR: Formula: (= |v_rec2_#t~ret2_4| |v_rec2_#resOutParam_2|) InVars {rec2_#res=|v_rec2_#resOutParam_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_4|} AuxVars[] AssignedVars[rec2_#t~ret2] LVA: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j] 199#L14-1 [46] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 198#rec1ENTRY [39] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 200#L6 [50] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 210#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 207#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 194#L14-2 [38] L14-2-->rec2FINAL: Formula: (= |v_rec2_#res_1| |v_rec2_#t~ret3_2|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_1|, rec2_#t~ret3=|v_rec2_#t~ret3_1|, rec2_#res=|v_rec2_#res_1|} AuxVars[] AssignedVars[rec2_#t~ret2, rec2_#t~ret3, rec2_#res] 197#rec2FINAL [44] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 216#rec2EXIT >[54] rec2EXIT-->L14-1: AOR: Formula: (= |v_rec2_#t~ret2_4| |v_rec2_#resOutParam_2|) InVars {rec2_#res=|v_rec2_#resOutParam_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_4|} AuxVars[] AssignedVars[rec2_#t~ret2] LVA: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j] 202#L14-1 [2020-06-22 05:40:13,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:40:13,384 INFO L82 PathProgramCache]: Analyzing trace with hash -40851153, now seen corresponding path program 1 times [2020-06-22 05:40:13,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:40:13,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:40:13,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:13,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:40:13,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:40:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:40:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:40:13,404 INFO L82 PathProgramCache]: Analyzing trace with hash -950623466, now seen corresponding path program 1 times [2020-06-22 05:40:13,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:40:13,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:40:13,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:13,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:40:13,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:40:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-06-22 05:40:13,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:40:13,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:40:13,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:40:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:40:13,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:40:13,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:40:13,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-06-22 05:40:13,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 05:40:13,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2020-06-22 05:40:13,549 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:40:13,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 05:40:13,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 05:40:13,550 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-06-22 05:40:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:40:13,588 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-06-22 05:40:13,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 05:40:13,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2020-06-22 05:40:13,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 05:40:13,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 28 transitions. [2020-06-22 05:40:13,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 05:40:13,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 05:40:13,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2020-06-22 05:40:13,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:40:13,593 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-06-22 05:40:13,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2020-06-22 05:40:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 05:40:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 05:40:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-06-22 05:40:13,597 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-06-22 05:40:13,597 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-06-22 05:40:13,597 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 05:40:13,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2020-06-22 05:40:13,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 05:40:13,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:40:13,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:40:13,599 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:40:13,599 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:40:13,600 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L19: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 333#L19 [45] L19-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_3| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_3|} AuxVars[] AssignedVars[rec2_#in~j]< 332#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 334#L12 [59] L12-->L14: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 336#L14 [42] L14-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 335#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 339#L12 [59] L12-->L14: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 337#L14 [42] L14-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 335#rec2ENTRY [35] rec2ENTRY-->L12: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 338#L12 [36] L12-->rec2FINAL: Formula: (and (<= v_rec2_~j_2 0) (= |v_rec2_#res_2| 0)) InVars {rec2_~j=v_rec2_~j_2} OutVars{rec2_~j=v_rec2_~j_2, rec2_#res=|v_rec2_#res_2|} AuxVars[] AssignedVars[rec2_#res] 342#rec2FINAL [44] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 349#rec2EXIT >[54] rec2EXIT-->L14-1: AOR: Formula: (= |v_rec2_#t~ret2_4| |v_rec2_#resOutParam_2|) InVars {rec2_#res=|v_rec2_#resOutParam_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_4|} AuxVars[] AssignedVars[rec2_#t~ret2] LVA: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j] 344#L14-1 [46] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 343#rec1ENTRY [39] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 345#L6 [50] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 346#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 347#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 340#L14-2 [38] L14-2-->rec2FINAL: Formula: (= |v_rec2_#res_1| |v_rec2_#t~ret3_2|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_1|, rec2_#t~ret3=|v_rec2_#t~ret3_1|, rec2_#res=|v_rec2_#res_1|} AuxVars[] AssignedVars[rec2_#t~ret2, rec2_#t~ret3, rec2_#res] 341#rec2FINAL [44] rec2FINAL-->rec2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 348#rec2EXIT >[54] rec2EXIT-->L14-1: AOR: Formula: (= |v_rec2_#t~ret2_4| |v_rec2_#resOutParam_2|) InVars {rec2_#res=|v_rec2_#resOutParam_2|} OutVars{rec2_#t~ret2=|v_rec2_#t~ret2_4|} AuxVars[] AssignedVars[rec2_#t~ret2] LVA: Formula: (= |v_rec2_#in~jInParam_2| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j] 352#L14-1 [46] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| |v_rec2_#t~ret2_5|) InVars {rec2_#t~ret2=|v_rec2_#t~ret2_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 353#rec1ENTRY [2020-06-22 05:40:13,600 INFO L796 eck$LassoCheckResult]: Loop: 353#rec1ENTRY [39] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 354#L6 [60] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 351#L8 [49] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 1)) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 353#rec1ENTRY [2020-06-22 05:40:13,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:40:13,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1266385697, now seen corresponding path program 2 times [2020-06-22 05:40:13,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:40:13,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:40:13,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:13,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:40:13,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:40:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:40:13,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:40:13,618 INFO L82 PathProgramCache]: Analyzing trace with hash 69179, now seen corresponding path program 2 times [2020-06-22 05:40:13,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:40:13,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:40:13,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:13,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:40:13,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:40:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:40:13,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:40:13,624 INFO L82 PathProgramCache]: Analyzing trace with hash 96468125, now seen corresponding path program 1 times [2020-06-22 05:40:13,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:40:13,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:40:13,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:13,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:40:13,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:40:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:40:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-06-22 05:40:13,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:40:13,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 05:40:13,702 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:40:13,703 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:40:13,703 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:40:13,703 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:40:13,703 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:40:13,703 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:40:13,703 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:40:13,703 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:40:13,704 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 05:40:13,704 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:40:13,704 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:40:13,705 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 05:40:13,708 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 05:40:13,710 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 05:40:13,712 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 05:40:13,714 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 05:40:13,747 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:40:13,747 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/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 05:40:13,751 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:40:13,751 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:40:13,755 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:40:13,755 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/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 05:40:13,782 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:40:13,782 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:40:13,786 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:40:13,786 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/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 05:40:13,812 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:40:13,813 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:40:13,817 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:40:13,817 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:40:13,845 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:40:13,846 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:40:13,849 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:40:13,849 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:40:13,879 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:40:13,879 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:40:13,910 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:40:13,910 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:40:13,922 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:40:13,922 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#in~i=1} Honda state: {rec1_#in~i=1} Generalized eigenvectors: [{rec1_#in~i=1}, {rec1_#in~i=0}, {rec1_#in~i=0}] Lambdas: [1, 0, 0] Nus: [0, 0] [2020-06-22 05:40:13,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 05:40:13,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-06-22 05:40:13,951 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. cyclomatic complexity: 5 Second operand 8 states. [2020-06-22 05:40:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:40:14,013 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-06-22 05:40:14,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 05:40:14,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2020-06-22 05:40:14,017 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:40:14,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2020-06-22 05:40:14,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 05:40:14,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 05:40:14,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 05:40:14,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 05:40:14,018 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:40:14,018 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:40:14,018 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:40:14,018 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 05:40:14,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 05:40:14,018 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:40:14,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 05:40:14,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:40:14 BasicIcfg [2020-06-22 05:40:14,024 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 05:40:14,025 INFO L168 Benchmark]: Toolchain (without parser) took 2937.11 ms. Allocated memory was 514.9 MB in the beginning and 596.6 MB in the end (delta: 81.8 MB). Free memory was 436.1 MB in the beginning and 462.4 MB in the end (delta: -26.3 MB). Peak memory consumption was 55.5 MB. Max. memory is 50.3 GB. [2020-06-22 05:40:14,027 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 456.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 05:40:14,027 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.56 ms. Allocated memory was 514.9 MB in the beginning and 570.4 MB in the end (delta: 55.6 MB). Free memory was 436.1 MB in the beginning and 541.8 MB in the end (delta: -105.6 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. [2020-06-22 05:40:14,028 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.25 ms. Allocated memory is still 570.4 MB. Free memory was 541.8 MB in the beginning and 540.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. [2020-06-22 05:40:14,028 INFO L168 Benchmark]: Boogie Preprocessor took 16.94 ms. Allocated memory is still 570.4 MB. Free memory was 539.5 MB in the beginning and 538.7 MB in the end (delta: 759.4 kB). Peak memory consumption was 759.4 kB. Max. memory is 50.3 GB. [2020-06-22 05:40:14,029 INFO L168 Benchmark]: RCFGBuilder took 255.51 ms. Allocated memory is still 570.4 MB. Free memory was 538.7 MB in the beginning and 527.0 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 50.3 GB. [2020-06-22 05:40:14,030 INFO L168 Benchmark]: BlockEncodingV2 took 76.29 ms. Allocated memory is still 570.4 MB. Free memory was 527.0 MB in the beginning and 521.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 05:40:14,030 INFO L168 Benchmark]: TraceAbstraction took 181.38 ms. Allocated memory is still 570.4 MB. Free memory was 521.6 MB in the beginning and 510.2 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 50.3 GB. [2020-06-22 05:40:14,031 INFO L168 Benchmark]: BuchiAutomizer took 2079.96 ms. Allocated memory was 570.4 MB in the beginning and 596.6 MB in the end (delta: 26.2 MB). Free memory was 510.2 MB in the beginning and 462.4 MB in the end (delta: 47.7 MB). Peak memory consumption was 74.0 MB. Max. memory is 50.3 GB. [2020-06-22 05:40:14,035 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 20 locations, 24 edges - StatisticsResult: Encoded RCFG 16 locations, 20 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 456.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 285.56 ms. Allocated memory was 514.9 MB in the beginning and 570.4 MB in the end (delta: 55.6 MB). Free memory was 436.1 MB in the beginning and 541.8 MB in the end (delta: -105.6 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 36.25 ms. Allocated memory is still 570.4 MB. Free memory was 541.8 MB in the beginning and 540.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 16.94 ms. Allocated memory is still 570.4 MB. Free memory was 539.5 MB in the beginning and 538.7 MB in the end (delta: 759.4 kB). Peak memory consumption was 759.4 kB. Max. memory is 50.3 GB. * RCFGBuilder took 255.51 ms. Allocated memory is still 570.4 MB. Free memory was 538.7 MB in the beginning and 527.0 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 76.29 ms. Allocated memory is still 570.4 MB. Free memory was 527.0 MB in the beginning and 521.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 181.38 ms. Allocated memory is still 570.4 MB. Free memory was 521.6 MB in the beginning and 510.2 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2079.96 ms. Allocated memory was 570.4 MB in the beginning and 596.6 MB in the end (delta: 26.2 MB). Free memory was 510.2 MB in the beginning and 462.4 MB in the end (delta: 47.7 MB). Peak memory consumption was 74.0 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 3 procedures, 16 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=16occurred 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, 7 LocationsWithAnnotation, 16 PreInvPairs, 16 NumberOfFragments, 7 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function \old(j) and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 5 iterations. TraceHistogramMax:3. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 58 SDtfs, 41 SDslu, 156 SDs, 0 SdLazy, 87 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 05:40:07.824 ----------------------------------------------- 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/sandbox2/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/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 05:40:14.274 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check