353.98/291.34 NO 353.98/291.34 353.98/291.34 Ultimate: Cannot open display: 353.98/291.34 This is Ultimate 0.1.24-8dc7c08-m 353.98/291.34 [2019-03-28 22:32:31,385 INFO L170 SettingsManager]: Resetting all preferences to default values... 353.98/291.34 [2019-03-28 22:32:31,387 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 353.98/291.34 [2019-03-28 22:32:31,399 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 353.98/291.34 [2019-03-28 22:32:31,399 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 353.98/291.34 [2019-03-28 22:32:31,400 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 353.98/291.34 [2019-03-28 22:32:31,401 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 353.98/291.34 [2019-03-28 22:32:31,403 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 353.98/291.34 [2019-03-28 22:32:31,404 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 353.98/291.34 [2019-03-28 22:32:31,405 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 353.98/291.34 [2019-03-28 22:32:31,406 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 353.98/291.34 [2019-03-28 22:32:31,406 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 353.98/291.34 [2019-03-28 22:32:31,407 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 353.98/291.34 [2019-03-28 22:32:31,408 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 353.98/291.34 [2019-03-28 22:32:31,409 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 353.98/291.34 [2019-03-28 22:32:31,409 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 353.98/291.34 [2019-03-28 22:32:31,410 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 353.98/291.34 [2019-03-28 22:32:31,412 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 353.98/291.34 [2019-03-28 22:32:31,414 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 353.98/291.34 [2019-03-28 22:32:31,415 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 353.98/291.34 [2019-03-28 22:32:31,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 353.98/291.34 [2019-03-28 22:32:31,417 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 353.98/291.34 [2019-03-28 22:32:31,419 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 353.98/291.34 [2019-03-28 22:32:31,419 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 353.98/291.34 [2019-03-28 22:32:31,420 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 353.98/291.34 [2019-03-28 22:32:31,420 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 353.98/291.34 [2019-03-28 22:32:31,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 353.98/291.34 [2019-03-28 22:32:31,422 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 353.98/291.34 [2019-03-28 22:32:31,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 353.98/291.34 [2019-03-28 22:32:31,422 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 353.98/291.34 [2019-03-28 22:32:31,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 353.98/291.34 [2019-03-28 22:32:31,424 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 353.98/291.34 [2019-03-28 22:32:31,425 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 353.98/291.34 [2019-03-28 22:32:31,425 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 353.98/291.34 [2019-03-28 22:32:31,426 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 353.98/291.34 [2019-03-28 22:32:31,426 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 353.98/291.34 [2019-03-28 22:32:31,426 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 353.98/291.34 [2019-03-28 22:32:31,427 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 353.98/291.34 [2019-03-28 22:32:31,428 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 353.98/291.34 [2019-03-28 22:32:31,428 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 353.98/291.34 [2019-03-28 22:32:31,442 INFO L110 SettingsManager]: Loading preferences was successful 353.98/291.34 [2019-03-28 22:32:31,442 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 353.98/291.34 [2019-03-28 22:32:31,443 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 353.98/291.34 [2019-03-28 22:32:31,444 INFO L133 SettingsManager]: * Rewrite not-equals=true 353.98/291.34 [2019-03-28 22:32:31,444 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 353.98/291.34 [2019-03-28 22:32:31,444 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 353.98/291.34 [2019-03-28 22:32:31,444 INFO L133 SettingsManager]: * Use SBE=true 353.98/291.34 [2019-03-28 22:32:31,444 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 353.98/291.34 [2019-03-28 22:32:31,445 INFO L133 SettingsManager]: * Use old map elimination=false 353.98/291.34 [2019-03-28 22:32:31,445 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 353.98/291.34 [2019-03-28 22:32:31,445 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 353.98/291.34 [2019-03-28 22:32:31,445 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 353.98/291.34 [2019-03-28 22:32:31,445 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 353.98/291.34 [2019-03-28 22:32:31,445 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 353.98/291.34 [2019-03-28 22:32:31,446 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 353.98/291.34 [2019-03-28 22:32:31,446 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 353.98/291.34 [2019-03-28 22:32:31,446 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 353.98/291.34 [2019-03-28 22:32:31,446 INFO L133 SettingsManager]: * Check division by zero=IGNORE 353.98/291.34 [2019-03-28 22:32:31,446 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 353.98/291.34 [2019-03-28 22:32:31,446 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 353.98/291.34 [2019-03-28 22:32:31,447 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 353.98/291.34 [2019-03-28 22:32:31,447 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 353.98/291.34 [2019-03-28 22:32:31,447 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 353.98/291.34 [2019-03-28 22:32:31,447 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 353.98/291.34 [2019-03-28 22:32:31,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 353.98/291.34 [2019-03-28 22:32:31,448 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 353.98/291.34 [2019-03-28 22:32:31,448 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 353.98/291.34 [2019-03-28 22:32:31,448 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 353.98/291.34 [2019-03-28 22:32:31,448 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 353.98/291.34 [2019-03-28 22:32:31,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 353.98/291.34 [2019-03-28 22:32:31,487 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 353.98/291.34 [2019-03-28 22:32:31,491 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 353.98/291.34 [2019-03-28 22:32:31,492 INFO L271 PluginConnector]: Initializing CDTParser... 353.98/291.34 [2019-03-28 22:32:31,493 INFO L276 PluginConnector]: CDTParser initialized 353.98/291.34 [2019-03-28 22:32:31,494 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 353.98/291.34 [2019-03-28 22:32:31,563 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/0f00576618834f77ab871ce13f65ea90/FLAG6c3976603 353.98/291.34 [2019-03-28 22:32:31,903 INFO L307 CDTParser]: Found 1 translation units. 353.98/291.34 [2019-03-28 22:32:31,903 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 353.98/291.34 [2019-03-28 22:32:31,910 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/0f00576618834f77ab871ce13f65ea90/FLAG6c3976603 353.98/291.34 [2019-03-28 22:32:32,312 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/0f00576618834f77ab871ce13f65ea90 353.98/291.34 [2019-03-28 22:32:32,323 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 353.98/291.34 [2019-03-28 22:32:32,325 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 353.98/291.34 [2019-03-28 22:32:32,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 353.98/291.34 [2019-03-28 22:32:32,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 353.98/291.34 [2019-03-28 22:32:32,330 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 353.98/291.34 [2019-03-28 22:32:32,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:32:32" (1/1) ... 353.98/291.34 [2019-03-28 22:32:32,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac6ae91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:32:32, skipping insertion in model container 353.98/291.34 [2019-03-28 22:32:32,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:32:32" (1/1) ... 353.98/291.34 [2019-03-28 22:32:32,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 353.98/291.34 [2019-03-28 22:32:32,359 INFO L176 MainTranslator]: Built tables and reachable declarations 353.98/291.34 [2019-03-28 22:32:32,514 INFO L206 PostProcessor]: Analyzing one entry point: main 353.98/291.34 [2019-03-28 22:32:32,518 INFO L191 MainTranslator]: Completed pre-run 353.98/291.34 [2019-03-28 22:32:32,535 INFO L206 PostProcessor]: Analyzing one entry point: main 353.98/291.34 [2019-03-28 22:32:32,602 INFO L195 MainTranslator]: Completed translation 353.98/291.34 [2019-03-28 22:32:32,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:32:32 WrapperNode 353.98/291.34 [2019-03-28 22:32:32,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 353.98/291.34 [2019-03-28 22:32:32,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 353.98/291.34 [2019-03-28 22:32:32,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 353.98/291.34 [2019-03-28 22:32:32,603 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 353.98/291.34 [2019-03-28 22:32:32,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:32:32" (1/1) ... 353.98/291.34 [2019-03-28 22:32:32,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:32:32" (1/1) ... 353.98/291.34 [2019-03-28 22:32:32,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 353.98/291.34 [2019-03-28 22:32:32,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 353.98/291.34 [2019-03-28 22:32:32,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 353.98/291.34 [2019-03-28 22:32:32,638 INFO L276 PluginConnector]: Boogie Preprocessor initialized 353.98/291.34 [2019-03-28 22:32:32,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:32:32" (1/1) ... 353.98/291.34 [2019-03-28 22:32:32,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:32:32" (1/1) ... 353.98/291.34 [2019-03-28 22:32:32,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:32:32" (1/1) ... 353.98/291.34 [2019-03-28 22:32:32,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:32:32" (1/1) ... 353.98/291.34 [2019-03-28 22:32:32,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:32:32" (1/1) ... 353.98/291.34 [2019-03-28 22:32:32,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:32:32" (1/1) ... 353.98/291.34 [2019-03-28 22:32:32,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:32:32" (1/1) ... 353.98/291.34 [2019-03-28 22:32:32,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 353.98/291.34 [2019-03-28 22:32:32,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 353.98/291.34 [2019-03-28 22:32:32,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... 353.98/291.34 [2019-03-28 22:32:32,657 INFO L276 PluginConnector]: RCFGBuilder initialized 353.98/291.34 [2019-03-28 22:32:32,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:32:32" (1/1) ... 353.98/291.34 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 353.98/291.34 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 353.98/291.34 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 353.98/291.34 [2019-03-28 22:32:32,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 353.98/291.34 [2019-03-28 22:32:32,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 353.98/291.34 [2019-03-28 22:32:32,851 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 353.98/291.34 [2019-03-28 22:32:32,852 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 353.98/291.34 [2019-03-28 22:32:32,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:32:32 BoogieIcfgContainer 353.98/291.34 [2019-03-28 22:32:32,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 353.98/291.34 [2019-03-28 22:32:32,853 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 353.98/291.34 [2019-03-28 22:32:32,854 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 353.98/291.34 [2019-03-28 22:32:32,856 INFO L276 PluginConnector]: BlockEncodingV2 initialized 353.98/291.34 [2019-03-28 22:32:32,856 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:32:32" (1/1) ... 353.98/291.34 [2019-03-28 22:32:32,872 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 13 edges 353.98/291.34 [2019-03-28 22:32:32,873 INFO L258 BlockEncoder]: Using Remove infeasible edges 353.98/291.34 [2019-03-28 22:32:32,874 INFO L263 BlockEncoder]: Using Maximize final states 353.98/291.34 [2019-03-28 22:32:32,875 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 353.98/291.34 [2019-03-28 22:32:32,875 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 353.98/291.34 [2019-03-28 22:32:32,877 INFO L296 BlockEncoder]: Using Remove sink states 353.98/291.34 [2019-03-28 22:32:32,878 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 353.98/291.34 [2019-03-28 22:32:32,878 INFO L179 BlockEncoder]: Using Rewrite not-equals 353.98/291.34 [2019-03-28 22:32:32,893 INFO L185 BlockEncoder]: Using Use SBE 353.98/291.34 [2019-03-28 22:32:32,907 INFO L200 BlockEncoder]: SBE split 1 edges 353.98/291.34 [2019-03-28 22:32:32,911 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 353.98/291.34 [2019-03-28 22:32:32,913 INFO L71 MaximizeFinalStates]: 0 new accepting states 353.98/291.34 [2019-03-28 22:32:32,922 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 353.98/291.34 [2019-03-28 22:32:32,924 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 353.98/291.34 [2019-03-28 22:32:32,926 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 353.98/291.34 [2019-03-28 22:32:32,926 INFO L71 MaximizeFinalStates]: 0 new accepting states 353.98/291.34 [2019-03-28 22:32:32,926 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 353.98/291.34 [2019-03-28 22:32:32,926 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 353.98/291.34 [2019-03-28 22:32:32,927 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 8 edges 353.98/291.34 [2019-03-28 22:32:32,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:32:32 BasicIcfg 353.98/291.34 [2019-03-28 22:32:32,927 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 353.98/291.34 [2019-03-28 22:32:32,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 353.98/291.34 [2019-03-28 22:32:32,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... 353.98/291.34 [2019-03-28 22:32:32,931 INFO L276 PluginConnector]: TraceAbstraction initialized 353.98/291.34 [2019-03-28 22:32:32,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 10:32:32" (1/4) ... 353.98/291.34 [2019-03-28 22:32:32,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d294c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:32:32, skipping insertion in model container 353.98/291.34 [2019-03-28 22:32:32,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:32:32" (2/4) ... 353.98/291.34 [2019-03-28 22:32:32,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d294c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:32:32, skipping insertion in model container 353.98/291.34 [2019-03-28 22:32:32,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:32:32" (3/4) ... 353.98/291.34 [2019-03-28 22:32:32,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d294c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:32:32, skipping insertion in model container 353.98/291.34 [2019-03-28 22:32:32,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:32:32" (4/4) ... 353.98/291.34 [2019-03-28 22:32:32,935 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 353.98/291.34 [2019-03-28 22:32:32,945 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 353.98/291.34 [2019-03-28 22:32:32,953 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 353.98/291.34 [2019-03-28 22:32:32,971 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 353.98/291.34 [2019-03-28 22:32:32,999 INFO L133 ementStrategyFactory]: Using default assertion order modulation 353.98/291.34 [2019-03-28 22:32:33,000 INFO L382 AbstractCegarLoop]: Interprodecural is true 353.98/291.34 [2019-03-28 22:32:33,000 INFO L383 AbstractCegarLoop]: Hoare is true 353.98/291.34 [2019-03-28 22:32:33,000 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 353.98/291.34 [2019-03-28 22:32:33,001 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 353.98/291.34 [2019-03-28 22:32:33,001 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 353.98/291.34 [2019-03-28 22:32:33,001 INFO L387 AbstractCegarLoop]: Difference is false 353.98/291.34 [2019-03-28 22:32:33,001 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 353.98/291.34 [2019-03-28 22:32:33,001 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 353.98/291.34 [2019-03-28 22:32:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. 353.98/291.34 [2019-03-28 22:32:33,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 353.98/291.34 [2019-03-28 22:32:33,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. 353.98/291.34 [2019-03-28 22:32:33,072 INFO L451 ceAbstractionStarter]: At program point L18-1(lines 11 23) the Hoare annotation is: true 353.98/291.34 [2019-03-28 22:32:33,073 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 11 23) no Hoare annotation was computed. 353.98/291.34 [2019-03-28 22:32:33,073 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 353.98/291.34 [2019-03-28 22:32:33,073 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. 353.98/291.34 [2019-03-28 22:32:33,073 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 11 23) no Hoare annotation was computed. 353.98/291.34 [2019-03-28 22:32:33,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:32:33 BasicIcfg 353.98/291.34 [2019-03-28 22:32:33,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 353.98/291.34 [2019-03-28 22:32:33,082 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 353.98/291.34 [2019-03-28 22:32:33,082 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 353.98/291.34 [2019-03-28 22:32:33,085 INFO L276 PluginConnector]: BuchiAutomizer initialized 353.98/291.34 [2019-03-28 22:32:33,086 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 353.98/291.34 [2019-03-28 22:32:33,087 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 10:32:32" (1/5) ... 353.98/291.34 [2019-03-28 22:32:33,087 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36fc596a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:32:33, skipping insertion in model container 353.98/291.34 [2019-03-28 22:32:33,087 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 353.98/291.34 [2019-03-28 22:32:33,088 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:32:32" (2/5) ... 353.98/291.34 [2019-03-28 22:32:33,088 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36fc596a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:32:33, skipping insertion in model container 353.98/291.34 [2019-03-28 22:32:33,088 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 353.98/291.34 [2019-03-28 22:32:33,088 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:32:32" (3/5) ... 353.98/291.34 [2019-03-28 22:32:33,089 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36fc596a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:32:33, skipping insertion in model container 353.98/291.34 [2019-03-28 22:32:33,089 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 353.98/291.34 [2019-03-28 22:32:33,089 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:32:32" (4/5) ... 353.98/291.34 [2019-03-28 22:32:33,089 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36fc596a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:32:33, skipping insertion in model container 353.98/291.34 [2019-03-28 22:32:33,089 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 353.98/291.34 [2019-03-28 22:32:33,090 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:32:33" (5/5) ... 353.98/291.34 [2019-03-28 22:32:33,091 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 353.98/291.34 [2019-03-28 22:32:33,118 INFO L133 ementStrategyFactory]: Using default assertion order modulation 353.98/291.34 [2019-03-28 22:32:33,118 INFO L374 BuchiCegarLoop]: Interprodecural is true 353.98/291.34 [2019-03-28 22:32:33,119 INFO L375 BuchiCegarLoop]: Hoare is true 353.98/291.34 [2019-03-28 22:32:33,119 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 353.98/291.34 [2019-03-28 22:32:33,119 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 353.98/291.34 [2019-03-28 22:32:33,119 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 353.98/291.34 [2019-03-28 22:32:33,119 INFO L379 BuchiCegarLoop]: Difference is false 353.98/291.34 [2019-03-28 22:32:33,119 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 353.98/291.34 [2019-03-28 22:32:33,119 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 353.98/291.34 [2019-03-28 22:32:33,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 353.98/291.34 [2019-03-28 22:32:33,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 353.98/291.34 [2019-03-28 22:32:33,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 353.98/291.34 [2019-03-28 22:32:33,142 INFO L119 BuchiIsEmpty]: Starting construction of run 353.98/291.34 [2019-03-28 22:32:33,147 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 353.98/291.34 [2019-03-28 22:32:33,147 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 353.98/291.34 [2019-03-28 22:32:33,147 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 353.98/291.34 [2019-03-28 22:32:33,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 353.98/291.34 [2019-03-28 22:32:33,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 353.98/291.34 [2019-03-28 22:32:33,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 353.98/291.34 [2019-03-28 22:32:33,149 INFO L119 BuchiIsEmpty]: Starting construction of run 353.98/291.34 [2019-03-28 22:32:33,149 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 353.98/291.34 [2019-03-28 22:32:33,149 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 353.98/291.34 [2019-03-28 22:32:33,154 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 5#L18-1true 353.98/291.34 [2019-03-28 22:32:33,155 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 6#L12true [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 3#L12-2true [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 7#L15-1true [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5#L18-1true 353.98/291.34 [2019-03-28 22:32:33,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 353.98/291.34 [2019-03-28 22:32:33,161 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times 353.98/291.34 [2019-03-28 22:32:33,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 353.98/291.34 [2019-03-28 22:32:33,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 353.98/291.34 [2019-03-28 22:32:33,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 353.98/291.34 [2019-03-28 22:32:33,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 353.98/291.34 [2019-03-28 22:32:33,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 353.98/291.34 [2019-03-28 22:32:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 353.98/291.34 [2019-03-28 22:32:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 353.98/291.34 [2019-03-28 22:32:33,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 353.98/291.34 [2019-03-28 22:32:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2194635, now seen corresponding path program 1 times 353.98/291.34 [2019-03-28 22:32:33,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 353.98/291.34 [2019-03-28 22:32:33,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 353.98/291.34 [2019-03-28 22:32:33,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 353.98/291.34 [2019-03-28 22:32:33,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 353.98/291.34 [2019-03-28 22:32:33,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 353.98/291.34 [2019-03-28 22:32:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 353.98/291.34 [2019-03-28 22:32:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 353.98/291.34 [2019-03-28 22:32:33,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 353.98/291.34 [2019-03-28 22:32:33,252 INFO L82 PathProgramCache]: Analyzing trace with hash 64994063, now seen corresponding path program 1 times 354.08/291.34 [2019-03-28 22:32:33,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.34 [2019-03-28 22:32:33,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.34 [2019-03-28 22:32:33,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.34 [2019-03-28 22:32:33,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 354.08/291.34 [2019-03-28 22:32:33,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.34 [2019-03-28 22:32:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.34 [2019-03-28 22:32:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.34 [2019-03-28 22:32:33,331 INFO L216 LassoAnalysis]: Preferences: 354.08/291.34 [2019-03-28 22:32:33,332 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 354.08/291.34 [2019-03-28 22:32:33,332 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 354.08/291.34 [2019-03-28 22:32:33,332 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 354.08/291.34 [2019-03-28 22:32:33,332 INFO L127 ssoRankerPreferences]: Use exernal solver: true 354.08/291.34 [2019-03-28 22:32:33,333 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.34 [2019-03-28 22:32:33,333 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 354.08/291.34 [2019-03-28 22:32:33,333 INFO L130 ssoRankerPreferences]: Path of dumped script: 354.08/291.34 [2019-03-28 22:32:33,333 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 354.08/291.34 [2019-03-28 22:32:33,333 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 354.08/291.34 [2019-03-28 22:32:33,334 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 354.08/291.34 [2019-03-28 22:32:33,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.34 [2019-03-28 22:32:33,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.34 [2019-03-28 22:32:33,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.34 [2019-03-28 22:32:33,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.34 [2019-03-28 22:32:33,452 INFO L300 LassoAnalysis]: Preprocessing complete. 354.08/291.34 [2019-03-28 22:32:33,452 INFO L412 LassoAnalysis]: Checking for nontermination... 354.08/291.34 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.34 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.34 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.34 [2019-03-28 22:32:33,460 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.34 [2019-03-28 22:32:33,460 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.34 [2019-03-28 22:32:33,493 INFO L445 LassoAnalysis]: Proved nontermination for one component. 354.08/291.34 [2019-03-28 22:32:33,493 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 354.08/291.34 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.34 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.34 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.34 [2019-03-28 22:32:33,506 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.34 [2019-03-28 22:32:33,506 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.34 [2019-03-28 22:32:33,534 INFO L445 LassoAnalysis]: Proved nontermination for one component. 354.08/291.34 [2019-03-28 22:32:33,534 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 354.08/291.34 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.34 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.34 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.34 [2019-03-28 22:32:33,539 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.34 [2019-03-28 22:32:33,540 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.34 [2019-03-28 22:32:33,567 INFO L445 LassoAnalysis]: Proved nontermination for one component. 354.08/291.34 [2019-03-28 22:32:33,567 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 354.08/291.34 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.34 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.34 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.34 [2019-03-28 22:32:33,572 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.34 [2019-03-28 22:32:33,572 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.34 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.34 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.34 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.34 [2019-03-28 22:32:33,603 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 354.08/291.34 [2019-03-28 22:32:33,603 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.34 [2019-03-28 22:32:33,613 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 354.08/291.34 [2019-03-28 22:32:33,638 INFO L216 LassoAnalysis]: Preferences: 354.08/291.34 [2019-03-28 22:32:33,638 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 354.08/291.34 [2019-03-28 22:32:33,638 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 354.08/291.34 [2019-03-28 22:32:33,639 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 354.08/291.34 [2019-03-28 22:32:33,639 INFO L127 ssoRankerPreferences]: Use exernal solver: false 354.08/291.34 [2019-03-28 22:32:33,639 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 354.08/291.34 [2019-03-28 22:32:33,639 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 354.08/291.34 [2019-03-28 22:32:33,639 INFO L130 ssoRankerPreferences]: Path of dumped script: 354.08/291.34 [2019-03-28 22:32:33,639 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 354.08/291.34 [2019-03-28 22:32:33,639 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 354.08/291.34 [2019-03-28 22:32:33,640 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 354.08/291.34 [2019-03-28 22:32:33,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.34 [2019-03-28 22:32:33,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.34 [2019-03-28 22:32:33,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.34 [2019-03-28 22:32:33,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.34 [2019-03-28 22:32:33,715 INFO L300 LassoAnalysis]: Preprocessing complete. 354.08/291.34 [2019-03-28 22:32:33,721 INFO L497 LassoAnalysis]: Using template 'affine'. 354.08/291.34 [2019-03-28 22:32:33,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.34 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.34 Number of strict supporting invariants: 0 354.08/291.34 Number of non-strict supporting invariants: 1 354.08/291.34 Consider only non-deceasing supporting invariants: true 354.08/291.34 Simplify termination arguments: true 354.08/291.34 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.34 [2019-03-28 22:32:33,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.34 [2019-03-28 22:32:33,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 354.08/291.34 [2019-03-28 22:32:33,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.34 [2019-03-28 22:32:33,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.34 [2019-03-28 22:32:33,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.34 [2019-03-28 22:32:33,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 354.08/291.34 [2019-03-28 22:32:33,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 354.08/291.34 [2019-03-28 22:32:33,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 354.08/291.34 [2019-03-28 22:32:33,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.34 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.34 Number of strict supporting invariants: 0 354.08/291.34 Number of non-strict supporting invariants: 1 354.08/291.34 Consider only non-deceasing supporting invariants: true 354.08/291.34 Simplify termination arguments: true 354.08/291.34 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.34 [2019-03-28 22:32:33,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.34 [2019-03-28 22:32:33,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.34 [2019-03-28 22:32:33,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.34 [2019-03-28 22:32:33,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.34 [2019-03-28 22:32:33,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 354.08/291.34 [2019-03-28 22:32:33,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 354.08/291.34 [2019-03-28 22:32:33,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 354.08/291.34 [2019-03-28 22:32:33,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.35 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.35 Number of strict supporting invariants: 0 354.08/291.35 Number of non-strict supporting invariants: 1 354.08/291.35 Consider only non-deceasing supporting invariants: true 354.08/291.35 Simplify termination arguments: true 354.08/291.35 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.35 [2019-03-28 22:32:33,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.35 [2019-03-28 22:32:33,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.35 [2019-03-28 22:32:33,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.35 [2019-03-28 22:32:33,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.35 [2019-03-28 22:32:33,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 354.08/291.35 [2019-03-28 22:32:33,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 354.08/291.35 [2019-03-28 22:32:33,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 354.08/291.35 [2019-03-28 22:32:33,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.35 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.35 Number of strict supporting invariants: 0 354.08/291.35 Number of non-strict supporting invariants: 1 354.08/291.35 Consider only non-deceasing supporting invariants: true 354.08/291.35 Simplify termination arguments: true 354.08/291.35 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.35 [2019-03-28 22:32:33,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.35 [2019-03-28 22:32:33,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 354.08/291.35 [2019-03-28 22:32:33,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.35 [2019-03-28 22:32:33,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.35 [2019-03-28 22:32:33,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.35 [2019-03-28 22:32:33,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 354.08/291.35 [2019-03-28 22:32:33,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 354.08/291.35 [2019-03-28 22:32:33,763 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 354.08/291.35 [2019-03-28 22:32:33,767 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 354.08/291.35 [2019-03-28 22:32:33,767 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 354.08/291.35 [2019-03-28 22:32:33,770 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 354.08/291.35 [2019-03-28 22:32:33,770 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 354.08/291.35 [2019-03-28 22:32:33,770 INFO L518 LassoAnalysis]: Proved termination. 354.08/291.35 [2019-03-28 22:32:33,770 INFO L520 LassoAnalysis]: Termination argument consisting of: 354.08/291.35 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 354.08/291.35 Supporting invariants [] 354.08/291.35 [2019-03-28 22:32:33,772 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 354.08/291.35 [2019-03-28 22:32:33,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:33,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:33,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:33,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:33,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:33,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:33,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:33,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:33,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:33,974 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 5 predicates after loop cannibalization 354.08/291.35 [2019-03-28 22:32:33,980 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates 354.08/291.35 [2019-03-28 22:32:33,981 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states. Second operand 3 states. 354.08/291.35 [2019-03-28 22:32:34,206 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states.. Second operand 3 states. Result 54 states and 90 transitions. Complement of second has 16 states. 354.08/291.35 [2019-03-28 22:32:34,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 6 non-accepting loop states 2 accepting loop states 354.08/291.35 [2019-03-28 22:32:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 354.08/291.35 [2019-03-28 22:32:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. 354.08/291.35 [2019-03-28 22:32:34,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 55 transitions. Stem has 1 letters. Loop has 4 letters. 354.08/291.35 [2019-03-28 22:32:34,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.35 [2019-03-28 22:32:34,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 55 transitions. Stem has 5 letters. Loop has 4 letters. 354.08/291.35 [2019-03-28 22:32:34,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.35 [2019-03-28 22:32:34,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 55 transitions. Stem has 1 letters. Loop has 8 letters. 354.08/291.35 [2019-03-28 22:32:34,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.35 [2019-03-28 22:32:34,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 90 transitions. 354.08/291.35 [2019-03-28 22:32:34,225 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 354.08/291.35 [2019-03-28 22:32:34,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 66 transitions. 354.08/291.35 [2019-03-28 22:32:34,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 354.08/291.35 [2019-03-28 22:32:34,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 354.08/291.35 [2019-03-28 22:32:34,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 66 transitions. 354.08/291.35 [2019-03-28 22:32:34,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.35 [2019-03-28 22:32:34,233 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 66 transitions. 354.08/291.35 [2019-03-28 22:32:34,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 66 transitions. 354.08/291.35 [2019-03-28 22:32:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. 354.08/291.35 [2019-03-28 22:32:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 354.08/291.35 [2019-03-28 22:32:34,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. 354.08/291.35 [2019-03-28 22:32:34,267 INFO L729 BuchiCegarLoop]: Abstraction has 37 states and 59 transitions. 354.08/291.35 [2019-03-28 22:32:34,267 INFO L609 BuchiCegarLoop]: Abstraction has 37 states and 59 transitions. 354.08/291.35 [2019-03-28 22:32:34,267 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 354.08/291.35 [2019-03-28 22:32:34,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 59 transitions. 354.08/291.35 [2019-03-28 22:32:34,269 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 354.08/291.35 [2019-03-28 22:32:34,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.35 [2019-03-28 22:32:34,269 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.35 [2019-03-28 22:32:34,270 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 354.08/291.35 [2019-03-28 22:32:34,270 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 354.08/291.35 [2019-03-28 22:32:34,270 INFO L794 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 149#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 159#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 168#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 155#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 150#L18-1 354.08/291.35 [2019-03-28 22:32:34,271 INFO L796 eck$LassoCheckResult]: Loop: 150#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 151#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 144#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 145#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 150#L18-1 354.08/291.35 [2019-03-28 22:32:34,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:34,272 INFO L82 PathProgramCache]: Analyzing trace with hash 64994056, now seen corresponding path program 1 times 354.08/291.35 [2019-03-28 22:32:34,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:34,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:34,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:34,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:34,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:34,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 354.08/291.35 [2019-03-28 22:32:34,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 354.08/291.35 [2019-03-28 22:32:34,314 INFO L799 eck$LassoCheckResult]: stem already infeasible 354.08/291.35 [2019-03-28 22:32:34,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:34,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2194635, now seen corresponding path program 2 times 354.08/291.35 [2019-03-28 22:32:34,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:34,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:34,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:34,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:34,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:34,362 INFO L216 LassoAnalysis]: Preferences: 354.08/291.35 [2019-03-28 22:32:34,362 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 354.08/291.35 [2019-03-28 22:32:34,362 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 354.08/291.35 [2019-03-28 22:32:34,363 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 354.08/291.35 [2019-03-28 22:32:34,363 INFO L127 ssoRankerPreferences]: Use exernal solver: true 354.08/291.35 [2019-03-28 22:32:34,363 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:34,363 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 354.08/291.35 [2019-03-28 22:32:34,363 INFO L130 ssoRankerPreferences]: Path of dumped script: 354.08/291.35 [2019-03-28 22:32:34,363 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 354.08/291.35 [2019-03-28 22:32:34,363 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 354.08/291.35 [2019-03-28 22:32:34,364 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 354.08/291.35 [2019-03-28 22:32:34,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:34,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:34,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:34,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:34,456 INFO L300 LassoAnalysis]: Preprocessing complete. 354.08/291.35 [2019-03-28 22:32:34,457 INFO L412 LassoAnalysis]: Checking for nontermination... 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:34,461 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.35 [2019-03-28 22:32:34,461 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.35 [2019-03-28 22:32:34,491 INFO L445 LassoAnalysis]: Proved nontermination for one component. 354.08/291.35 [2019-03-28 22:32:34,492 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:34,499 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.35 [2019-03-28 22:32:34,500 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.35 [2019-03-28 22:32:34,528 INFO L445 LassoAnalysis]: Proved nontermination for one component. 354.08/291.35 [2019-03-28 22:32:34,528 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:34,535 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.35 [2019-03-28 22:32:34,536 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.35 [2019-03-28 22:32:34,563 INFO L445 LassoAnalysis]: Proved nontermination for one component. 354.08/291.35 [2019-03-28 22:32:34,563 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:34,570 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.35 [2019-03-28 22:32:34,570 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:34,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 354.08/291.35 [2019-03-28 22:32:34,601 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.35 [2019-03-28 22:32:34,607 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 354.08/291.35 [2019-03-28 22:32:34,632 INFO L216 LassoAnalysis]: Preferences: 354.08/291.35 [2019-03-28 22:32:34,632 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 354.08/291.35 [2019-03-28 22:32:34,632 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 354.08/291.35 [2019-03-28 22:32:34,632 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 354.08/291.35 [2019-03-28 22:32:34,633 INFO L127 ssoRankerPreferences]: Use exernal solver: false 354.08/291.35 [2019-03-28 22:32:34,633 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:34,633 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 354.08/291.35 [2019-03-28 22:32:34,633 INFO L130 ssoRankerPreferences]: Path of dumped script: 354.08/291.35 [2019-03-28 22:32:34,633 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 354.08/291.35 [2019-03-28 22:32:34,633 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 354.08/291.35 [2019-03-28 22:32:34,633 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 354.08/291.35 [2019-03-28 22:32:34,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:34,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:34,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:34,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:34,701 INFO L300 LassoAnalysis]: Preprocessing complete. 354.08/291.35 [2019-03-28 22:32:34,701 INFO L497 LassoAnalysis]: Using template 'affine'. 354.08/291.35 [2019-03-28 22:32:34,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.35 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.35 Number of strict supporting invariants: 0 354.08/291.35 Number of non-strict supporting invariants: 1 354.08/291.35 Consider only non-deceasing supporting invariants: true 354.08/291.35 Simplify termination arguments: true 354.08/291.35 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.35 [2019-03-28 22:32:34,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.35 [2019-03-28 22:32:34,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.35 [2019-03-28 22:32:34,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.35 [2019-03-28 22:32:34,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.35 [2019-03-28 22:32:34,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 354.08/291.35 [2019-03-28 22:32:34,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 354.08/291.35 [2019-03-28 22:32:34,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 354.08/291.35 [2019-03-28 22:32:34,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.35 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.35 Number of strict supporting invariants: 0 354.08/291.35 Number of non-strict supporting invariants: 1 354.08/291.35 Consider only non-deceasing supporting invariants: true 354.08/291.35 Simplify termination arguments: true 354.08/291.35 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.35 [2019-03-28 22:32:34,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.35 [2019-03-28 22:32:34,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 354.08/291.35 [2019-03-28 22:32:34,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.35 [2019-03-28 22:32:34,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.35 [2019-03-28 22:32:34,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.35 [2019-03-28 22:32:34,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 354.08/291.35 [2019-03-28 22:32:34,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 354.08/291.35 [2019-03-28 22:32:34,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 354.08/291.35 [2019-03-28 22:32:34,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.35 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.35 Number of strict supporting invariants: 0 354.08/291.35 Number of non-strict supporting invariants: 1 354.08/291.35 Consider only non-deceasing supporting invariants: true 354.08/291.35 Simplify termination arguments: true 354.08/291.35 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.35 [2019-03-28 22:32:34,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.35 [2019-03-28 22:32:34,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.35 [2019-03-28 22:32:34,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.35 [2019-03-28 22:32:34,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.35 [2019-03-28 22:32:34,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 354.08/291.35 [2019-03-28 22:32:34,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 354.08/291.35 [2019-03-28 22:32:34,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 354.08/291.35 [2019-03-28 22:32:34,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.35 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.35 Number of strict supporting invariants: 0 354.08/291.35 Number of non-strict supporting invariants: 1 354.08/291.35 Consider only non-deceasing supporting invariants: true 354.08/291.35 Simplify termination arguments: true 354.08/291.35 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.35 [2019-03-28 22:32:34,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.35 [2019-03-28 22:32:34,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 354.08/291.35 [2019-03-28 22:32:34,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.35 [2019-03-28 22:32:34,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.35 [2019-03-28 22:32:34,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.35 [2019-03-28 22:32:34,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 354.08/291.35 [2019-03-28 22:32:34,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 354.08/291.35 [2019-03-28 22:32:34,729 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 354.08/291.35 [2019-03-28 22:32:34,733 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 354.08/291.35 [2019-03-28 22:32:34,733 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 354.08/291.35 [2019-03-28 22:32:34,734 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 354.08/291.35 [2019-03-28 22:32:34,734 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 354.08/291.35 [2019-03-28 22:32:34,734 INFO L518 LassoAnalysis]: Proved termination. 354.08/291.35 [2019-03-28 22:32:34,734 INFO L520 LassoAnalysis]: Termination argument consisting of: 354.08/291.35 Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 354.08/291.35 Supporting invariants [] 354.08/291.35 [2019-03-28 22:32:34,735 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 354.08/291.35 [2019-03-28 22:32:34,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:34,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:34,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:34,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:34,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:34,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:34,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:34,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:34,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:34,892 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 5 predicates after loop cannibalization 354.08/291.35 [2019-03-28 22:32:34,892 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates 354.08/291.35 [2019-03-28 22:32:34,893 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 37 states and 59 transitions. cyclomatic complexity: 26 Second operand 3 states. 354.08/291.35 [2019-03-28 22:32:35,101 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 37 states and 59 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 537 states and 834 transitions. Complement of second has 155 states. 354.08/291.35 [2019-03-28 22:32:35,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 6 non-accepting loop states 2 accepting loop states 354.08/291.35 [2019-03-28 22:32:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 354.08/291.35 [2019-03-28 22:32:35,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. 354.08/291.35 [2019-03-28 22:32:35,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 55 transitions. Stem has 5 letters. Loop has 4 letters. 354.08/291.35 [2019-03-28 22:32:35,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.35 [2019-03-28 22:32:35,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 55 transitions. Stem has 9 letters. Loop has 4 letters. 354.08/291.35 [2019-03-28 22:32:35,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.35 [2019-03-28 22:32:35,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 55 transitions. Stem has 5 letters. Loop has 8 letters. 354.08/291.35 [2019-03-28 22:32:35,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.35 [2019-03-28 22:32:35,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 537 states and 834 transitions. 354.08/291.35 [2019-03-28 22:32:35,143 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 142 354.08/291.35 [2019-03-28 22:32:35,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 537 states to 244 states and 363 transitions. 354.08/291.35 [2019-03-28 22:32:35,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 354.08/291.35 [2019-03-28 22:32:35,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 354.08/291.35 [2019-03-28 22:32:35,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 363 transitions. 354.08/291.35 [2019-03-28 22:32:35,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.35 [2019-03-28 22:32:35,150 INFO L706 BuchiCegarLoop]: Abstraction has 244 states and 363 transitions. 354.08/291.35 [2019-03-28 22:32:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 363 transitions. 354.08/291.35 [2019-03-28 22:32:35,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 48. 354.08/291.35 [2019-03-28 22:32:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. 354.08/291.35 [2019-03-28 22:32:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. 354.08/291.35 [2019-03-28 22:32:35,159 INFO L729 BuchiCegarLoop]: Abstraction has 48 states and 77 transitions. 354.08/291.35 [2019-03-28 22:32:35,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 354.08/291.35 [2019-03-28 22:32:35,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 354.08/291.35 [2019-03-28 22:32:35,163 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 3 states. 354.08/291.35 [2019-03-28 22:32:35,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 354.08/291.35 [2019-03-28 22:32:35,179 INFO L93 Difference]: Finished difference Result 49 states and 73 transitions. 354.08/291.35 [2019-03-28 22:32:35,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 354.08/291.35 [2019-03-28 22:32:35,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 73 transitions. 354.08/291.35 [2019-03-28 22:32:35,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 354.08/291.35 [2019-03-28 22:32:35,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 39 states and 56 transitions. 354.08/291.35 [2019-03-28 22:32:35,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 354.08/291.35 [2019-03-28 22:32:35,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 354.08/291.35 [2019-03-28 22:32:35,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 56 transitions. 354.08/291.35 [2019-03-28 22:32:35,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.35 [2019-03-28 22:32:35,183 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. 354.08/291.35 [2019-03-28 22:32:35,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 56 transitions. 354.08/291.35 [2019-03-28 22:32:35,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. 354.08/291.35 [2019-03-28 22:32:35,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 354.08/291.35 [2019-03-28 22:32:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. 354.08/291.35 [2019-03-28 22:32:35,186 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. 354.08/291.35 [2019-03-28 22:32:35,187 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. 354.08/291.35 [2019-03-28 22:32:35,187 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 354.08/291.35 [2019-03-28 22:32:35,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 46 transitions. 354.08/291.35 [2019-03-28 22:32:35,187 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 354.08/291.35 [2019-03-28 22:32:35,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.35 [2019-03-28 22:32:35,187 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.35 [2019-03-28 22:32:35,188 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 354.08/291.35 [2019-03-28 22:32:35,188 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] 354.08/291.35 [2019-03-28 22:32:35,188 INFO L794 eck$LassoCheckResult]: Stem: 1051#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 1052#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1053#L12 354.08/291.35 [2019-03-28 22:32:35,189 INFO L796 eck$LassoCheckResult]: Loop: 1053#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1047#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1048#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1077#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1076#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1058#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1073#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1070#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1053#L12 354.08/291.35 [2019-03-28 22:32:35,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:35,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 1 times 354.08/291.35 [2019-03-28 22:32:35,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:35,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:35,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:35,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:35,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1648173115, now seen corresponding path program 1 times 354.08/291.35 [2019-03-28 22:32:35,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:35,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:35,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:35,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 354.08/291.35 [2019-03-28 22:32:35,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 354.08/291.35 [2019-03-28 22:32:35,214 INFO L811 eck$LassoCheckResult]: loop already infeasible 354.08/291.35 [2019-03-28 22:32:35,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 354.08/291.35 [2019-03-28 22:32:35,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 354.08/291.35 [2019-03-28 22:32:35,215 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. cyclomatic complexity: 16 Second operand 3 states. 354.08/291.35 [2019-03-28 22:32:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 354.08/291.35 [2019-03-28 22:32:35,230 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. 354.08/291.35 [2019-03-28 22:32:35,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 354.08/291.35 [2019-03-28 22:32:35,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 44 transitions. 354.08/291.35 [2019-03-28 22:32:35,232 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 354.08/291.35 [2019-03-28 22:32:35,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 42 transitions. 354.08/291.35 [2019-03-28 22:32:35,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 354.08/291.35 [2019-03-28 22:32:35,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 354.08/291.35 [2019-03-28 22:32:35,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. 354.08/291.35 [2019-03-28 22:32:35,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.35 [2019-03-28 22:32:35,234 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. 354.08/291.35 [2019-03-28 22:32:35,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. 354.08/291.35 [2019-03-28 22:32:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. 354.08/291.35 [2019-03-28 22:32:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 354.08/291.35 [2019-03-28 22:32:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. 354.08/291.35 [2019-03-28 22:32:35,236 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. 354.08/291.35 [2019-03-28 22:32:35,236 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. 354.08/291.35 [2019-03-28 22:32:35,237 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 354.08/291.35 [2019-03-28 22:32:35,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. 354.08/291.35 [2019-03-28 22:32:35,237 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 354.08/291.35 [2019-03-28 22:32:35,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.35 [2019-03-28 22:32:35,237 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.35 [2019-03-28 22:32:35,238 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 354.08/291.35 [2019-03-28 22:32:35,238 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] 354.08/291.35 [2019-03-28 22:32:35,238 INFO L794 eck$LassoCheckResult]: Stem: 1122#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 1123#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1124#L12 354.08/291.35 [2019-03-28 22:32:35,238 INFO L796 eck$LassoCheckResult]: Loop: 1124#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1118#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1119#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1145#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1138#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 0) (<= 10 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1120#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1121#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1143#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1124#L12 354.08/291.35 [2019-03-28 22:32:35,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:35,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 2 times 354.08/291.35 [2019-03-28 22:32:35,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:35,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:35,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:35,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:35,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1648411443, now seen corresponding path program 1 times 354.08/291.35 [2019-03-28 22:32:35,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:35,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:35,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:35,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 354.08/291.35 [2019-03-28 22:32:35,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 354.08/291.35 [2019-03-28 22:32:35,266 INFO L811 eck$LassoCheckResult]: loop already infeasible 354.08/291.35 [2019-03-28 22:32:35,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 354.08/291.35 [2019-03-28 22:32:35,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 354.08/291.35 [2019-03-28 22:32:35,266 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. cyclomatic complexity: 12 Second operand 4 states. 354.08/291.35 [2019-03-28 22:32:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 354.08/291.35 [2019-03-28 22:32:35,284 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. 354.08/291.35 [2019-03-28 22:32:35,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 354.08/291.35 [2019-03-28 22:32:35,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 41 transitions. 354.08/291.35 [2019-03-28 22:32:35,286 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 354.08/291.35 [2019-03-28 22:32:35,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 41 transitions. 354.08/291.35 [2019-03-28 22:32:35,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 354.08/291.35 [2019-03-28 22:32:35,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 354.08/291.35 [2019-03-28 22:32:35,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. 354.08/291.35 [2019-03-28 22:32:35,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.35 [2019-03-28 22:32:35,287 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. 354.08/291.35 [2019-03-28 22:32:35,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. 354.08/291.35 [2019-03-28 22:32:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. 354.08/291.35 [2019-03-28 22:32:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 354.08/291.35 [2019-03-28 22:32:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. 354.08/291.35 [2019-03-28 22:32:35,290 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. 354.08/291.35 [2019-03-28 22:32:35,290 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. 354.08/291.35 [2019-03-28 22:32:35,290 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 354.08/291.35 [2019-03-28 22:32:35,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. 354.08/291.35 [2019-03-28 22:32:35,290 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 354.08/291.35 [2019-03-28 22:32:35,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.35 [2019-03-28 22:32:35,290 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.35 [2019-03-28 22:32:35,291 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] 354.08/291.35 [2019-03-28 22:32:35,291 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 354.08/291.35 [2019-03-28 22:32:35,291 INFO L794 eck$LassoCheckResult]: Stem: 1190#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 1191#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1195#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1186#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1187#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1213#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1193#L12 354.08/291.35 [2019-03-28 22:32:35,292 INFO L796 eck$LassoCheckResult]: Loop: 1193#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1202#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1198#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1192#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1193#L12 354.08/291.35 [2019-03-28 22:32:35,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:35,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2014801362, now seen corresponding path program 1 times 354.08/291.35 [2019-03-28 22:32:35,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:35,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:35,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:35,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:35,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2463518, now seen corresponding path program 1 times 354.08/291.35 [2019-03-28 22:32:35,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:35,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:35,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:35,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:35,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1606437777, now seen corresponding path program 1 times 354.08/291.35 [2019-03-28 22:32:35,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:35,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:35,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:35,339 INFO L216 LassoAnalysis]: Preferences: 354.08/291.35 [2019-03-28 22:32:35,339 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 354.08/291.35 [2019-03-28 22:32:35,340 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 354.08/291.35 [2019-03-28 22:32:35,340 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 354.08/291.35 [2019-03-28 22:32:35,340 INFO L127 ssoRankerPreferences]: Use exernal solver: true 354.08/291.35 [2019-03-28 22:32:35,340 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:35,340 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 354.08/291.35 [2019-03-28 22:32:35,340 INFO L130 ssoRankerPreferences]: Path of dumped script: 354.08/291.35 [2019-03-28 22:32:35,340 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 354.08/291.35 [2019-03-28 22:32:35,340 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 354.08/291.35 [2019-03-28 22:32:35,341 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 354.08/291.35 [2019-03-28 22:32:35,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:35,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:35,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:35,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:35,387 INFO L300 LassoAnalysis]: Preprocessing complete. 354.08/291.35 [2019-03-28 22:32:35,387 INFO L412 LassoAnalysis]: Checking for nontermination... 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:35,390 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.35 [2019-03-28 22:32:35,390 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.35 [2019-03-28 22:32:35,417 INFO L445 LassoAnalysis]: Proved nontermination for one component. 354.08/291.35 [2019-03-28 22:32:35,417 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:35,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.35 [2019-03-28 22:32:35,422 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.35 [2019-03-28 22:32:35,448 INFO L445 LassoAnalysis]: Proved nontermination for one component. 354.08/291.35 [2019-03-28 22:32:35,448 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:35,452 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.35 [2019-03-28 22:32:35,452 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:35,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 354.08/291.35 [2019-03-28 22:32:35,482 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.35 [2019-03-28 22:32:35,514 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 354.08/291.35 [2019-03-28 22:32:35,516 INFO L216 LassoAnalysis]: Preferences: 354.08/291.35 [2019-03-28 22:32:35,516 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 354.08/291.35 [2019-03-28 22:32:35,516 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 354.08/291.35 [2019-03-28 22:32:35,516 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 354.08/291.35 [2019-03-28 22:32:35,516 INFO L127 ssoRankerPreferences]: Use exernal solver: false 354.08/291.35 [2019-03-28 22:32:35,516 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:35,517 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 354.08/291.35 [2019-03-28 22:32:35,517 INFO L130 ssoRankerPreferences]: Path of dumped script: 354.08/291.35 [2019-03-28 22:32:35,517 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 354.08/291.35 [2019-03-28 22:32:35,517 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 354.08/291.35 [2019-03-28 22:32:35,517 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 354.08/291.35 [2019-03-28 22:32:35,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:35,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:35,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:35,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:35,563 INFO L300 LassoAnalysis]: Preprocessing complete. 354.08/291.35 [2019-03-28 22:32:35,563 INFO L497 LassoAnalysis]: Using template 'affine'. 354.08/291.35 [2019-03-28 22:32:35,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.35 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.35 Number of strict supporting invariants: 0 354.08/291.35 Number of non-strict supporting invariants: 1 354.08/291.35 Consider only non-deceasing supporting invariants: true 354.08/291.35 Simplify termination arguments: true 354.08/291.35 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.35 [2019-03-28 22:32:35,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.35 [2019-03-28 22:32:35,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 354.08/291.35 [2019-03-28 22:32:35,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.35 [2019-03-28 22:32:35,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.35 [2019-03-28 22:32:35,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.35 [2019-03-28 22:32:35,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 354.08/291.35 [2019-03-28 22:32:35,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 354.08/291.35 [2019-03-28 22:32:35,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 354.08/291.35 [2019-03-28 22:32:35,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.35 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.35 Number of strict supporting invariants: 0 354.08/291.35 Number of non-strict supporting invariants: 1 354.08/291.35 Consider only non-deceasing supporting invariants: true 354.08/291.35 Simplify termination arguments: true 354.08/291.35 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.35 [2019-03-28 22:32:35,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.35 [2019-03-28 22:32:35,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 354.08/291.35 [2019-03-28 22:32:35,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.35 [2019-03-28 22:32:35,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.35 [2019-03-28 22:32:35,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.35 [2019-03-28 22:32:35,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 354.08/291.35 [2019-03-28 22:32:35,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 354.08/291.35 [2019-03-28 22:32:35,573 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 354.08/291.35 [2019-03-28 22:32:35,576 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 354.08/291.35 [2019-03-28 22:32:35,576 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 354.08/291.35 [2019-03-28 22:32:35,576 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 354.08/291.35 [2019-03-28 22:32:35,576 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 354.08/291.35 [2019-03-28 22:32:35,577 INFO L518 LassoAnalysis]: Proved termination. 354.08/291.35 [2019-03-28 22:32:35,577 INFO L520 LassoAnalysis]: Termination argument consisting of: 354.08/291.35 Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 354.08/291.35 Supporting invariants [] 354.08/291.35 [2019-03-28 22:32:35,577 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 354.08/291.35 [2019-03-28 22:32:35,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:35,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:35,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:35,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:35,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:35,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:35,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:35,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:35,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:35,716 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 354.08/291.35 [2019-03-28 22:32:35,716 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 4 loop predicates 354.08/291.35 [2019-03-28 22:32:35,717 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. 354.08/291.35 [2019-03-28 22:32:35,766 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 217 states and 267 transitions. Complement of second has 32 states. 354.08/291.35 [2019-03-28 22:32:35,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states 354.08/291.35 [2019-03-28 22:32:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 354.08/291.35 [2019-03-28 22:32:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. 354.08/291.35 [2019-03-28 22:32:35,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 6 letters. Loop has 4 letters. 354.08/291.35 [2019-03-28 22:32:35,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.35 [2019-03-28 22:32:35,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 10 letters. Loop has 4 letters. 354.08/291.35 [2019-03-28 22:32:35,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.35 [2019-03-28 22:32:35,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 6 letters. Loop has 8 letters. 354.08/291.35 [2019-03-28 22:32:35,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.35 [2019-03-28 22:32:35,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 267 transitions. 354.08/291.35 [2019-03-28 22:32:35,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 354.08/291.35 [2019-03-28 22:32:35,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 43 states and 51 transitions. 354.08/291.35 [2019-03-28 22:32:35,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 354.08/291.35 [2019-03-28 22:32:35,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 354.08/291.35 [2019-03-28 22:32:35,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 51 transitions. 354.08/291.35 [2019-03-28 22:32:35,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.35 [2019-03-28 22:32:35,776 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. 354.08/291.35 [2019-03-28 22:32:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 51 transitions. 354.08/291.35 [2019-03-28 22:32:35,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 19. 354.08/291.35 [2019-03-28 22:32:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 354.08/291.35 [2019-03-28 22:32:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. 354.08/291.35 [2019-03-28 22:32:35,778 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. 354.08/291.35 [2019-03-28 22:32:35,778 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. 354.08/291.35 [2019-03-28 22:32:35,778 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 354.08/291.35 [2019-03-28 22:32:35,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. 354.08/291.35 [2019-03-28 22:32:35,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 354.08/291.35 [2019-03-28 22:32:35,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.35 [2019-03-28 22:32:35,779 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.35 [2019-03-28 22:32:35,779 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 354.08/291.35 [2019-03-28 22:32:35,779 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] 354.08/291.35 [2019-03-28 22:32:35,779 INFO L794 eck$LassoCheckResult]: Stem: 1535#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 1536#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1537#L12 354.08/291.35 [2019-03-28 22:32:35,780 INFO L796 eck$LassoCheckResult]: Loop: 1537#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1541#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1546#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1539#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1540#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1547#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1548#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1549#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1542#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 0) (<= 10 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1543#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1551#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1550#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1537#L12 354.08/291.35 [2019-03-28 22:32:35,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:35,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 3 times 354.08/291.35 [2019-03-28 22:32:35,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:35,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:35,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:35,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:35,787 INFO L82 PathProgramCache]: Analyzing trace with hash 842360426, now seen corresponding path program 2 times 354.08/291.35 [2019-03-28 22:32:35,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:35,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:35,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:35,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 354.08/291.35 [2019-03-28 22:32:35,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 354.08/291.35 [2019-03-28 22:32:35,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 354.08/291.35 [2019-03-28 22:32:35,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 354.08/291.35 [2019-03-28 22:32:35,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:35,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:35,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:35,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 354.08/291.35 [2019-03-28 22:32:35,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 354.08/291.35 [2019-03-28 22:32:35,869 INFO L811 eck$LassoCheckResult]: loop already infeasible 354.08/291.35 [2019-03-28 22:32:35,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 354.08/291.35 [2019-03-28 22:32:35,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 354.08/291.35 [2019-03-28 22:32:35,869 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 6 Second operand 5 states. 354.08/291.35 [2019-03-28 22:32:35,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 354.08/291.35 [2019-03-28 22:32:35,896 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. 354.08/291.35 [2019-03-28 22:32:35,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 354.08/291.35 [2019-03-28 22:32:35,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. 354.08/291.35 [2019-03-28 22:32:35,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 354.08/291.35 [2019-03-28 22:32:35,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 31 transitions. 354.08/291.35 [2019-03-28 22:32:35,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 354.08/291.35 [2019-03-28 22:32:35,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 354.08/291.35 [2019-03-28 22:32:35,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. 354.08/291.35 [2019-03-28 22:32:35,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.35 [2019-03-28 22:32:35,899 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. 354.08/291.35 [2019-03-28 22:32:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. 354.08/291.35 [2019-03-28 22:32:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. 354.08/291.35 [2019-03-28 22:32:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 354.08/291.35 [2019-03-28 22:32:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. 354.08/291.35 [2019-03-28 22:32:35,901 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. 354.08/291.35 [2019-03-28 22:32:35,901 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. 354.08/291.35 [2019-03-28 22:32:35,901 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 354.08/291.35 [2019-03-28 22:32:35,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. 354.08/291.35 [2019-03-28 22:32:35,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 354.08/291.35 [2019-03-28 22:32:35,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.35 [2019-03-28 22:32:35,902 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.35 [2019-03-28 22:32:35,902 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 354.08/291.35 [2019-03-28 22:32:35,902 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 1, 1, 1] 354.08/291.35 [2019-03-28 22:32:35,903 INFO L794 eck$LassoCheckResult]: Stem: 1622#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 1623#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1624#L12 354.08/291.35 [2019-03-28 22:32:35,903 INFO L796 eck$LassoCheckResult]: Loop: 1624#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1620#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1621#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1630#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1628#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1629#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1642#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1626#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1627#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1641#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1640#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1639#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1636#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 0) (<= 10 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1633#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1632#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1631#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1624#L12 354.08/291.35 [2019-03-28 22:32:35,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:35,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 4 times 354.08/291.35 [2019-03-28 22:32:35,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:35,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:35,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:35,909 INFO L82 PathProgramCache]: Analyzing trace with hash -434931321, now seen corresponding path program 3 times 354.08/291.35 [2019-03-28 22:32:35,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:35,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:35,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:35,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 354.08/291.35 [2019-03-28 22:32:35,941 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 354.08/291.35 [2019-03-28 22:32:35,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 354.08/291.35 [2019-03-28 22:32:35,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) 354.08/291.35 [2019-03-28 22:32:35,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:35,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:35,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:35,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 354.08/291.35 [2019-03-28 22:32:35,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 354.08/291.35 [2019-03-28 22:32:35,992 INFO L811 eck$LassoCheckResult]: loop already infeasible 354.08/291.35 [2019-03-28 22:32:35,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 354.08/291.35 [2019-03-28 22:32:35,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 354.08/291.35 [2019-03-28 22:32:35,992 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 6 Second operand 6 states. 354.08/291.35 [2019-03-28 22:32:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 354.08/291.35 [2019-03-28 22:32:36,027 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. 354.08/291.35 [2019-03-28 22:32:36,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 354.08/291.35 [2019-03-28 22:32:36,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. 354.08/291.35 [2019-03-28 22:32:36,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 354.08/291.35 [2019-03-28 22:32:36,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 35 transitions. 354.08/291.35 [2019-03-28 22:32:36,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 354.08/291.35 [2019-03-28 22:32:36,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 354.08/291.35 [2019-03-28 22:32:36,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. 354.08/291.35 [2019-03-28 22:32:36,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.35 [2019-03-28 22:32:36,030 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. 354.08/291.35 [2019-03-28 22:32:36,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. 354.08/291.35 [2019-03-28 22:32:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. 354.08/291.35 [2019-03-28 22:32:36,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 354.08/291.35 [2019-03-28 22:32:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. 354.08/291.35 [2019-03-28 22:32:36,032 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. 354.08/291.35 [2019-03-28 22:32:36,032 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. 354.08/291.35 [2019-03-28 22:32:36,032 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 354.08/291.35 [2019-03-28 22:32:36,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. 354.08/291.35 [2019-03-28 22:32:36,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 354.08/291.35 [2019-03-28 22:32:36,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.35 [2019-03-28 22:32:36,033 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.35 [2019-03-28 22:32:36,034 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 354.08/291.35 [2019-03-28 22:32:36,034 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 1, 1, 1] 354.08/291.35 [2019-03-28 22:32:36,034 INFO L794 eck$LassoCheckResult]: Stem: 1730#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 1731#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1732#L12 354.08/291.35 [2019-03-28 22:32:36,034 INFO L796 eck$LassoCheckResult]: Loop: 1732#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1728#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1729#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1734#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1735#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1736#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1754#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1753#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1752#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1751#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1750#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1749#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1746#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1748#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1747#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1745#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1743#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 0) (<= 10 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1742#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1738#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1737#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1732#L12 354.08/291.35 [2019-03-28 22:32:36,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:36,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 5 times 354.08/291.35 [2019-03-28 22:32:36,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:36,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:36,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:36,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2008500700, now seen corresponding path program 4 times 354.08/291.35 [2019-03-28 22:32:36,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:36,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:36,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:36,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 354.08/291.35 [2019-03-28 22:32:36,089 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 354.08/291.35 [2019-03-28 22:32:36,108 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST 354.08/291.35 [2019-03-28 22:32:36,116 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) 354.08/291.35 [2019-03-28 22:32:36,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:36,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:36,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:36,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 354.08/291.35 [2019-03-28 22:32:36,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 354.08/291.35 [2019-03-28 22:32:36,149 INFO L811 eck$LassoCheckResult]: loop already infeasible 354.08/291.35 [2019-03-28 22:32:36,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 354.08/291.35 [2019-03-28 22:32:36,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 354.08/291.35 [2019-03-28 22:32:36,150 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 6 Second operand 7 states. 354.08/291.35 [2019-03-28 22:32:36,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 354.08/291.35 [2019-03-28 22:32:36,193 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. 354.08/291.35 [2019-03-28 22:32:36,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 354.08/291.35 [2019-03-28 22:32:36,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 40 transitions. 354.08/291.35 [2019-03-28 22:32:36,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 354.08/291.35 [2019-03-28 22:32:36,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 39 transitions. 354.08/291.35 [2019-03-28 22:32:36,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 354.08/291.35 [2019-03-28 22:32:36,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 354.08/291.35 [2019-03-28 22:32:36,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. 354.08/291.35 [2019-03-28 22:32:36,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.35 [2019-03-28 22:32:36,196 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. 354.08/291.35 [2019-03-28 22:32:36,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. 354.08/291.35 [2019-03-28 22:32:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. 354.08/291.35 [2019-03-28 22:32:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 354.08/291.35 [2019-03-28 22:32:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. 354.08/291.35 [2019-03-28 22:32:36,199 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. 354.08/291.35 [2019-03-28 22:32:36,199 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. 354.08/291.35 [2019-03-28 22:32:36,199 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 354.08/291.35 [2019-03-28 22:32:36,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. 354.08/291.35 [2019-03-28 22:32:36,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 354.08/291.35 [2019-03-28 22:32:36,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.35 [2019-03-28 22:32:36,199 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.35 [2019-03-28 22:32:36,200 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 354.08/291.35 [2019-03-28 22:32:36,200 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 5, 1, 1, 1] 354.08/291.35 [2019-03-28 22:32:36,200 INFO L794 eck$LassoCheckResult]: Stem: 1859#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 1860#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1861#L12 354.08/291.35 [2019-03-28 22:32:36,201 INFO L796 eck$LassoCheckResult]: Loop: 1861#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1857#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1858#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1863#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1864#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1865#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1887#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1886#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1885#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1884#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1883#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1882#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1881#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1880#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1879#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1878#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1875#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1877#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1876#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1874#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1872#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 0) (<= 10 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1871#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1867#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1866#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1861#L12 354.08/291.35 [2019-03-28 22:32:36,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:36,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 6 times 354.08/291.35 [2019-03-28 22:32:36,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:36,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:36,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:36,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:36,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1579441217, now seen corresponding path program 5 times 354.08/291.35 [2019-03-28 22:32:36,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:36,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:36,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:36,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 354.08/291.35 [2019-03-28 22:32:36,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 354.08/291.35 [2019-03-28 22:32:36,267 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 354.08/291.35 [2019-03-28 22:32:36,280 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) 354.08/291.35 [2019-03-28 22:32:36,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:36,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:36,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:36,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 354.08/291.35 [2019-03-28 22:32:36,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 354.08/291.35 [2019-03-28 22:32:36,317 INFO L811 eck$LassoCheckResult]: loop already infeasible 354.08/291.35 [2019-03-28 22:32:36,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 354.08/291.35 [2019-03-28 22:32:36,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 354.08/291.35 [2019-03-28 22:32:36,318 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. cyclomatic complexity: 6 Second operand 8 states. 354.08/291.35 [2019-03-28 22:32:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 354.08/291.35 [2019-03-28 22:32:36,377 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. 354.08/291.35 [2019-03-28 22:32:36,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 354.08/291.35 [2019-03-28 22:32:36,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 44 transitions. 354.08/291.35 [2019-03-28 22:32:36,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 354.08/291.35 [2019-03-28 22:32:36,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 38 states and 43 transitions. 354.08/291.35 [2019-03-28 22:32:36,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 354.08/291.35 [2019-03-28 22:32:36,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 354.08/291.35 [2019-03-28 22:32:36,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. 354.08/291.35 [2019-03-28 22:32:36,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.35 [2019-03-28 22:32:36,381 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. 354.08/291.35 [2019-03-28 22:32:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. 354.08/291.35 [2019-03-28 22:32:36,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. 354.08/291.35 [2019-03-28 22:32:36,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 354.08/291.35 [2019-03-28 22:32:36,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. 354.08/291.35 [2019-03-28 22:32:36,383 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. 354.08/291.35 [2019-03-28 22:32:36,383 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. 354.08/291.35 [2019-03-28 22:32:36,383 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 354.08/291.35 [2019-03-28 22:32:36,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. 354.08/291.35 [2019-03-28 22:32:36,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 354.08/291.35 [2019-03-28 22:32:36,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.35 [2019-03-28 22:32:36,384 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.35 [2019-03-28 22:32:36,384 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 354.08/291.35 [2019-03-28 22:32:36,385 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 6, 1, 1, 1] 354.08/291.35 [2019-03-28 22:32:36,385 INFO L794 eck$LassoCheckResult]: Stem: 2009#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 2010#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2011#L12 354.08/291.35 [2019-03-28 22:32:36,385 INFO L796 eck$LassoCheckResult]: Loop: 2011#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2007#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2008#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2013#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2014#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2015#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2041#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2040#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2039#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2038#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2037#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2036#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2035#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2034#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2033#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2032#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2031#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2030#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2029#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2028#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2025#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2027#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2026#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2024#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2022#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 0) (<= 10 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2021#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2017#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2016#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2011#L12 354.08/291.35 [2019-03-28 22:32:36,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:36,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 7 times 354.08/291.35 [2019-03-28 22:32:36,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:36,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:36,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:36,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:36,391 INFO L82 PathProgramCache]: Analyzing trace with hash -212489250, now seen corresponding path program 6 times 354.08/291.35 [2019-03-28 22:32:36,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:36,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:36,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:36,479 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 29 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:36,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 354.08/291.35 [2019-03-28 22:32:36,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 354.08/291.35 [2019-03-28 22:32:36,494 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE 354.08/291.35 [2019-03-28 22:32:36,507 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) 354.08/291.35 [2019-03-28 22:32:36,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:36,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:36,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 29 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:36,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 354.08/291.35 [2019-03-28 22:32:36,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 354.08/291.35 [2019-03-28 22:32:36,543 INFO L811 eck$LassoCheckResult]: loop already infeasible 354.08/291.35 [2019-03-28 22:32:36,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 354.08/291.35 [2019-03-28 22:32:36,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 354.08/291.35 [2019-03-28 22:32:36,543 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. cyclomatic complexity: 6 Second operand 9 states. 354.08/291.35 [2019-03-28 22:32:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 354.08/291.35 [2019-03-28 22:32:36,604 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. 354.08/291.35 [2019-03-28 22:32:36,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 354.08/291.35 [2019-03-28 22:32:36,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 48 transitions. 354.08/291.35 [2019-03-28 22:32:36,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 354.08/291.35 [2019-03-28 22:32:36,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 47 transitions. 354.08/291.35 [2019-03-28 22:32:36,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 354.08/291.35 [2019-03-28 22:32:36,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 354.08/291.35 [2019-03-28 22:32:36,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 47 transitions. 354.08/291.35 [2019-03-28 22:32:36,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.35 [2019-03-28 22:32:36,608 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 47 transitions. 354.08/291.35 [2019-03-28 22:32:36,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 47 transitions. 354.08/291.35 [2019-03-28 22:32:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. 354.08/291.35 [2019-03-28 22:32:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 354.08/291.35 [2019-03-28 22:32:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. 354.08/291.35 [2019-03-28 22:32:36,610 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. 354.08/291.35 [2019-03-28 22:32:36,610 INFO L609 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. 354.08/291.35 [2019-03-28 22:32:36,610 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 354.08/291.35 [2019-03-28 22:32:36,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. 354.08/291.35 [2019-03-28 22:32:36,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 354.08/291.35 [2019-03-28 22:32:36,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.35 [2019-03-28 22:32:36,611 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.35 [2019-03-28 22:32:36,611 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 354.08/291.35 [2019-03-28 22:32:36,612 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 7, 1, 1, 1] 354.08/291.35 [2019-03-28 22:32:36,612 INFO L794 eck$LassoCheckResult]: Stem: 2180#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 2181#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2182#L12 354.08/291.35 [2019-03-28 22:32:36,613 INFO L796 eck$LassoCheckResult]: Loop: 2182#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2178#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2179#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2184#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2185#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2186#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2216#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2215#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2214#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2213#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2212#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2211#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2210#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2209#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2208#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2207#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2206#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2205#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2204#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2203#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2202#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2201#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2200#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2199#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2196#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2198#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2197#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2195#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2193#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 0) (<= 10 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2192#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2188#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2187#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2182#L12 354.08/291.35 [2019-03-28 22:32:36,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:36,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 8 times 354.08/291.35 [2019-03-28 22:32:36,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:36,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:36,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:36,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:36,618 INFO L82 PathProgramCache]: Analyzing trace with hash -370416389, now seen corresponding path program 7 times 354.08/291.35 [2019-03-28 22:32:36,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:36,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:36,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 34 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:36,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 354.08/291.35 [2019-03-28 22:32:36,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 354.08/291.35 [2019-03-28 22:32:36,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:36,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:36,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 34 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:36,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 354.08/291.35 [2019-03-28 22:32:36,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 354.08/291.35 [2019-03-28 22:32:36,759 INFO L811 eck$LassoCheckResult]: loop already infeasible 354.08/291.35 [2019-03-28 22:32:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 354.08/291.35 [2019-03-28 22:32:36,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 354.08/291.35 [2019-03-28 22:32:36,759 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. cyclomatic complexity: 6 Second operand 10 states. 354.08/291.35 [2019-03-28 22:32:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 354.08/291.35 [2019-03-28 22:32:36,819 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. 354.08/291.35 [2019-03-28 22:32:36,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 354.08/291.35 [2019-03-28 22:32:36,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 52 transitions. 354.08/291.35 [2019-03-28 22:32:36,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 354.08/291.35 [2019-03-28 22:32:36,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 46 states and 51 transitions. 354.08/291.35 [2019-03-28 22:32:36,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 354.08/291.35 [2019-03-28 22:32:36,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 354.08/291.35 [2019-03-28 22:32:36,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 51 transitions. 354.08/291.35 [2019-03-28 22:32:36,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.35 [2019-03-28 22:32:36,822 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. 354.08/291.35 [2019-03-28 22:32:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 51 transitions. 354.08/291.35 [2019-03-28 22:32:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. 354.08/291.35 [2019-03-28 22:32:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. 354.08/291.35 [2019-03-28 22:32:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. 354.08/291.35 [2019-03-28 22:32:36,825 INFO L729 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. 354.08/291.35 [2019-03-28 22:32:36,825 INFO L609 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. 354.08/291.35 [2019-03-28 22:32:36,825 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ 354.08/291.35 [2019-03-28 22:32:36,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 48 transitions. 354.08/291.35 [2019-03-28 22:32:36,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 354.08/291.35 [2019-03-28 22:32:36,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.35 [2019-03-28 22:32:36,826 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.35 [2019-03-28 22:32:36,826 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 354.08/291.35 [2019-03-28 22:32:36,826 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 8, 1, 1, 1] 354.08/291.35 [2019-03-28 22:32:36,826 INFO L794 eck$LassoCheckResult]: Stem: 2372#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 2373#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2374#L12 354.08/291.35 [2019-03-28 22:32:36,827 INFO L796 eck$LassoCheckResult]: Loop: 2374#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2370#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2371#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2376#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2377#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2378#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2412#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2411#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2410#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2409#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2408#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2407#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2406#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2405#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2404#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2403#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2402#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2401#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2400#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2399#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2398#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2397#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2396#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2395#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2394#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2393#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2392#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2391#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2388#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2390#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2389#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2387#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2385#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 0) (<= 10 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2384#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2380#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2379#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2374#L12 354.08/291.35 [2019-03-28 22:32:36,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:36,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 9 times 354.08/291.35 [2019-03-28 22:32:36,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:36,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:36,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:36,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash -900315240, now seen corresponding path program 8 times 354.08/291.35 [2019-03-28 22:32:36,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:36,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:36,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 39 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:36,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 354.08/291.35 [2019-03-28 22:32:36,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 354.08/291.35 [2019-03-28 22:32:36,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 354.08/291.35 [2019-03-28 22:32:36,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 354.08/291.35 [2019-03-28 22:32:36,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:36,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:36,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 39 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:36,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 354.08/291.35 [2019-03-28 22:32:36,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 354.08/291.35 [2019-03-28 22:32:36,982 INFO L811 eck$LassoCheckResult]: loop already infeasible 354.08/291.35 [2019-03-28 22:32:36,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 354.08/291.35 [2019-03-28 22:32:36,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 354.08/291.35 [2019-03-28 22:32:36,982 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. cyclomatic complexity: 6 Second operand 11 states. 354.08/291.35 [2019-03-28 22:32:37,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 354.08/291.35 [2019-03-28 22:32:37,079 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. 354.08/291.35 [2019-03-28 22:32:37,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 354.08/291.35 [2019-03-28 22:32:37,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 56 transitions. 354.08/291.35 [2019-03-28 22:32:37,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 354.08/291.35 [2019-03-28 22:32:37,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 50 states and 55 transitions. 354.08/291.35 [2019-03-28 22:32:37,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 354.08/291.35 [2019-03-28 22:32:37,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 354.08/291.35 [2019-03-28 22:32:37,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 55 transitions. 354.08/291.35 [2019-03-28 22:32:37,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.35 [2019-03-28 22:32:37,082 INFO L706 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. 354.08/291.35 [2019-03-28 22:32:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 55 transitions. 354.08/291.35 [2019-03-28 22:32:37,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. 354.08/291.35 [2019-03-28 22:32:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 354.08/291.35 [2019-03-28 22:32:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. 354.08/291.35 [2019-03-28 22:32:37,084 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. 354.08/291.35 [2019-03-28 22:32:37,085 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. 354.08/291.35 [2019-03-28 22:32:37,085 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ 354.08/291.35 [2019-03-28 22:32:37,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 52 transitions. 354.08/291.35 [2019-03-28 22:32:37,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 354.08/291.35 [2019-03-28 22:32:37,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.35 [2019-03-28 22:32:37,085 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.35 [2019-03-28 22:32:37,086 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 354.08/291.35 [2019-03-28 22:32:37,086 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 9, 1, 1, 1] 354.08/291.35 [2019-03-28 22:32:37,086 INFO L794 eck$LassoCheckResult]: Stem: 2585#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 2586#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2587#L12 354.08/291.35 [2019-03-28 22:32:37,087 INFO L796 eck$LassoCheckResult]: Loop: 2587#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2583#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2584#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2589#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2590#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2591#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2629#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2628#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2627#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2626#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2625#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2624#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2623#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2622#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2621#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2620#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2619#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2618#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2617#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2616#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2615#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2614#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2613#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2612#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2611#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2610#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2609#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2608#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2607#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2606#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2605#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2604#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2601#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2603#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2602#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2600#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2597#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 0) (<= 10 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2594#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2593#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2592#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2587#L12 354.08/291.35 [2019-03-28 22:32:37,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:37,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 10 times 354.08/291.35 [2019-03-28 22:32:37,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:37,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:37,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:37,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:37,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:37,093 INFO L82 PathProgramCache]: Analyzing trace with hash -748416075, now seen corresponding path program 9 times 354.08/291.35 [2019-03-28 22:32:37,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:37,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:37,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:37,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:37,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:37,208 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 44 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:37,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 354.08/291.35 [2019-03-28 22:32:37,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 354.08/291.35 [2019-03-28 22:32:37,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 354.08/291.35 [2019-03-28 22:32:37,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) 354.08/291.35 [2019-03-28 22:32:37,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:37,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:37,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:37,249 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 44 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:37,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 354.08/291.35 [2019-03-28 22:32:37,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 354.08/291.35 [2019-03-28 22:32:37,276 INFO L811 eck$LassoCheckResult]: loop already infeasible 354.08/291.35 [2019-03-28 22:32:37,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. 354.08/291.35 [2019-03-28 22:32:37,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 354.08/291.35 [2019-03-28 22:32:37,277 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. cyclomatic complexity: 6 Second operand 12 states. 354.08/291.35 [2019-03-28 22:32:37,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 354.08/291.35 [2019-03-28 22:32:37,387 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. 354.08/291.35 [2019-03-28 22:32:37,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 354.08/291.35 [2019-03-28 22:32:37,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 116 transitions. 354.08/291.35 [2019-03-28 22:32:37,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 354.08/291.35 [2019-03-28 22:32:37,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 101 states and 113 transitions. 354.08/291.35 [2019-03-28 22:32:37,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 354.08/291.35 [2019-03-28 22:32:37,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 354.08/291.35 [2019-03-28 22:32:37,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 113 transitions. 354.08/291.35 [2019-03-28 22:32:37,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.35 [2019-03-28 22:32:37,391 INFO L706 BuchiCegarLoop]: Abstraction has 101 states and 113 transitions. 354.08/291.35 [2019-03-28 22:32:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 113 transitions. 354.08/291.35 [2019-03-28 22:32:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. 354.08/291.35 [2019-03-28 22:32:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. 354.08/291.35 [2019-03-28 22:32:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. 354.08/291.35 [2019-03-28 22:32:37,394 INFO L729 BuchiCegarLoop]: Abstraction has 82 states and 94 transitions. 354.08/291.35 [2019-03-28 22:32:37,394 INFO L609 BuchiCegarLoop]: Abstraction has 82 states and 94 transitions. 354.08/291.35 [2019-03-28 22:32:37,394 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ 354.08/291.35 [2019-03-28 22:32:37,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 94 transitions. 354.08/291.35 [2019-03-28 22:32:37,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 354.08/291.35 [2019-03-28 22:32:37,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.35 [2019-03-28 22:32:37,395 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.35 [2019-03-28 22:32:37,396 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 354.08/291.35 [2019-03-28 22:32:37,396 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 10, 1, 1, 1] 354.08/291.35 [2019-03-28 22:32:37,396 INFO L794 eck$LassoCheckResult]: Stem: 2870#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 2871#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2873#L12 354.08/291.35 [2019-03-28 22:32:37,397 INFO L796 eck$LassoCheckResult]: Loop: 2873#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2868#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2869#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2874#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2875#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2876#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2878#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2879#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2918#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2917#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2916#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2915#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2914#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2913#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2912#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2911#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2910#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2909#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2908#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2907#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2906#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2905#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2904#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2903#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2902#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2901#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2900#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2899#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2898#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2897#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2896#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2895#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2894#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2893#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2892#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2891#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2888#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 2890#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2889#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2887#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2886#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 0) (<= 10 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 2883#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 2885#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 2884#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 2873#L12 354.08/291.35 [2019-03-28 22:32:37,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:37,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2180, now seen corresponding path program 11 times 354.08/291.35 [2019-03-28 22:32:37,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:37,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:37,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:37,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:37,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:37,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:37,403 INFO L82 PathProgramCache]: Analyzing trace with hash -901478062, now seen corresponding path program 10 times 354.08/291.35 [2019-03-28 22:32:37,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:37,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:37,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:37,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:37,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash -258205355, now seen corresponding path program 1 times 354.08/291.35 [2019-03-28 22:32:37,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:32:37,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:32:37,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:37,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:37,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:32:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:32:37,620 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 45 354.08/291.35 [2019-03-28 22:32:37,630 INFO L216 LassoAnalysis]: Preferences: 354.08/291.35 [2019-03-28 22:32:37,631 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 354.08/291.35 [2019-03-28 22:32:37,631 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 354.08/291.35 [2019-03-28 22:32:37,631 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 354.08/291.35 [2019-03-28 22:32:37,631 INFO L127 ssoRankerPreferences]: Use exernal solver: true 354.08/291.35 [2019-03-28 22:32:37,631 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:37,631 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 354.08/291.35 [2019-03-28 22:32:37,631 INFO L130 ssoRankerPreferences]: Path of dumped script: 354.08/291.35 [2019-03-28 22:32:37,632 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Loop 354.08/291.35 [2019-03-28 22:32:37,632 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 354.08/291.35 [2019-03-28 22:32:37,632 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 354.08/291.35 [2019-03-28 22:32:37,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:37,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:37,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:37,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:37,692 INFO L300 LassoAnalysis]: Preprocessing complete. 354.08/291.35 [2019-03-28 22:32:37,693 INFO L412 LassoAnalysis]: Checking for nontermination... 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:37,695 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.35 [2019-03-28 22:32:37,695 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:37,725 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 354.08/291.35 [2019-03-28 22:32:37,725 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.35 [2019-03-28 22:32:37,729 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 354.08/291.35 [2019-03-28 22:32:37,752 INFO L216 LassoAnalysis]: Preferences: 354.08/291.35 [2019-03-28 22:32:37,753 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 354.08/291.35 [2019-03-28 22:32:37,753 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 354.08/291.35 [2019-03-28 22:32:37,753 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 354.08/291.35 [2019-03-28 22:32:37,753 INFO L127 ssoRankerPreferences]: Use exernal solver: false 354.08/291.35 [2019-03-28 22:32:37,753 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:32:37,753 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 354.08/291.35 [2019-03-28 22:32:37,753 INFO L130 ssoRankerPreferences]: Path of dumped script: 354.08/291.35 [2019-03-28 22:32:37,753 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Loop 354.08/291.35 [2019-03-28 22:32:37,754 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 354.08/291.35 [2019-03-28 22:32:37,754 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 354.08/291.35 [2019-03-28 22:32:37,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:37,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:37,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:37,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:32:37,802 INFO L300 LassoAnalysis]: Preprocessing complete. 354.08/291.35 [2019-03-28 22:32:37,802 INFO L497 LassoAnalysis]: Using template 'affine'. 354.08/291.35 [2019-03-28 22:32:37,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.35 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.35 Number of strict supporting invariants: 0 354.08/291.35 Number of non-strict supporting invariants: 1 354.08/291.35 Consider only non-deceasing supporting invariants: true 354.08/291.35 Simplify termination arguments: true 354.08/291.35 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.35 [2019-03-28 22:32:37,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.35 [2019-03-28 22:32:37,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 354.08/291.35 [2019-03-28 22:32:37,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.35 [2019-03-28 22:32:37,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.35 [2019-03-28 22:32:37,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.35 [2019-03-28 22:32:37,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 354.08/291.35 [2019-03-28 22:32:37,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 354.08/291.35 [2019-03-28 22:32:37,807 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 354.08/291.35 [2019-03-28 22:32:37,809 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 354.08/291.35 [2019-03-28 22:32:37,809 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 354.08/291.35 [2019-03-28 22:32:37,809 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 354.08/291.35 [2019-03-28 22:32:37,809 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 354.08/291.35 [2019-03-28 22:32:37,810 INFO L518 LassoAnalysis]: Proved termination. 354.08/291.35 [2019-03-28 22:32:37,810 INFO L520 LassoAnalysis]: Termination argument consisting of: 354.08/291.35 Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 9 354.08/291.35 Supporting invariants [] 354.08/291.35 [2019-03-28 22:32:37,810 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 354.08/291.35 [2019-03-28 22:32:37,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:32:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:37,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:37,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:37,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:37,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:37,931 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:32:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:37,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:37,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:38,444 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_85 Int)) (<= 9 (+ (* 2 v_ULTIMATE.start_main_~i~0_85) c_oldRank0))) is different from true 354.08/291.35 [2019-03-28 22:32:39,348 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.35 [2019-03-28 22:32:40,654 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 11 354.08/291.35 [2019-03-28 22:32:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:40,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:40,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:41,103 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 9 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true 354.08/291.35 [2019-03-28 22:32:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:41,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:41,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:42,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:42,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:42,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:42,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:42,984 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_90 Int)) (<= 9 (+ (* 2 v_ULTIMATE.start_main_~i~0_90) c_oldRank0))) is different from true 354.08/291.35 [2019-03-28 22:32:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:43,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:43,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:43,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:43,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:44,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:44,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:44,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:44,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:45,310 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_95 Int)) (<= 9 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_95)))) is different from true 354.08/291.35 [2019-03-28 22:32:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:45,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:45,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:46,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:46,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:46,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:46,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:47,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:47,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:47,640 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_100 Int)) (<= 9 (+ (* 2 v_ULTIMATE.start_main_~i~0_100) c_oldRank0))) is different from true 354.08/291.35 [2019-03-28 22:32:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:48,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:48,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:48,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:48,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:49,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:49,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:49,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:49,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:49,954 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_105 Int)) (<= 9 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_105)))) is different from true 354.08/291.35 [2019-03-28 22:32:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:50,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:50,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:50,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:50,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:51,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:51,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:51,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:51,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:52,275 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_110 Int)) (<= 9 (+ (* 2 v_ULTIMATE.start_main_~i~0_110) c_oldRank0))) is different from true 354.08/291.35 [2019-03-28 22:32:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:52,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:52,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:53,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:53,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:53,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:53,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:54,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:54,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:54,568 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_115 Int)) (<= 9 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_115)))) is different from true 354.08/291.35 [2019-03-28 22:32:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:55,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:55,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:55,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:55,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:55,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:55,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:56,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:56,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:56,865 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_120 Int)) (<= 9 (+ (* 2 v_ULTIMATE.start_main_~i~0_120) c_oldRank0))) is different from true 354.08/291.35 [2019-03-28 22:32:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:57,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:57,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:57,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:57,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:58,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:58,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:58,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:58,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:32:59,146 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_125 Int)) (<= 9 (+ (* 2 v_ULTIMATE.start_main_~i~0_125) c_oldRank0))) is different from true 354.08/291.35 [2019-03-28 22:32:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:32:59,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:32:59,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:00,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:00,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:00,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:00,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:00,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:00,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:01,415 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_130 Int)) (<= 9 (+ (* 2 v_ULTIMATE.start_main_~i~0_130) c_oldRank0))) is different from true 354.08/291.35 [2019-03-28 22:33:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:01,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:01,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:01,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:01,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:01,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:01,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:02,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:02,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:02,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:02,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:02,156 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 19 predicates after loop cannibalization 354.08/291.35 [2019-03-28 22:33:02,156 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 19 loop predicates 354.08/291.35 [2019-03-28 22:33:02,156 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 82 states and 94 transitions. cyclomatic complexity: 13 Second operand 6 states. 354.08/291.35 [2019-03-28 22:33:02,491 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 82 states and 94 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 606 states and 680 transitions. Complement of second has 137 states. 354.08/291.35 [2019-03-28 22:33:02,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 10 non-accepting loop states 1 accepting loop states 354.08/291.35 [2019-03-28 22:33:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 354.08/291.35 [2019-03-28 22:33:02,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. 354.08/291.35 [2019-03-28 22:33:02,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 52 transitions. Stem has 2 letters. Loop has 44 letters. 354.08/291.35 [2019-03-28 22:33:02,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.35 [2019-03-28 22:33:02,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 52 transitions. Stem has 46 letters. Loop has 44 letters. 354.08/291.35 [2019-03-28 22:33:02,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.35 [2019-03-28 22:33:02,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 52 transitions. Stem has 2 letters. Loop has 88 letters. 354.08/291.35 [2019-03-28 22:33:02,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.35 [2019-03-28 22:33:02,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 606 states and 680 transitions. 354.08/291.35 [2019-03-28 22:33:02,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 354.08/291.35 [2019-03-28 22:33:02,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 606 states to 130 states and 145 transitions. 354.08/291.35 [2019-03-28 22:33:02,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 354.08/291.35 [2019-03-28 22:33:02,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 354.08/291.35 [2019-03-28 22:33:02,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 145 transitions. 354.08/291.35 [2019-03-28 22:33:02,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.35 [2019-03-28 22:33:02,511 INFO L706 BuchiCegarLoop]: Abstraction has 130 states and 145 transitions. 354.08/291.35 [2019-03-28 22:33:02,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 145 transitions. 354.08/291.35 [2019-03-28 22:33:02,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 84. 354.08/291.35 [2019-03-28 22:33:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. 354.08/291.35 [2019-03-28 22:33:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. 354.08/291.35 [2019-03-28 22:33:02,514 INFO L729 BuchiCegarLoop]: Abstraction has 84 states and 95 transitions. 354.08/291.35 [2019-03-28 22:33:02,514 INFO L609 BuchiCegarLoop]: Abstraction has 84 states and 95 transitions. 354.08/291.35 [2019-03-28 22:33:02,514 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ 354.08/291.35 [2019-03-28 22:33:02,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 95 transitions. 354.08/291.35 [2019-03-28 22:33:02,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 354.08/291.35 [2019-03-28 22:33:02,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.35 [2019-03-28 22:33:02,515 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.35 [2019-03-28 22:33:02,516 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 354.08/291.35 [2019-03-28 22:33:02,516 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 10, 3, 1, 1] 354.08/291.35 [2019-03-28 22:33:02,516 INFO L794 eck$LassoCheckResult]: Stem: 9301#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 9302#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 9315#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 9313#L12-2 354.08/291.35 [2019-03-28 22:33:02,517 INFO L796 eck$LassoCheckResult]: Loop: 9313#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 9314#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 9303#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 9304#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 9300#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 9299#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 9356#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 9308#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 9309#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 9312#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 9305#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 9306#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 9355#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 9354#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 9353#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 9352#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 9351#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 9350#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 9349#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 9348#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 9347#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 9346#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 9345#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 9344#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 9343#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 9342#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 9341#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 9340#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 9339#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 9338#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 9337#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 9336#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 9335#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 9334#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 9333#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 9332#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 9331#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 9330#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 9329#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 9328#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 9327#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 9326#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 9325#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 9322#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 9324#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 9323#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 9321#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 9320#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 0) (<= 10 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 9316#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 9319#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 9317#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 9315#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 9313#L12-2 354.08/291.35 [2019-03-28 22:33:02,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:33:02,517 INFO L82 PathProgramCache]: Analyzing trace with hash 67630, now seen corresponding path program 1 times 354.08/291.35 [2019-03-28 22:33:02,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:33:02,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:33:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:33:02,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:33:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:33:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:33:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:33:02,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:33:02,522 INFO L82 PathProgramCache]: Analyzing trace with hash -573050012, now seen corresponding path program 11 times 354.08/291.35 [2019-03-28 22:33:02,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:33:02,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:33:02,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:33:02,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:33:02,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:33:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:33:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:33:02,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:33:02,542 INFO L82 PathProgramCache]: Analyzing trace with hash 943075089, now seen corresponding path program 2 times 354.08/291.35 [2019-03-28 22:33:02,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.35 [2019-03-28 22:33:02,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.35 [2019-03-28 22:33:02,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:33:02,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:33:02,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.35 [2019-03-28 22:33:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:33:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.35 [2019-03-28 22:33:02,830 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 53 354.08/291.35 [2019-03-28 22:33:02,841 INFO L216 LassoAnalysis]: Preferences: 354.08/291.35 [2019-03-28 22:33:02,841 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 354.08/291.35 [2019-03-28 22:33:02,841 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 354.08/291.35 [2019-03-28 22:33:02,841 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 354.08/291.35 [2019-03-28 22:33:02,842 INFO L127 ssoRankerPreferences]: Use exernal solver: true 354.08/291.35 [2019-03-28 22:33:02,842 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:33:02,842 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 354.08/291.35 [2019-03-28 22:33:02,842 INFO L130 ssoRankerPreferences]: Path of dumped script: 354.08/291.35 [2019-03-28 22:33:02,842 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration15_Loop 354.08/291.35 [2019-03-28 22:33:02,842 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 354.08/291.35 [2019-03-28 22:33:02,842 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 354.08/291.35 [2019-03-28 22:33:02,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:33:02,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:33:02,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:33:02,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:33:02,901 INFO L300 LassoAnalysis]: Preprocessing complete. 354.08/291.35 [2019-03-28 22:33:02,901 INFO L412 LassoAnalysis]: Checking for nontermination... 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:33:02,917 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.35 [2019-03-28 22:33:02,917 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.35 [2019-03-28 22:33:02,921 INFO L445 LassoAnalysis]: Proved nontermination for one component. 354.08/291.35 [2019-03-28 22:33:02,921 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:33:02,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.35 [2019-03-28 22:33:02,947 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.35 [2019-03-28 22:33:02,974 INFO L445 LassoAnalysis]: Proved nontermination for one component. 354.08/291.35 [2019-03-28 22:33:02,974 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:33:02,978 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.35 [2019-03-28 22:33:02,979 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.35 [2019-03-28 22:33:03,006 INFO L445 LassoAnalysis]: Proved nontermination for one component. 354.08/291.35 [2019-03-28 22:33:03,006 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:33:03,010 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.35 [2019-03-28 22:33:03,011 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.35 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.35 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.35 Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:33:03,041 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 354.08/291.35 [2019-03-28 22:33:03,041 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.35 [2019-03-28 22:33:03,075 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 354.08/291.35 [2019-03-28 22:33:03,077 INFO L216 LassoAnalysis]: Preferences: 354.08/291.35 [2019-03-28 22:33:03,077 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 354.08/291.35 [2019-03-28 22:33:03,077 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 354.08/291.35 [2019-03-28 22:33:03,077 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 354.08/291.35 [2019-03-28 22:33:03,077 INFO L127 ssoRankerPreferences]: Use exernal solver: false 354.08/291.35 [2019-03-28 22:33:03,077 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 354.08/291.35 [2019-03-28 22:33:03,077 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 354.08/291.35 [2019-03-28 22:33:03,078 INFO L130 ssoRankerPreferences]: Path of dumped script: 354.08/291.35 [2019-03-28 22:33:03,078 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration15_Loop 354.08/291.35 [2019-03-28 22:33:03,078 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 354.08/291.35 [2019-03-28 22:33:03,078 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 354.08/291.35 [2019-03-28 22:33:03,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:33:03,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:33:03,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:33:03,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.35 [2019-03-28 22:33:03,136 INFO L300 LassoAnalysis]: Preprocessing complete. 354.08/291.35 [2019-03-28 22:33:03,136 INFO L497 LassoAnalysis]: Using template 'affine'. 354.08/291.35 [2019-03-28 22:33:03,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.35 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.35 Number of strict supporting invariants: 0 354.08/291.35 Number of non-strict supporting invariants: 1 354.08/291.35 Consider only non-deceasing supporting invariants: true 354.08/291.35 Simplify termination arguments: true 354.08/291.35 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.35 [2019-03-28 22:33:03,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.35 [2019-03-28 22:33:03,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 354.08/291.35 [2019-03-28 22:33:03,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.35 [2019-03-28 22:33:03,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.35 [2019-03-28 22:33:03,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.35 [2019-03-28 22:33:03,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 354.08/291.35 [2019-03-28 22:33:03,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 354.08/291.35 [2019-03-28 22:33:03,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 354.08/291.35 [2019-03-28 22:33:03,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.35 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.35 Number of strict supporting invariants: 0 354.08/291.35 Number of non-strict supporting invariants: 1 354.08/291.35 Consider only non-deceasing supporting invariants: true 354.08/291.35 Simplify termination arguments: true 354.08/291.35 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.35 [2019-03-28 22:33:03,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.35 [2019-03-28 22:33:03,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.35 [2019-03-28 22:33:03,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.35 [2019-03-28 22:33:03,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.35 [2019-03-28 22:33:03,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 354.08/291.35 [2019-03-28 22:33:03,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 354.08/291.35 [2019-03-28 22:33:03,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 354.08/291.35 [2019-03-28 22:33:03,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.35 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.35 Number of strict supporting invariants: 0 354.08/291.35 Number of non-strict supporting invariants: 1 354.08/291.35 Consider only non-deceasing supporting invariants: true 354.08/291.35 Simplify termination arguments: true 354.08/291.35 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.35 [2019-03-28 22:33:03,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.35 [2019-03-28 22:33:03,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.35 [2019-03-28 22:33:03,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.35 [2019-03-28 22:33:03,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.35 [2019-03-28 22:33:03,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 354.08/291.35 [2019-03-28 22:33:03,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 354.08/291.35 [2019-03-28 22:33:03,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 354.08/291.35 [2019-03-28 22:33:03,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.35 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.35 Number of strict supporting invariants: 0 354.08/291.35 Number of non-strict supporting invariants: 1 354.08/291.35 Consider only non-deceasing supporting invariants: true 354.08/291.35 Simplify termination arguments: true 354.08/291.35 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.35 [2019-03-28 22:33:03,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.35 [2019-03-28 22:33:03,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 354.08/291.35 [2019-03-28 22:33:03,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.35 [2019-03-28 22:33:03,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.35 [2019-03-28 22:33:03,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.35 [2019-03-28 22:33:03,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 354.08/291.35 [2019-03-28 22:33:03,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 354.08/291.35 [2019-03-28 22:33:03,150 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 354.08/291.35 [2019-03-28 22:33:03,151 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 354.08/291.35 [2019-03-28 22:33:03,151 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 354.08/291.35 [2019-03-28 22:33:03,152 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 354.08/291.35 [2019-03-28 22:33:03,152 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 354.08/291.35 [2019-03-28 22:33:03,152 INFO L518 LassoAnalysis]: Proved termination. 354.08/291.35 [2019-03-28 22:33:03,152 INFO L520 LassoAnalysis]: Termination argument consisting of: 354.08/291.35 Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 11 354.08/291.35 Supporting invariants [] 354.08/291.35 [2019-03-28 22:33:03,152 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 354.08/291.35 [2019-03-28 22:33:03,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.35 [2019-03-28 22:33:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:03,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:03,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:03,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:03,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 48 proven. 93 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. 354.08/291.35 [2019-03-28 22:33:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:03,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:03,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:03,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:03,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:03,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:03,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:03,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:03,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:03,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:03,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:03,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:03,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:04,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:04,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:04,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:04,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:04,885 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_172 Int)) (<= 11 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_172)))) is different from true 354.08/291.35 [2019-03-28 22:33:05,791 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.35 [2019-03-28 22:33:07,109 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.35 [2019-03-28 22:33:08,860 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.35 [2019-03-28 22:33:11,054 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.35 [2019-03-28 22:33:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:11,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:11,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:11,524 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 11 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true 354.08/291.35 [2019-03-28 22:33:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:12,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:12,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:12,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:12,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:12,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:12,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:13,412 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_185 Int)) (<= 11 (+ (* 2 v_ULTIMATE.start_main_~i~0_185) c_oldRank0))) is different from true 354.08/291.35 [2019-03-28 22:33:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:13,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:13,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:14,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:14,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:14,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:14,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:15,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:15,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:15,765 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_198 Int)) (<= 11 (+ (* 2 v_ULTIMATE.start_main_~i~0_198) c_oldRank0))) is different from true 354.08/291.35 [2019-03-28 22:33:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:16,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:16,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:16,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:16,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:17,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:17,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:17,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:17,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:18,114 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_211 Int)) (<= 11 (+ (* 2 v_ULTIMATE.start_main_~i~0_211) c_oldRank0))) is different from true 354.08/291.35 [2019-03-28 22:33:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:18,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:18,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:19,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:19,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:19,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:19,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:20,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:20,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:20,470 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_224 Int)) (<= 11 (+ (* 2 v_ULTIMATE.start_main_~i~0_224) c_oldRank0))) is different from true 354.08/291.35 [2019-03-28 22:33:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:20,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:20,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:21,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:21,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:21,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:21,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:22,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:22,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:22,798 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_237 Int)) (<= 11 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_237)))) is different from true 354.08/291.35 [2019-03-28 22:33:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:23,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:23,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:23,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:23,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:24,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:24,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.35 [2019-03-28 22:33:24,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.35 [2019-03-28 22:33:24,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.35 [2019-03-28 22:33:25,124 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_250 Int)) (<= 11 (+ (* 2 v_ULTIMATE.start_main_~i~0_250) c_oldRank0))) is different from true 354.08/291.35 [2019-03-28 22:33:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:25,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:25,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:26,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:26,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:26,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:26,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:27,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:27,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:27,441 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_263 Int)) (<= 11 (+ (* 2 v_ULTIMATE.start_main_~i~0_263) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:33:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:27,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:27,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:28,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:28,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:28,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:28,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:29,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:29,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:29,757 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_276 Int)) (<= 11 (+ (* 2 v_ULTIMATE.start_main_~i~0_276) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:33:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:30,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:30,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:30,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:30,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:31,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:31,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:31,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:31,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:32,075 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_289 Int)) (<= 11 (+ (* 2 v_ULTIMATE.start_main_~i~0_289) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:33:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:32,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:32,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:32,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:32,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:32,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:32,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:32,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:32,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:32,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:32,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:32,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:32,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:32,913 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 27 predicates after loop cannibalization 354.08/291.36 [2019-03-28 22:33:32,914 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 27 loop predicates 354.08/291.36 [2019-03-28 22:33:32,914 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 84 states and 95 transitions. cyclomatic complexity: 12 Second operand 8 states. 354.08/291.36 [2019-03-28 22:33:34,304 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 84 states and 95 transitions. cyclomatic complexity: 12. Second operand 8 states. Result 1989 states and 2260 transitions. Complement of second has 672 states. 354.08/291.36 [2019-03-28 22:33:34,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 31 states 1 stem states 28 non-accepting loop states 1 accepting loop states 354.08/291.36 [2019-03-28 22:33:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 354.08/291.36 [2019-03-28 22:33:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 120 transitions. 354.08/291.36 [2019-03-28 22:33:34,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 120 transitions. Stem has 3 letters. Loop has 52 letters. 354.08/291.36 [2019-03-28 22:33:34,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.36 [2019-03-28 22:33:34,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 120 transitions. Stem has 55 letters. Loop has 52 letters. 354.08/291.36 [2019-03-28 22:33:34,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.36 [2019-03-28 22:33:34,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 120 transitions. Stem has 3 letters. Loop has 104 letters. 354.08/291.36 [2019-03-28 22:33:34,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.36 [2019-03-28 22:33:34,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1989 states and 2260 transitions. 354.08/291.36 [2019-03-28 22:33:34,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 178 354.08/291.36 [2019-03-28 22:33:34,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1989 states to 254 states and 278 transitions. 354.08/291.36 [2019-03-28 22:33:34,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 354.08/291.36 [2019-03-28 22:33:34,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 354.08/291.36 [2019-03-28 22:33:34,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 254 states and 278 transitions. 354.08/291.36 [2019-03-28 22:33:34,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.36 [2019-03-28 22:33:34,335 INFO L706 BuchiCegarLoop]: Abstraction has 254 states and 278 transitions. 354.08/291.36 [2019-03-28 22:33:34,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states and 278 transitions. 354.08/291.36 [2019-03-28 22:33:34,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 92. 354.08/291.36 [2019-03-28 22:33:34,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. 354.08/291.36 [2019-03-28 22:33:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. 354.08/291.36 [2019-03-28 22:33:34,338 INFO L729 BuchiCegarLoop]: Abstraction has 92 states and 105 transitions. 354.08/291.36 [2019-03-28 22:33:34,339 INFO L609 BuchiCegarLoop]: Abstraction has 92 states and 105 transitions. 354.08/291.36 [2019-03-28 22:33:34,339 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ 354.08/291.36 [2019-03-28 22:33:34,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 105 transitions. 354.08/291.36 [2019-03-28 22:33:34,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 354.08/291.36 [2019-03-28 22:33:34,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.36 [2019-03-28 22:33:34,340 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.36 [2019-03-28 22:33:34,340 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 354.08/291.36 [2019-03-28 22:33:34,340 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 10, 5, 1, 1] 354.08/291.36 [2019-03-28 22:33:34,341 INFO L794 eck$LassoCheckResult]: Stem: 19960#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 19961#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 19970#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 19971#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 19968#L15-1 354.08/291.36 [2019-03-28 22:33:34,342 INFO L796 eck$LassoCheckResult]: Loop: 19968#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 19962#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 19963#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 19995#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 19957#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 19964#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 19965#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 19958#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 19959#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 20044#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 20043#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 20042#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 20041#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 20040#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 20039#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 19967#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 20038#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 20037#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 20036#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 20035#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 20034#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 20033#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 20032#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 20031#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 20030#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 20029#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 20028#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 20027#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 20026#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 20025#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 20024#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 20023#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 20022#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 20021#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 20020#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 20019#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 20018#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 20017#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 20016#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 20015#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 20014#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 20013#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 20012#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 20011#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 20010#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 20009#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 20008#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 20007#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 20006#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 20005#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 20002#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 20004#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 20003#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 20001#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 20000#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 0) (<= 10 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 19997#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 19999#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 19998#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 19996#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 19969#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 19968#L15-1 354.08/291.36 [2019-03-28 22:33:34,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.36 [2019-03-28 22:33:34,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2096581, now seen corresponding path program 1 times 354.08/291.36 [2019-03-28 22:33:34,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.36 [2019-03-28 22:33:34,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.36 [2019-03-28 22:33:34,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:33:34,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:33:34,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:33:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:33:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:33:34,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.36 [2019-03-28 22:33:34,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1561934954, now seen corresponding path program 12 times 354.08/291.36 [2019-03-28 22:33:34,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.36 [2019-03-28 22:33:34,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.36 [2019-03-28 22:33:34,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:33:34,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:33:34,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:33:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:33:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:33:34,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.36 [2019-03-28 22:33:34,366 INFO L82 PathProgramCache]: Analyzing trace with hash -832136146, now seen corresponding path program 3 times 354.08/291.36 [2019-03-28 22:33:34,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.36 [2019-03-28 22:33:34,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.36 [2019-03-28 22:33:34,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:33:34,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:33:34,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:33:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:33:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:33:34,653 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 59 354.08/291.36 [2019-03-28 22:33:34,663 INFO L216 LassoAnalysis]: Preferences: 354.08/291.36 [2019-03-28 22:33:34,663 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 354.08/291.36 [2019-03-28 22:33:34,664 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 354.08/291.36 [2019-03-28 22:33:34,664 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 354.08/291.36 [2019-03-28 22:33:34,664 INFO L127 ssoRankerPreferences]: Use exernal solver: true 354.08/291.36 [2019-03-28 22:33:34,664 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.36 [2019-03-28 22:33:34,664 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 354.08/291.36 [2019-03-28 22:33:34,664 INFO L130 ssoRankerPreferences]: Path of dumped script: 354.08/291.36 [2019-03-28 22:33:34,664 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Loop 354.08/291.36 [2019-03-28 22:33:34,664 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 354.08/291.36 [2019-03-28 22:33:34,665 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 354.08/291.36 [2019-03-28 22:33:34,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:33:34,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:33:34,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:33:34,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:33:34,713 INFO L300 LassoAnalysis]: Preprocessing complete. 354.08/291.36 [2019-03-28 22:33:34,713 INFO L412 LassoAnalysis]: Checking for nontermination... 354.08/291.36 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.36 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.36 Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.36 [2019-03-28 22:33:34,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.36 [2019-03-28 22:33:34,716 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.36 [2019-03-28 22:33:34,719 INFO L445 LassoAnalysis]: Proved nontermination for one component. 354.08/291.36 [2019-03-28 22:33:34,720 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 354.08/291.36 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.36 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.36 Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.36 [2019-03-28 22:33:34,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.36 [2019-03-28 22:33:34,746 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.36 [2019-03-28 22:33:34,772 INFO L445 LassoAnalysis]: Proved nontermination for one component. 354.08/291.36 [2019-03-28 22:33:34,772 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 354.08/291.36 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.36 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.36 Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.36 [2019-03-28 22:33:34,778 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.36 [2019-03-28 22:33:34,778 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.36 [2019-03-28 22:33:34,804 INFO L445 LassoAnalysis]: Proved nontermination for one component. 354.08/291.36 [2019-03-28 22:33:34,804 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 354.08/291.36 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.36 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.36 Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.36 [2019-03-28 22:33:34,808 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.36 [2019-03-28 22:33:34,808 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.36 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.36 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.36 Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.36 [2019-03-28 22:33:34,838 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 354.08/291.36 [2019-03-28 22:33:34,838 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.36 [2019-03-28 22:33:34,842 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 354.08/291.36 [2019-03-28 22:33:34,865 INFO L216 LassoAnalysis]: Preferences: 354.08/291.36 [2019-03-28 22:33:34,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 354.08/291.36 [2019-03-28 22:33:34,866 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 354.08/291.36 [2019-03-28 22:33:34,866 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 354.08/291.36 [2019-03-28 22:33:34,866 INFO L127 ssoRankerPreferences]: Use exernal solver: false 354.08/291.36 [2019-03-28 22:33:34,866 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 354.08/291.36 [2019-03-28 22:33:34,866 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 354.08/291.36 [2019-03-28 22:33:34,866 INFO L130 ssoRankerPreferences]: Path of dumped script: 354.08/291.36 [2019-03-28 22:33:34,866 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration16_Loop 354.08/291.36 [2019-03-28 22:33:34,867 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 354.08/291.36 [2019-03-28 22:33:34,867 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 354.08/291.36 [2019-03-28 22:33:34,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:33:34,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:33:34,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:33:34,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:33:34,915 INFO L300 LassoAnalysis]: Preprocessing complete. 354.08/291.36 [2019-03-28 22:33:34,916 INFO L497 LassoAnalysis]: Using template 'affine'. 354.08/291.36 [2019-03-28 22:33:34,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.36 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.36 Number of strict supporting invariants: 0 354.08/291.36 Number of non-strict supporting invariants: 1 354.08/291.36 Consider only non-deceasing supporting invariants: true 354.08/291.36 Simplify termination arguments: true 354.08/291.36 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.36 [2019-03-28 22:33:34,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.36 [2019-03-28 22:33:34,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 354.08/291.36 [2019-03-28 22:33:34,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.36 [2019-03-28 22:33:34,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.36 [2019-03-28 22:33:34,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.36 [2019-03-28 22:33:34,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 354.08/291.36 [2019-03-28 22:33:34,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 354.08/291.36 [2019-03-28 22:33:34,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 354.08/291.36 [2019-03-28 22:33:34,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.36 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.36 Number of strict supporting invariants: 0 354.08/291.36 Number of non-strict supporting invariants: 1 354.08/291.36 Consider only non-deceasing supporting invariants: true 354.08/291.36 Simplify termination arguments: true 354.08/291.36 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.36 [2019-03-28 22:33:34,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.36 [2019-03-28 22:33:34,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.36 [2019-03-28 22:33:34,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.36 [2019-03-28 22:33:34,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.36 [2019-03-28 22:33:34,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 354.08/291.36 [2019-03-28 22:33:34,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 354.08/291.36 [2019-03-28 22:33:34,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 354.08/291.36 [2019-03-28 22:33:34,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.36 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.36 Number of strict supporting invariants: 0 354.08/291.36 Number of non-strict supporting invariants: 1 354.08/291.36 Consider only non-deceasing supporting invariants: true 354.08/291.36 Simplify termination arguments: true 354.08/291.36 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.36 [2019-03-28 22:33:34,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.36 [2019-03-28 22:33:34,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 354.08/291.36 [2019-03-28 22:33:34,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.36 [2019-03-28 22:33:34,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.36 [2019-03-28 22:33:34,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.36 [2019-03-28 22:33:34,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 354.08/291.36 [2019-03-28 22:33:34,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 354.08/291.36 [2019-03-28 22:33:34,927 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 354.08/291.36 [2019-03-28 22:33:34,928 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 354.08/291.36 [2019-03-28 22:33:34,928 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 354.08/291.36 [2019-03-28 22:33:34,929 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 354.08/291.36 [2019-03-28 22:33:34,929 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 354.08/291.36 [2019-03-28 22:33:34,929 INFO L518 LassoAnalysis]: Proved termination. 354.08/291.36 [2019-03-28 22:33:34,929 INFO L520 LassoAnalysis]: Termination argument consisting of: 354.08/291.36 Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 13 354.08/291.36 Supporting invariants [] 354.08/291.36 [2019-03-28 22:33:34,929 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 354.08/291.36 [2019-03-28 22:33:34,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.36 [2019-03-28 22:33:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:34,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:34,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:34,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:34,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 68 proven. 181 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. 354.08/291.36 [2019-03-28 22:33:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:35,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:35,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:35,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:35,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:35,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:35,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:35,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:35,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:35,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:35,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:35,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:35,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:35,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:35,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:35,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:35,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:35,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:35,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:35,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:35,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:35,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:35,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:36,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:36,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:36,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:36,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:37,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:37,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:37,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:37,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:38,280 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_398 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_398) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:33:39,179 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:33:40,512 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:33:42,290 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:33:44,500 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:33:47,138 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:33:50,223 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:33:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:50,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:50,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:50,676 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 13 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true 354.08/291.36 [2019-03-28 22:33:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:51,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:51,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:51,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:51,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:52,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:52,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:52,570 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_419 Int)) (<= 13 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_419)))) is different from true 354.08/291.36 [2019-03-28 22:33:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:53,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:53,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:53,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:53,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:54,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:54,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:54,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:54,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:54,960 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_440 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_440) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:33:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:55,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:55,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:55,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:55,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:56,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:56,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:56,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:56,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:57,329 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_461 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_461) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:33:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:57,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:57,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:58,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:58,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:58,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:58,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:33:59,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:33:59,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:33:59,697 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_482 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_482) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:34:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:00,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:00,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:00,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:00,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:01,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:01,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:01,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:01,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:02,060 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_503 Int)) (<= 13 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_503)))) is different from true 354.08/291.36 [2019-03-28 22:34:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:02,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:02,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:03,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:03,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:03,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:03,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:03,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:03,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:04,425 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_524 Int)) (<= 13 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_524)))) is different from true 354.08/291.36 [2019-03-28 22:34:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:04,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:04,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:05,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:05,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:05,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:05,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:06,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:06,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:06,813 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_545 Int)) (<= 13 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_545)))) is different from true 354.08/291.36 [2019-03-28 22:34:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:07,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:07,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:07,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:07,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:08,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:08,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:08,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:08,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:09,177 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_566 Int)) (<= 13 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_566)))) is different from true 354.08/291.36 [2019-03-28 22:34:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:09,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:09,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:10,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:10,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:10,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:10,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:11,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:11,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:11,548 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_587 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_587) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:34:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:12,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:12,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:12,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:12,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:12,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:12,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:12,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:12,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:12,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:12,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:12,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:12,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:12,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:12,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:12,518 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 35 predicates after loop cannibalization 354.08/291.36 [2019-03-28 22:34:12,519 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 35 loop predicates 354.08/291.36 [2019-03-28 22:34:12,519 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 92 states and 105 transitions. cyclomatic complexity: 15 Second operand 9 states. 354.08/291.36 [2019-03-28 22:34:16,785 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 92 states and 105 transitions. cyclomatic complexity: 15. Second operand 9 states. Result 21785 states and 25235 transitions. Complement of second has 4063 states. 354.08/291.36 [2019-03-28 22:34:16,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 56 states 1 stem states 53 non-accepting loop states 1 accepting loop states 354.08/291.36 [2019-03-28 22:34:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 354.08/291.36 [2019-03-28 22:34:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 224 transitions. 354.08/291.36 [2019-03-28 22:34:16,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 224 transitions. Stem has 4 letters. Loop has 60 letters. 354.08/291.36 [2019-03-28 22:34:16,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.36 [2019-03-28 22:34:16,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 224 transitions. Stem has 64 letters. Loop has 60 letters. 354.08/291.36 [2019-03-28 22:34:16,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.36 [2019-03-28 22:34:16,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 224 transitions. Stem has 4 letters. Loop has 120 letters. 354.08/291.36 [2019-03-28 22:34:16,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.36 [2019-03-28 22:34:16,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21785 states and 25235 transitions. 354.08/291.36 [2019-03-28 22:34:16,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 275 354.08/291.36 [2019-03-28 22:34:16,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21785 states to 564 states and 613 transitions. 354.08/291.36 [2019-03-28 22:34:16,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 354.08/291.36 [2019-03-28 22:34:16,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 354.08/291.36 [2019-03-28 22:34:16,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 564 states and 613 transitions. 354.08/291.36 [2019-03-28 22:34:16,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.36 [2019-03-28 22:34:16,959 INFO L706 BuchiCegarLoop]: Abstraction has 564 states and 613 transitions. 354.08/291.36 [2019-03-28 22:34:16,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states and 613 transitions. 354.08/291.36 [2019-03-28 22:34:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 98. 354.08/291.36 [2019-03-28 22:34:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. 354.08/291.36 [2019-03-28 22:34:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. 354.08/291.36 [2019-03-28 22:34:16,964 INFO L729 BuchiCegarLoop]: Abstraction has 98 states and 114 transitions. 354.08/291.36 [2019-03-28 22:34:16,964 INFO L609 BuchiCegarLoop]: Abstraction has 98 states and 114 transitions. 354.08/291.36 [2019-03-28 22:34:16,965 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ 354.08/291.36 [2019-03-28 22:34:16,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 114 transitions. 354.08/291.36 [2019-03-28 22:34:16,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 354.08/291.36 [2019-03-28 22:34:16,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.36 [2019-03-28 22:34:16,965 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.36 [2019-03-28 22:34:16,966 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 354.08/291.36 [2019-03-28 22:34:16,966 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 10, 7, 1, 1] 354.08/291.36 [2019-03-28 22:34:16,966 INFO L794 eck$LassoCheckResult]: Stem: 56521#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 56522#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56536#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56537#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56604#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56532#L18-1 354.08/291.36 [2019-03-28 22:34:16,967 INFO L796 eck$LassoCheckResult]: Loop: 56532#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56552#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56551#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56550#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56525#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56526#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56520#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56518#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56530#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56611#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56610#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56609#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56608#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56606#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56603#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56602#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56601#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56600#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56599#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56598#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56597#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56596#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56528#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 56595#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56594#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56593#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56592#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56591#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56590#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56589#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56588#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56587#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56586#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56585#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56584#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56583#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56582#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56581#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56580#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56579#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56578#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56577#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56576#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56575#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56574#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56573#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56572#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56571#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56570#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56569#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56568#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56567#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56566#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56565#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56564#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56563#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56562#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56559#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56561#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56560#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56558#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56557#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 0) (<= 10 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 56555#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56556#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56534#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 56554#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 56553#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 56531#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 56532#L18-1 354.08/291.36 [2019-03-28 22:34:16,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.36 [2019-03-28 22:34:16,968 INFO L82 PathProgramCache]: Analyzing trace with hash 64994063, now seen corresponding path program 2 times 354.08/291.36 [2019-03-28 22:34:16,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.36 [2019-03-28 22:34:16,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.36 [2019-03-28 22:34:16,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:34:16,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:34:16,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:34:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:34:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:34:16,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.36 [2019-03-28 22:34:16,974 INFO L82 PathProgramCache]: Analyzing trace with hash -421054900, now seen corresponding path program 13 times 354.08/291.36 [2019-03-28 22:34:16,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.36 [2019-03-28 22:34:16,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.36 [2019-03-28 22:34:16,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:34:16,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:34:16,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:34:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:34:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:34:16,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.36 [2019-03-28 22:34:16,989 INFO L82 PathProgramCache]: Analyzing trace with hash 831474266, now seen corresponding path program 4 times 354.08/291.36 [2019-03-28 22:34:16,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.36 [2019-03-28 22:34:16,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.36 [2019-03-28 22:34:16,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:34:16,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:34:16,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:34:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:34:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:34:17,404 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 65 354.08/291.36 [2019-03-28 22:34:17,414 INFO L216 LassoAnalysis]: Preferences: 354.08/291.36 [2019-03-28 22:34:17,414 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 354.08/291.36 [2019-03-28 22:34:17,414 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 354.08/291.36 [2019-03-28 22:34:17,414 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 354.08/291.36 [2019-03-28 22:34:17,414 INFO L127 ssoRankerPreferences]: Use exernal solver: true 354.08/291.36 [2019-03-28 22:34:17,414 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.36 [2019-03-28 22:34:17,415 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 354.08/291.36 [2019-03-28 22:34:17,415 INFO L130 ssoRankerPreferences]: Path of dumped script: 354.08/291.36 [2019-03-28 22:34:17,415 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Loop 354.08/291.36 [2019-03-28 22:34:17,415 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 354.08/291.36 [2019-03-28 22:34:17,415 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 354.08/291.36 [2019-03-28 22:34:17,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:34:17,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:34:17,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:34:17,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:34:17,463 INFO L300 LassoAnalysis]: Preprocessing complete. 354.08/291.36 [2019-03-28 22:34:17,463 INFO L412 LassoAnalysis]: Checking for nontermination... 354.08/291.36 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.36 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.36 Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.36 [2019-03-28 22:34:17,468 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.36 [2019-03-28 22:34:17,468 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.36 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.36 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.36 Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.36 [2019-03-28 22:34:17,499 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 354.08/291.36 [2019-03-28 22:34:17,499 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.36 [2019-03-28 22:34:17,503 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 354.08/291.36 [2019-03-28 22:34:17,527 INFO L216 LassoAnalysis]: Preferences: 354.08/291.36 [2019-03-28 22:34:17,527 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 354.08/291.36 [2019-03-28 22:34:17,527 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 354.08/291.36 [2019-03-28 22:34:17,527 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 354.08/291.36 [2019-03-28 22:34:17,527 INFO L127 ssoRankerPreferences]: Use exernal solver: false 354.08/291.36 [2019-03-28 22:34:17,527 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 354.08/291.36 [2019-03-28 22:34:17,527 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 354.08/291.36 [2019-03-28 22:34:17,528 INFO L130 ssoRankerPreferences]: Path of dumped script: 354.08/291.36 [2019-03-28 22:34:17,528 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration17_Loop 354.08/291.36 [2019-03-28 22:34:17,528 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 354.08/291.36 [2019-03-28 22:34:17,528 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 354.08/291.36 [2019-03-28 22:34:17,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:34:17,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:34:17,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:34:17,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:34:17,577 INFO L300 LassoAnalysis]: Preprocessing complete. 354.08/291.36 [2019-03-28 22:34:17,577 INFO L497 LassoAnalysis]: Using template 'affine'. 354.08/291.36 [2019-03-28 22:34:17,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.36 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.36 Number of strict supporting invariants: 0 354.08/291.36 Number of non-strict supporting invariants: 1 354.08/291.36 Consider only non-deceasing supporting invariants: true 354.08/291.36 Simplify termination arguments: true 354.08/291.36 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.36 [2019-03-28 22:34:17,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.36 [2019-03-28 22:34:17,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 354.08/291.36 [2019-03-28 22:34:17,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.36 [2019-03-28 22:34:17,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.36 [2019-03-28 22:34:17,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.36 [2019-03-28 22:34:17,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 354.08/291.36 [2019-03-28 22:34:17,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 354.08/291.36 [2019-03-28 22:34:17,580 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 354.08/291.36 [2019-03-28 22:34:17,582 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 354.08/291.36 [2019-03-28 22:34:17,582 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 354.08/291.36 [2019-03-28 22:34:17,582 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 354.08/291.36 [2019-03-28 22:34:17,582 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 354.08/291.36 [2019-03-28 22:34:17,582 INFO L518 LassoAnalysis]: Proved termination. 354.08/291.36 [2019-03-28 22:34:17,582 INFO L520 LassoAnalysis]: Termination argument consisting of: 354.08/291.36 Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 13 354.08/291.36 Supporting invariants [] 354.08/291.36 [2019-03-28 22:34:17,583 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 354.08/291.36 [2019-03-28 22:34:17,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.36 [2019-03-28 22:34:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:17,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:17,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:17,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:17,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 92 proven. 281 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. 354.08/291.36 [2019-03-28 22:34:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:17,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:17,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:17,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:17,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:17,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:17,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:17,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:17,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:18,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:18,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:18,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:18,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:18,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:18,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:18,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:18,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:18,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:18,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:18,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:18,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:18,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:18,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:18,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:18,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:18,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:18,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:18,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:18,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:18,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:18,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:19,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:19,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:19,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:19,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:19,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:19,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:19,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:19,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:20,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:20,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:20,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:20,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:21,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:21,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:22,073 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_793 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_793) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:34:22,985 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:34:24,312 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:34:26,081 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:34:28,302 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:34:30,946 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:34:34,050 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:34:37,569 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:34:41,535 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:34:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:41,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:41,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:41,986 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 13 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true 354.08/291.36 [2019-03-28 22:34:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:42,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:42,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:42,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:42,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:43,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:43,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:43,904 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_822 Int)) (<= 13 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_822)))) is different from true 354.08/291.36 [2019-03-28 22:34:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:44,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:44,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:44,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:44,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:45,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:45,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:45,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:45,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:46,305 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_851 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_851) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:34:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:46,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:46,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:47,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:47,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:47,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:47,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:48,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:48,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:48,720 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_880 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_880) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:34:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:49,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:49,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:49,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:49,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:50,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:50,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:50,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:50,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:51,114 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_909 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_909) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:34:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:51,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:51,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:52,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:52,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:52,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:52,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:53,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:53,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:53,507 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_938 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_938) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:34:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:53,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:53,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:54,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:54,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:54,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:54,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:55,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:55,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:55,899 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_967 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_967) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:34:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:56,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:56,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:56,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:56,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:57,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:57,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:57,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:57,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:58,308 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_996 Int)) (<= 13 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_996)))) is different from true 354.08/291.36 [2019-03-28 22:34:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:58,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:58,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:59,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:59,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:34:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:34:59,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:34:59,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:00,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:00,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:00,695 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1025 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_1025) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:35:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:01,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:01,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:01,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:01,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:02,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:02,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:02,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:02,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:03,094 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1054 Int)) (<= 13 (+ (* 2 v_ULTIMATE.start_main_~i~0_1054) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:35:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:03,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:03,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:03,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:03,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:35:03,944 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 354.08/291.36 [2019-03-28 22:35:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:35:03,958 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 354.08/291.36 [2019-03-28 22:35:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:03,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:03,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:04,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:04,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:04,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:04,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:04,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:04,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:04,223 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 41 predicates after loop cannibalization 354.08/291.36 [2019-03-28 22:35:04,223 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 41 loop predicates 354.08/291.36 [2019-03-28 22:35:04,224 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 98 states and 114 transitions. cyclomatic complexity: 17 Second operand 11 states. 354.08/291.36 [2019-03-28 22:35:16,599 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 98 states and 114 transitions. cyclomatic complexity: 17. Second operand 11 states. Result 169361 states and 184080 transitions. Complement of second has 24540 states. 354.08/291.36 [2019-03-28 22:35:16,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 82 states 1 stem states 79 non-accepting loop states 1 accepting loop states 354.08/291.36 [2019-03-28 22:35:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 354.08/291.36 [2019-03-28 22:35:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 313 transitions. 354.08/291.36 [2019-03-28 22:35:16,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 313 transitions. Stem has 5 letters. Loop has 68 letters. 354.08/291.36 [2019-03-28 22:35:16,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.36 [2019-03-28 22:35:16,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 313 transitions. Stem has 73 letters. Loop has 68 letters. 354.08/291.36 [2019-03-28 22:35:16,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.36 [2019-03-28 22:35:16,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 313 transitions. Stem has 5 letters. Loop has 136 letters. 354.08/291.36 [2019-03-28 22:35:16,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.36 [2019-03-28 22:35:16,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169361 states and 184080 transitions. 354.08/291.36 [2019-03-28 22:35:18,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 383 354.08/291.36 [2019-03-28 22:35:18,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169361 states to 811 states and 853 transitions. 354.08/291.36 [2019-03-28 22:35:18,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 354.08/291.36 [2019-03-28 22:35:18,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 354.08/291.36 [2019-03-28 22:35:18,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 811 states and 853 transitions. 354.08/291.36 [2019-03-28 22:35:18,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.36 [2019-03-28 22:35:18,359 INFO L706 BuchiCegarLoop]: Abstraction has 811 states and 853 transitions. 354.08/291.36 [2019-03-28 22:35:18,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states and 853 transitions. 354.08/291.36 [2019-03-28 22:35:18,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 147. 354.08/291.36 [2019-03-28 22:35:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. 354.08/291.36 [2019-03-28 22:35:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. 354.08/291.36 [2019-03-28 22:35:18,365 INFO L729 BuchiCegarLoop]: Abstraction has 147 states and 165 transitions. 354.08/291.36 [2019-03-28 22:35:18,365 INFO L609 BuchiCegarLoop]: Abstraction has 147 states and 165 transitions. 354.08/291.36 [2019-03-28 22:35:18,365 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ 354.08/291.36 [2019-03-28 22:35:18,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 165 transitions. 354.08/291.36 [2019-03-28 22:35:18,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 354.08/291.36 [2019-03-28 22:35:18,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.36 [2019-03-28 22:35:18,366 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.36 [2019-03-28 22:35:18,366 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] 354.08/291.36 [2019-03-28 22:35:18,366 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [19, 18, 18, 10, 9, 1, 1] 354.08/291.36 [2019-03-28 22:35:18,367 INFO L794 eck$LassoCheckResult]: Stem: 263835#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 263836#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263852#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263895#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263955#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263968#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263844#L12 354.08/291.36 [2019-03-28 22:35:18,368 INFO L796 eck$LassoCheckResult]: Loop: 263844#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263901#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263900#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263899#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263838#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263833#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263834#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263839#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263840#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263977#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263974#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263973#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263972#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263969#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263961#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263966#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263965#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263964#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263963#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263962#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263957#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263956#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263953#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263951#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263950#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263949#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263948#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263947#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263946#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263945#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 263944#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263943#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263942#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263941#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263940#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263939#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263938#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263937#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263936#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263935#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263934#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263933#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263932#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263931#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263930#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263929#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263928#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263927#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263926#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263925#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263924#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263923#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263922#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263921#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263920#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263919#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263918#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263917#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263916#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263915#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263914#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263913#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263912#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263911#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263908#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263910#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263909#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263907#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263906#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 0) (<= 10 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 263903#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263905#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263904#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263846#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 263902#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 263842#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 263843#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 263844#L12 354.08/291.36 [2019-03-28 22:35:18,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.36 [2019-03-28 22:35:18,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2014815994, now seen corresponding path program 3 times 354.08/291.36 [2019-03-28 22:35:18,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.36 [2019-03-28 22:35:18,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.36 [2019-03-28 22:35:18,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:35:18,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:35:18,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:35:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:35:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:35:18,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.36 [2019-03-28 22:35:18,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1944147330, now seen corresponding path program 14 times 354.08/291.36 [2019-03-28 22:35:18,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.36 [2019-03-28 22:35:18,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.36 [2019-03-28 22:35:18,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:35:18,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:35:18,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:35:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:35:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:35:18,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.36 [2019-03-28 22:35:18,389 INFO L82 PathProgramCache]: Analyzing trace with hash -128383237, now seen corresponding path program 5 times 354.08/291.36 [2019-03-28 22:35:18,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.36 [2019-03-28 22:35:18,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.36 [2019-03-28 22:35:18,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:35:18,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:35:18,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:35:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:35:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:35:18,790 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 71 354.08/291.36 [2019-03-28 22:35:18,799 INFO L216 LassoAnalysis]: Preferences: 354.08/291.36 [2019-03-28 22:35:18,799 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 354.08/291.36 [2019-03-28 22:35:18,799 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 354.08/291.36 [2019-03-28 22:35:18,800 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 354.08/291.36 [2019-03-28 22:35:18,800 INFO L127 ssoRankerPreferences]: Use exernal solver: true 354.08/291.36 [2019-03-28 22:35:18,800 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.36 [2019-03-28 22:35:18,800 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 354.08/291.36 [2019-03-28 22:35:18,800 INFO L130 ssoRankerPreferences]: Path of dumped script: 354.08/291.36 [2019-03-28 22:35:18,800 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration18_Loop 354.08/291.36 [2019-03-28 22:35:18,800 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 354.08/291.36 [2019-03-28 22:35:18,800 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 354.08/291.36 [2019-03-28 22:35:18,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:35:18,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:35:18,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:35:18,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:35:18,850 INFO L300 LassoAnalysis]: Preprocessing complete. 354.08/291.36 [2019-03-28 22:35:18,850 INFO L412 LassoAnalysis]: Checking for nontermination... 354.08/291.36 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.36 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.36 Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.36 [2019-03-28 22:35:18,854 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.36 [2019-03-28 22:35:18,854 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.36 [2019-03-28 22:35:18,881 INFO L445 LassoAnalysis]: Proved nontermination for one component. 354.08/291.36 [2019-03-28 22:35:18,881 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 354.08/291.36 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.36 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.36 Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.36 [2019-03-28 22:35:18,885 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 354.08/291.36 [2019-03-28 22:35:18,885 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.36 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 354.08/291.36 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 354.08/291.36 Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 354.08/291.36 [2019-03-28 22:35:18,915 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 354.08/291.36 [2019-03-28 22:35:18,915 INFO L163 nArgumentSynthesizer]: Using integer mode. 354.08/291.36 [2019-03-28 22:35:18,919 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 354.08/291.36 [2019-03-28 22:35:18,942 INFO L216 LassoAnalysis]: Preferences: 354.08/291.36 [2019-03-28 22:35:18,942 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 354.08/291.36 [2019-03-28 22:35:18,942 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 354.08/291.36 [2019-03-28 22:35:18,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 354.08/291.36 [2019-03-28 22:35:18,943 INFO L127 ssoRankerPreferences]: Use exernal solver: false 354.08/291.36 [2019-03-28 22:35:18,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 354.08/291.36 [2019-03-28 22:35:18,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 354.08/291.36 [2019-03-28 22:35:18,943 INFO L130 ssoRankerPreferences]: Path of dumped script: 354.08/291.36 [2019-03-28 22:35:18,943 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration18_Loop 354.08/291.36 [2019-03-28 22:35:18,943 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 354.08/291.36 [2019-03-28 22:35:18,943 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 354.08/291.36 [2019-03-28 22:35:18,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:35:18,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:35:18,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:35:18,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 354.08/291.36 [2019-03-28 22:35:18,993 INFO L300 LassoAnalysis]: Preprocessing complete. 354.08/291.36 [2019-03-28 22:35:18,993 INFO L497 LassoAnalysis]: Using template 'affine'. 354.08/291.36 [2019-03-28 22:35:18,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.36 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.36 Number of strict supporting invariants: 0 354.08/291.36 Number of non-strict supporting invariants: 1 354.08/291.36 Consider only non-deceasing supporting invariants: true 354.08/291.36 Simplify termination arguments: true 354.08/291.36 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.36 [2019-03-28 22:35:18,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.36 [2019-03-28 22:35:18,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.36 [2019-03-28 22:35:18,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.36 [2019-03-28 22:35:18,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.36 [2019-03-28 22:35:18,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 354.08/291.36 [2019-03-28 22:35:18,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 354.08/291.36 [2019-03-28 22:35:18,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 354.08/291.36 [2019-03-28 22:35:18,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 354.08/291.36 Termination analysis: LINEAR_WITH_GUESSES 354.08/291.36 Number of strict supporting invariants: 0 354.08/291.36 Number of non-strict supporting invariants: 1 354.08/291.36 Consider only non-deceasing supporting invariants: true 354.08/291.36 Simplify termination arguments: true 354.08/291.36 Simplify supporting invariants: trueOverapproximate stem: false 354.08/291.36 [2019-03-28 22:35:18,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. 354.08/291.36 [2019-03-28 22:35:18,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 354.08/291.36 [2019-03-28 22:35:18,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 354.08/291.36 [2019-03-28 22:35:18,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 354.08/291.36 [2019-03-28 22:35:18,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 354.08/291.36 [2019-03-28 22:35:18,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 354.08/291.36 [2019-03-28 22:35:18,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 354.08/291.36 [2019-03-28 22:35:19,000 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 354.08/291.36 [2019-03-28 22:35:19,001 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 354.08/291.36 [2019-03-28 22:35:19,001 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 354.08/291.36 [2019-03-28 22:35:19,002 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 354.08/291.36 [2019-03-28 22:35:19,002 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 354.08/291.36 [2019-03-28 22:35:19,002 INFO L518 LassoAnalysis]: Proved termination. 354.08/291.36 [2019-03-28 22:35:19,002 INFO L520 LassoAnalysis]: Termination argument consisting of: 354.08/291.36 Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 15 354.08/291.36 Supporting invariants [] 354.08/291.36 [2019-03-28 22:35:19,002 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 354.08/291.36 [2019-03-28 22:35:19,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.36 [2019-03-28 22:35:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:19,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:19,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:19,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:19,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 120 proven. 393 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. 354.08/291.36 [2019-03-28 22:35:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:19,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:19,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:19,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:19,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:19,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:19,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:19,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:19,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:19,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:19,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:19,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:19,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:19,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:19,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:19,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:19,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:19,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:19,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:19,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:19,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:20,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:20,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:20,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:20,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:20,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:20,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:20,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:20,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:20,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:20,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:20,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:20,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:20,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:20,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:20,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:20,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:20,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:20,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:21,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:21,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:21,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:21,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:21,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:21,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:21,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:21,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:21,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:21,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:21,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:21,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:21,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:21,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:23,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:23,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:24,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:24,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:25,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:25,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:26,166 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1377 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_1377) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:35:27,080 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:35:28,428 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:35:30,205 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:35:32,414 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:35:35,053 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:35:38,149 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:35:41,693 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:35:45,673 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:35:50,075 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 11 354.08/291.36 [2019-03-28 22:35:54,922 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 12 354.08/291.36 [2019-03-28 22:35:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:54,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:54,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:55,376 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~i~0 Int)) (<= 15 (+ c_oldRank0 (* 2 ULTIMATE.start_main_~i~0)))) is different from true 354.08/291.36 [2019-03-28 22:35:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:55,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:55,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:56,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:56,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:56,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:56,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:57,407 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1414 Int)) (<= 15 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_1414)))) is different from true 354.08/291.36 [2019-03-28 22:35:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:57,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:57,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:58,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:58,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:58,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:58,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:35:59,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:35:59,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:35:59,834 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1451 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_1451) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:36:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:00,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:00,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:00,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:00,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:01,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:01,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:01,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:01,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:02,261 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1488 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_1488) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:36:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:02,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:02,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:03,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:03,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:03,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:03,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:04,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:04,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:04,686 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1525 Int)) (<= 15 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_1525)))) is different from true 354.08/291.36 [2019-03-28 22:36:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:05,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:05,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:05,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:05,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:06,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:06,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:06,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:06,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:07,122 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1562 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_1562) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:36:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:07,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:07,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:08,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:08,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:08,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:08,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:09,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:09,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:09,547 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1599 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_1599) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:36:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:10,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:10,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:10,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:10,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:11,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:11,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:11,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:11,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:11,989 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1636 Int)) (<= 15 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_1636)))) is different from true 354.08/291.36 [2019-03-28 22:36:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:12,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:12,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:12,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:12,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:13,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:13,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:13,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:13,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:14,402 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1673 Int)) (<= 15 (+ (* 2 v_ULTIMATE.start_main_~i~0_1673) c_oldRank0))) is different from true 354.08/291.36 [2019-03-28 22:36:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:14,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:14,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:15,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:15,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:15,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:15,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:16,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:16,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:16,814 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~i~0_1710 Int)) (<= 15 (+ c_oldRank0 (* 2 v_ULTIMATE.start_main_~i~0_1710)))) is different from true 354.08/291.36 [2019-03-28 22:36:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:17,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:17,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:17,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:17,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:36:17,867 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 354.08/291.36 [2019-03-28 22:36:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:36:17,883 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 354.08/291.36 [2019-03-28 22:36:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:36:17,898 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 354.08/291.36 [2019-03-28 22:36:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:36:17,914 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 354.08/291.36 [2019-03-28 22:36:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:36:17,930 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 354.08/291.36 [2019-03-28 22:36:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:36:17,946 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 354.08/291.36 [2019-03-28 22:36:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 354.08/291.36 [2019-03-28 22:36:17,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core 354.08/291.36 [2019-03-28 22:36:17,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... 354.08/291.36 [2019-03-28 22:36:17,991 INFO L98 LoopCannibalizer]: 12 predicates before loop cannibalization 47 predicates after loop cannibalization 354.08/291.36 [2019-03-28 22:36:17,991 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 47 loop predicates 354.08/291.36 [2019-03-28 22:36:17,991 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 147 states and 165 transitions. cyclomatic complexity: 20 Second operand 14 states. 354.08/291.36 [2019-03-28 22:37:16,823 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 147 states and 165 transitions. cyclomatic complexity: 20. Second operand 14 states. Result 574972 states and 623934 transitions. Complement of second has 243375 states. 354.08/291.36 [2019-03-28 22:37:16,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 142 states 1 stem states 132 non-accepting loop states 8 accepting loop states 354.08/291.36 [2019-03-28 22:37:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 354.08/291.36 [2019-03-28 22:37:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 485 transitions. 354.08/291.36 [2019-03-28 22:37:16,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 142 states and 485 transitions. Stem has 6 letters. Loop has 76 letters. 354.08/291.36 [2019-03-28 22:37:16,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.36 [2019-03-28 22:37:16,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 142 states and 485 transitions. Stem has 82 letters. Loop has 76 letters. 354.08/291.36 [2019-03-28 22:37:16,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.36 [2019-03-28 22:37:16,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 142 states and 485 transitions. Stem has 6 letters. Loop has 152 letters. 354.08/291.36 [2019-03-28 22:37:16,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. 354.08/291.36 [2019-03-28 22:37:16,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 574972 states and 623934 transitions. 354.08/291.36 [2019-03-28 22:37:18,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 280 354.08/291.36 [2019-03-28 22:37:18,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 574972 states to 609 states and 629 transitions. 354.08/291.36 [2019-03-28 22:37:18,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 354.08/291.36 [2019-03-28 22:37:18,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 354.08/291.36 [2019-03-28 22:37:18,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 609 states and 629 transitions. 354.08/291.36 [2019-03-28 22:37:18,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 354.08/291.36 [2019-03-28 22:37:18,803 INFO L706 BuchiCegarLoop]: Abstraction has 609 states and 629 transitions. 354.08/291.36 [2019-03-28 22:37:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states and 629 transitions. 354.08/291.36 [2019-03-28 22:37:18,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 101. 354.08/291.36 [2019-03-28 22:37:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. 354.08/291.36 [2019-03-28 22:37:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. 354.08/291.36 [2019-03-28 22:37:18,808 INFO L729 BuchiCegarLoop]: Abstraction has 101 states and 112 transitions. 354.08/291.36 [2019-03-28 22:37:18,808 INFO L609 BuchiCegarLoop]: Abstraction has 101 states and 112 transitions. 354.08/291.36 [2019-03-28 22:37:18,808 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ 354.08/291.36 [2019-03-28 22:37:18,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 112 transitions. 354.08/291.36 [2019-03-28 22:37:18,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 354.08/291.36 [2019-03-28 22:37:18,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 354.08/291.36 [2019-03-28 22:37:18,809 INFO L119 BuchiIsEmpty]: Starting construction of run 354.08/291.36 [2019-03-28 22:37:18,809 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] 354.08/291.36 [2019-03-28 22:37:18,810 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] 354.08/291.36 [2019-03-28 22:37:18,810 INFO L794 eck$LassoCheckResult]: Stem: 1098268#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~up~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~up~0, ULTIMATE.start_main_~i~0] 1098269#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098280#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098281#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098360#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098359#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098358#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098285#L12-2 354.08/291.36 [2019-03-28 22:37:18,811 INFO L796 eck$LassoCheckResult]: Loop: 1098285#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098288#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098287#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098274#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098266#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098267#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098357#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098275#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098276#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098278#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098272#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098273#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098356#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098355#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098354#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098353#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098348#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098347#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098346#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098345#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098344#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098343#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098342#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098339#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098338#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098337#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098336#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098335#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098334#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098333#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098332#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098331#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098330#L12-2 [36] L12-2-->L15-1: Formula: (and (<= v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~up~0_7 1)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1098329#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098328#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098327#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098326#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098325#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098324#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098323#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098322#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098321#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098320#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098319#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098318#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098317#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098316#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098315#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098314#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098313#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098312#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098311#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098310#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098309#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098308#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098307#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098306#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098305#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098304#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098303#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098302#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098301#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098300#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098299#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098298#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098297#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098296#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098295#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098294#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098293#L15-1 [45] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1)) (<= 1 v_ULTIMATE.start_main_~up~0_8)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098292#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098291#L12 [42] L12-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~up~0_6 0) (<= 10 v_ULTIMATE.start_main_~i~0_8)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0] 1098283#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098290#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098289#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098286#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098279#L12-2 [51] L12-2-->L15-1: Formula: (> v_ULTIMATE.start_main_~i~0_11 0) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1098277#L15-1 [52] L15-1-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_14 (+ v_ULTIMATE.start_main_~i~0_15 (- 1))) (> 1 v_ULTIMATE.start_main_~up~0_9)) InVars {ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15} OutVars{ULTIMATE.start_main_~up~0=v_ULTIMATE.start_main_~up~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1098270#L18-1 [41] L18-1-->L12: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 10) (<= 0 v_ULTIMATE.start_main_~i~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 1098271#L12 [50] L12-->L12-2: Formula: (> 10 v_ULTIMATE.start_main_~i~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 1098285#L12-2 354.08/291.36 [2019-03-28 22:37:18,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.36 [2019-03-28 22:37:18,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1965213576, now seen corresponding path program 4 times 354.08/291.36 [2019-03-28 22:37:18,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.36 [2019-03-28 22:37:18,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.36 [2019-03-28 22:37:18,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:37:18,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:37:18,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:37:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:37:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:37:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.36 [2019-03-28 22:37:18,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2093134442, now seen corresponding path program 15 times 354.08/291.36 [2019-03-28 22:37:18,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.36 [2019-03-28 22:37:18,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.36 [2019-03-28 22:37:18,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:37:18,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:37:18,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:37:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:37:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:37:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 354.08/291.36 [2019-03-28 22:37:18,841 INFO L82 PathProgramCache]: Analyzing trace with hash 685171937, now seen corresponding path program 6 times 354.08/291.36 [2019-03-28 22:37:18,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 354.08/291.36 [2019-03-28 22:37:18,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 354.08/291.36 [2019-03-28 22:37:18,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:37:18,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:37:18,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 354.08/291.36 [2019-03-28 22:37:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:37:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 354.08/291.36 [2019-03-28 22:37:19,307 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 74 354.08/291.36 [2019-03-28 22:37:19,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:37:19 BasicIcfg 354.08/291.36 [2019-03-28 22:37:19,368 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 354.08/291.36 [2019-03-28 22:37:19,369 INFO L168 Benchmark]: Toolchain (without parser) took 287044.65 ms. Allocated memory was 649.6 MB in the beginning and 7.3 GB in the end (delta: 6.6 GB). Free memory was 564.9 MB in the beginning and 1.9 GB in the end (delta: -1.3 GB). Peak memory consumption was 5.3 GB. Max. memory is 50.3 GB. 354.08/291.36 [2019-03-28 22:37:19,370 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 354.08/291.36 [2019-03-28 22:37:19,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.61 ms. Allocated memory was 649.6 MB in the beginning and 662.2 MB in the end (delta: 12.6 MB). Free memory was 564.9 MB in the beginning and 629.6 MB in the end (delta: -64.7 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 354.08/291.36 [2019-03-28 22:37:19,370 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.22 ms. Allocated memory is still 662.2 MB. Free memory was 629.6 MB in the beginning and 628.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 354.08/291.36 [2019-03-28 22:37:19,371 INFO L168 Benchmark]: Boogie Preprocessor took 19.24 ms. Allocated memory is still 662.2 MB. Free memory was 628.3 MB in the beginning and 625.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 354.08/291.36 [2019-03-28 22:37:19,371 INFO L168 Benchmark]: RCFGBuilder took 195.96 ms. Allocated memory is still 662.2 MB. Free memory was 625.2 MB in the beginning and 612.3 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 50.3 GB. 354.08/291.36 [2019-03-28 22:37:19,372 INFO L168 Benchmark]: BlockEncodingV2 took 73.96 ms. Allocated memory is still 662.2 MB. Free memory was 612.3 MB in the beginning and 606.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 354.08/291.36 [2019-03-28 22:37:19,372 INFO L168 Benchmark]: TraceAbstraction took 153.48 ms. Allocated memory is still 662.2 MB. Free memory was 606.9 MB in the beginning and 597.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 354.08/291.36 [2019-03-28 22:37:19,373 INFO L168 Benchmark]: BuchiAutomizer took 286285.98 ms. Allocated memory was 662.2 MB in the beginning and 7.3 GB in the end (delta: 6.6 GB). Free memory was 597.4 MB in the beginning and 1.9 GB in the end (delta: -1.3 GB). Peak memory consumption was 5.3 GB. Max. memory is 50.3 GB. 354.08/291.36 [2019-03-28 22:37:19,376 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 354.08/291.36 --- Results --- 354.08/291.36 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 354.08/291.36 - StatisticsResult: Initial Icfg 354.08/291.36 9 locations, 13 edges 354.08/291.36 - StatisticsResult: Encoded RCFG 354.08/291.36 5 locations, 8 edges 354.08/291.36 * Results from de.uni_freiburg.informatik.ultimate.core: 354.08/291.36 - StatisticsResult: Toolchain Benchmarks 354.08/291.36 Benchmark results are: 354.08/291.36 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 354.08/291.36 * CACSL2BoogieTranslator took 276.61 ms. Allocated memory was 649.6 MB in the beginning and 662.2 MB in the end (delta: 12.6 MB). Free memory was 564.9 MB in the beginning and 629.6 MB in the end (delta: -64.7 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 354.08/291.36 * Boogie Procedure Inliner took 34.22 ms. Allocated memory is still 662.2 MB. Free memory was 629.6 MB in the beginning and 628.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 354.08/291.36 * Boogie Preprocessor took 19.24 ms. Allocated memory is still 662.2 MB. Free memory was 628.3 MB in the beginning and 625.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 354.08/291.36 * RCFGBuilder took 195.96 ms. Allocated memory is still 662.2 MB. Free memory was 625.2 MB in the beginning and 612.3 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 50.3 GB. 354.08/291.36 * BlockEncodingV2 took 73.96 ms. Allocated memory is still 662.2 MB. Free memory was 612.3 MB in the beginning and 606.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 354.08/291.36 * TraceAbstraction took 153.48 ms. Allocated memory is still 662.2 MB. Free memory was 606.9 MB in the beginning and 597.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 354.08/291.36 * BuchiAutomizer took 286285.98 ms. Allocated memory was 662.2 MB in the beginning and 7.3 GB in the end (delta: 6.6 GB). Free memory was 597.4 MB in the beginning and 1.9 GB in the end (delta: -1.3 GB). Peak memory consumption was 5.3 GB. Max. memory is 50.3 GB. 354.08/291.36 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 354.08/291.36 - AllSpecificationsHoldResult: All specifications hold 354.08/291.36 We were not able to verify any specifiation because the program does not contain any specification. 354.08/291.36 - InvariantResult [Line: 11]: Loop Invariant 354.08/291.36 Derived loop invariant: 1 354.08/291.36 - StatisticsResult: Ultimate Automizer benchmark data 354.08/291.36 CFG has 1 procedures, 5 locations, 0 error locations. SAFE Result, 0.0s 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=5occurred 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, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 354.08/291.36 - StatisticsResult: Constructed decomposition of program 354.08/291.36 Your program was decomposed into 19 terminating modules (11 trivial, 0 deterministic, 8 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function i and consists of 10 locations. One nondeterministic module has affine ranking function i and consists of 10 locations. One nondeterministic module has affine ranking function -2 * i + 19 and consists of 6 locations. One nondeterministic module has affine ranking function -2 * i + 9 and consists of 13 locations. One nondeterministic module has affine ranking function -2 * i + 11 and consists of 31 locations. One nondeterministic module has affine ranking function -2 * i + 13 and consists of 56 locations. One nondeterministic module has affine ranking function -2 * i + 13 and consists of 82 locations. One nondeterministic module has affine ranking function -2 * i + 15 and consists of 142 locations. 11 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 101 locations. 354.08/291.36 - StatisticsResult: Timing statistics 354.08/291.36 BüchiAutomizer plugin needed 286.2s and 19 iterations. TraceHistogramMax:20. Analysis of lassos took 5.9s. Construction of modules took 3.4s. Büchi inclusion checks took 272.6s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 19. Automata minimization 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 2127 StatesRemovedByMinimization, 19 NontrivialMinimizations. Non-live state removal took 3.9s Buchi closure took 0.0s. Biggest automaton had 147 states and ocurred in iteration 17. Nontrivial modules had stage [8, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1213/2180 HoareTripleCheckerStatistics: 86 SDtfs, 1127 SDslu, 6 SDs, 0 SdLazy, 3169 SolverSat, 612 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT7 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax166 hnf100 lsp45 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq123 hnf97 smp96 dnf100 smp100 tf113 neg100 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s 354.08/291.36 - TerminationAnalysisResult: Nontermination possible 354.08/291.36 Buchi Automizer proved that your program is nonterminating for some inputs 354.08/291.36 - FixpointNonTerminationResult [Line: 15]: Nontermination argument in form of an infinite program execution. 354.08/291.36 Nontermination argument in form of an infinite execution 354.08/291.36 State at position 0 is 354.08/291.36 {} 354.08/291.36 State at position 1 is 354.08/291.36 {up=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@151fd67e=0, \result=0, i=8} 354.08/291.36 - StatisticsResult: NonterminationArgumentStatistics 354.08/291.36 Fixpoint 354.08/291.36 - NonterminatingLassoResult [Line: 11]: Nonterminating execution 354.08/291.36 Found a nonterminating execution for the following lasso shaped sequence of statements. 354.08/291.36 Stem: 354.08/291.36 [L6] int i; 354.08/291.36 [L7] int up; 354.08/291.36 [L8] i = __VERIFIER_nondet_int() 354.08/291.36 [L9] up = 0 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND FALSE !(up >= 1) 354.08/291.36 [L21] i = i-1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 Loop: 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND FALSE !(up >= 1) 354.08/291.36 [L21] i = i-1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND FALSE !(up >= 1) 354.08/291.36 [L21] i = i-1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND FALSE !(up >= 1) 354.08/291.36 [L21] i = i-1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND FALSE !(up >= 1) 354.08/291.36 [L21] i = i-1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND FALSE !(up >= 1) 354.08/291.36 [L21] i = i-1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND FALSE !(up >= 1) 354.08/291.36 [L21] i = i-1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND FALSE !(up >= 1) 354.08/291.36 [L21] i = i-1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND FALSE !(up >= 1) 354.08/291.36 [L21] i = i-1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND TRUE i <= 0 354.08/291.36 [L16] up = 1 354.08/291.36 [L18] COND TRUE up >= 1 354.08/291.36 [L19] i = i+1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND TRUE up >= 1 354.08/291.36 [L19] i = i+1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND TRUE up >= 1 354.08/291.36 [L19] i = i+1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND TRUE up >= 1 354.08/291.36 [L19] i = i+1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND TRUE up >= 1 354.08/291.36 [L19] i = i+1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND TRUE up >= 1 354.08/291.36 [L19] i = i+1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND TRUE up >= 1 354.08/291.36 [L19] i = i+1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND TRUE up >= 1 354.08/291.36 [L19] i = i+1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND TRUE up >= 1 354.08/291.36 [L19] i = i+1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND TRUE up >= 1 354.08/291.36 [L19] i = i+1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND TRUE i >= 10 354.08/291.36 [L13] up = 0 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND FALSE !(up >= 1) 354.08/291.36 [L21] i = i-1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 [L15] COND FALSE !(i <= 0) 354.08/291.36 [L18] COND FALSE !(up >= 1) 354.08/291.36 [L21] i = i-1 354.08/291.36 [L11] COND TRUE 0 <= i && i <= 10 354.08/291.36 [L12] COND FALSE !(i >= 10) 354.08/291.36 End of lasso representation. 354.08/291.36 RESULT: Ultimate proved your program to be incorrect! 354.08/291.36 !SESSION 2019-03-28 22:32:29.056 ----------------------------------------------- 354.08/291.36 eclipse.buildId=unknown 354.08/291.36 java.version=1.8.0_181 354.08/291.36 java.vendor=Oracle Corporation 354.08/291.36 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 354.08/291.36 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 354.08/291.36 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 354.08/291.36 354.08/291.36 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 22:37:19.620 354.08/291.36 !MESSAGE The workspace will exit with unsaved changes in this session. 354.08/291.36 Received shutdown request... 354.08/291.36 Ultimate: 354.08/291.36 GTK+ Version Check 354.08/291.36 EOF