18.02/8.40 YES 18.02/8.40 18.02/8.40 Ultimate: Cannot open display: 18.02/8.40 This is Ultimate 0.1.24-8dc7c08-m 18.02/8.40 [2019-03-28 22:51:31,691 INFO L170 SettingsManager]: Resetting all preferences to default values... 18.02/8.40 [2019-03-28 22:51:31,693 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 18.02/8.40 [2019-03-28 22:51:31,705 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 18.02/8.40 [2019-03-28 22:51:31,705 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 18.02/8.40 [2019-03-28 22:51:31,706 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 18.02/8.40 [2019-03-28 22:51:31,707 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 18.02/8.40 [2019-03-28 22:51:31,709 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 18.02/8.40 [2019-03-28 22:51:31,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 18.02/8.40 [2019-03-28 22:51:31,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 18.02/8.40 [2019-03-28 22:51:31,712 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 18.02/8.40 [2019-03-28 22:51:31,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 18.02/8.40 [2019-03-28 22:51:31,713 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 18.02/8.40 [2019-03-28 22:51:31,714 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 18.02/8.40 [2019-03-28 22:51:31,715 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 18.02/8.40 [2019-03-28 22:51:31,715 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 18.02/8.40 [2019-03-28 22:51:31,716 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 18.02/8.40 [2019-03-28 22:51:31,718 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 18.02/8.40 [2019-03-28 22:51:31,720 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 18.02/8.40 [2019-03-28 22:51:31,721 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 18.02/8.40 [2019-03-28 22:51:31,722 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 18.02/8.40 [2019-03-28 22:51:31,724 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 18.02/8.40 [2019-03-28 22:51:31,726 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 18.02/8.40 [2019-03-28 22:51:31,726 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 18.02/8.40 [2019-03-28 22:51:31,726 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 18.02/8.40 [2019-03-28 22:51:31,727 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 18.02/8.40 [2019-03-28 22:51:31,727 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 18.02/8.40 [2019-03-28 22:51:31,728 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 18.02/8.40 [2019-03-28 22:51:31,728 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 18.02/8.40 [2019-03-28 22:51:31,729 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 18.02/8.40 [2019-03-28 22:51:31,730 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 18.02/8.40 [2019-03-28 22:51:31,731 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 18.02/8.40 [2019-03-28 22:51:31,732 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 18.02/8.40 [2019-03-28 22:51:31,732 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 18.02/8.40 [2019-03-28 22:51:31,732 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 18.02/8.40 [2019-03-28 22:51:31,733 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 18.02/8.40 [2019-03-28 22:51:31,733 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 18.02/8.40 [2019-03-28 22:51:31,734 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 18.02/8.40 [2019-03-28 22:51:31,734 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 18.02/8.40 [2019-03-28 22:51:31,735 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 18.02/8.40 [2019-03-28 22:51:31,749 INFO L110 SettingsManager]: Loading preferences was successful 18.02/8.40 [2019-03-28 22:51:31,749 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 18.02/8.40 [2019-03-28 22:51:31,750 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 18.02/8.40 [2019-03-28 22:51:31,751 INFO L133 SettingsManager]: * Rewrite not-equals=true 18.02/8.40 [2019-03-28 22:51:31,751 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 18.02/8.40 [2019-03-28 22:51:31,751 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 18.02/8.40 [2019-03-28 22:51:31,751 INFO L133 SettingsManager]: * Use SBE=true 18.02/8.40 [2019-03-28 22:51:31,751 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 18.02/8.40 [2019-03-28 22:51:31,752 INFO L133 SettingsManager]: * Use old map elimination=false 18.02/8.40 [2019-03-28 22:51:31,752 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 18.02/8.40 [2019-03-28 22:51:31,752 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 18.02/8.40 [2019-03-28 22:51:31,752 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 18.02/8.40 [2019-03-28 22:51:31,752 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 18.02/8.40 [2019-03-28 22:51:31,752 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 18.02/8.40 [2019-03-28 22:51:31,753 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.02/8.40 [2019-03-28 22:51:31,753 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 18.02/8.40 [2019-03-28 22:51:31,753 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 18.02/8.40 [2019-03-28 22:51:31,753 INFO L133 SettingsManager]: * Check division by zero=IGNORE 18.02/8.40 [2019-03-28 22:51:31,753 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 18.02/8.40 [2019-03-28 22:51:31,753 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 18.02/8.40 [2019-03-28 22:51:31,754 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 18.02/8.40 [2019-03-28 22:51:31,754 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 18.02/8.40 [2019-03-28 22:51:31,754 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 18.02/8.40 [2019-03-28 22:51:31,754 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 18.02/8.40 [2019-03-28 22:51:31,754 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 18.02/8.40 [2019-03-28 22:51:31,755 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 18.02/8.40 [2019-03-28 22:51:31,755 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 18.02/8.40 [2019-03-28 22:51:31,755 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 18.02/8.40 [2019-03-28 22:51:31,755 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 18.02/8.40 [2019-03-28 22:51:31,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 18.02/8.40 [2019-03-28 22:51:31,795 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 18.02/8.40 [2019-03-28 22:51:31,799 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 18.02/8.40 [2019-03-28 22:51:31,801 INFO L271 PluginConnector]: Initializing CDTParser... 18.02/8.40 [2019-03-28 22:51:31,801 INFO L276 PluginConnector]: CDTParser initialized 18.02/8.40 [2019-03-28 22:51:31,802 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 18.02/8.40 [2019-03-28 22:51:31,872 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/7ca6e371332b477ea1f55caa41561549/FLAGee0cd6884 18.02/8.40 [2019-03-28 22:51:32,213 INFO L307 CDTParser]: Found 1 translation units. 18.02/8.40 [2019-03-28 22:51:32,214 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 18.02/8.40 [2019-03-28 22:51:32,221 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/7ca6e371332b477ea1f55caa41561549/FLAGee0cd6884 18.02/8.40 [2019-03-28 22:51:32,618 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/7ca6e371332b477ea1f55caa41561549 18.02/8.40 [2019-03-28 22:51:32,630 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 18.02/8.40 [2019-03-28 22:51:32,631 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 18.02/8.40 [2019-03-28 22:51:32,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 18.02/8.40 [2019-03-28 22:51:32,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 18.02/8.40 [2019-03-28 22:51:32,636 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 18.02/8.40 [2019-03-28 22:51:32,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:51:32" (1/1) ... 18.02/8.40 [2019-03-28 22:51:32,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1e942c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:51:32, skipping insertion in model container 18.02/8.40 [2019-03-28 22:51:32,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:51:32" (1/1) ... 18.02/8.40 [2019-03-28 22:51:32,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 18.02/8.40 [2019-03-28 22:51:32,666 INFO L176 MainTranslator]: Built tables and reachable declarations 18.02/8.40 [2019-03-28 22:51:32,819 INFO L206 PostProcessor]: Analyzing one entry point: main 18.02/8.40 [2019-03-28 22:51:32,823 INFO L191 MainTranslator]: Completed pre-run 18.02/8.40 [2019-03-28 22:51:32,839 INFO L206 PostProcessor]: Analyzing one entry point: main 18.02/8.40 [2019-03-28 22:51:32,909 INFO L195 MainTranslator]: Completed translation 18.02/8.40 [2019-03-28 22:51:32,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:51:32 WrapperNode 18.02/8.40 [2019-03-28 22:51:32,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 18.02/8.40 [2019-03-28 22:51:32,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 18.02/8.40 [2019-03-28 22:51:32,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 18.02/8.40 [2019-03-28 22:51:32,911 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 18.02/8.40 [2019-03-28 22:51:32,920 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:51:32" (1/1) ... 18.02/8.40 [2019-03-28 22:51:32,926 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:51:32" (1/1) ... 18.02/8.40 [2019-03-28 22:51:32,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 18.02/8.40 [2019-03-28 22:51:32,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 18.02/8.40 [2019-03-28 22:51:32,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 18.02/8.40 [2019-03-28 22:51:32,946 INFO L276 PluginConnector]: Boogie Preprocessor initialized 18.02/8.40 [2019-03-28 22:51:32,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:51:32" (1/1) ... 18.02/8.40 [2019-03-28 22:51:32,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:51:32" (1/1) ... 18.02/8.40 [2019-03-28 22:51:32,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:51:32" (1/1) ... 18.02/8.40 [2019-03-28 22:51:32,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:51:32" (1/1) ... 18.02/8.40 [2019-03-28 22:51:32,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:51:32" (1/1) ... 18.02/8.40 [2019-03-28 22:51:32,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:51:32" (1/1) ... 18.02/8.40 [2019-03-28 22:51:32,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:51:32" (1/1) ... 18.02/8.40 [2019-03-28 22:51:32,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 18.02/8.40 [2019-03-28 22:51:32,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 18.02/8.40 [2019-03-28 22:51:32,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... 18.02/8.40 [2019-03-28 22:51:32,966 INFO L276 PluginConnector]: RCFGBuilder initialized 18.02/8.40 [2019-03-28 22:51:32,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:51:32" (1/1) ... 18.02/8.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.40 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 18.02/8.40 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 18.02/8.40 [2019-03-28 22:51:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 18.02/8.40 [2019-03-28 22:51:33,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 18.02/8.40 [2019-03-28 22:51:33,156 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 18.02/8.40 [2019-03-28 22:51:33,157 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. 18.02/8.40 [2019-03-28 22:51:33,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:51:33 BoogieIcfgContainer 18.02/8.40 [2019-03-28 22:51:33,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 18.02/8.40 [2019-03-28 22:51:33,159 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 18.02/8.40 [2019-03-28 22:51:33,159 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 18.02/8.40 [2019-03-28 22:51:33,161 INFO L276 PluginConnector]: BlockEncodingV2 initialized 18.02/8.40 [2019-03-28 22:51:33,162 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:51:33" (1/1) ... 18.02/8.40 [2019-03-28 22:51:33,176 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges 18.02/8.40 [2019-03-28 22:51:33,178 INFO L258 BlockEncoder]: Using Remove infeasible edges 18.02/8.40 [2019-03-28 22:51:33,178 INFO L263 BlockEncoder]: Using Maximize final states 18.02/8.40 [2019-03-28 22:51:33,179 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 18.02/8.40 [2019-03-28 22:51:33,179 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 18.02/8.40 [2019-03-28 22:51:33,181 INFO L296 BlockEncoder]: Using Remove sink states 18.02/8.40 [2019-03-28 22:51:33,182 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 18.02/8.40 [2019-03-28 22:51:33,182 INFO L179 BlockEncoder]: Using Rewrite not-equals 18.02/8.40 [2019-03-28 22:51:33,196 INFO L185 BlockEncoder]: Using Use SBE 18.02/8.40 [2019-03-28 22:51:33,203 INFO L200 BlockEncoder]: SBE split 0 edges 18.02/8.40 [2019-03-28 22:51:33,208 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 18.02/8.40 [2019-03-28 22:51:33,210 INFO L71 MaximizeFinalStates]: 0 new accepting states 18.02/8.40 [2019-03-28 22:51:33,224 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding 18.02/8.40 [2019-03-28 22:51:33,226 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 18.02/8.40 [2019-03-28 22:51:33,227 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 18.02/8.40 [2019-03-28 22:51:33,227 INFO L71 MaximizeFinalStates]: 0 new accepting states 18.02/8.40 [2019-03-28 22:51:33,228 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 18.02/8.40 [2019-03-28 22:51:33,228 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 18.02/8.40 [2019-03-28 22:51:33,228 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 4 edges 18.02/8.40 [2019-03-28 22:51:33,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:51:33 BasicIcfg 18.02/8.40 [2019-03-28 22:51:33,229 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 18.02/8.40 [2019-03-28 22:51:33,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 18.02/8.40 [2019-03-28 22:51:33,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... 18.02/8.40 [2019-03-28 22:51:33,233 INFO L276 PluginConnector]: TraceAbstraction initialized 18.02/8.40 [2019-03-28 22:51:33,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 10:51:32" (1/4) ... 18.02/8.40 [2019-03-28 22:51:33,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca96412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:51:33, skipping insertion in model container 18.02/8.40 [2019-03-28 22:51:33,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:51:32" (2/4) ... 18.02/8.40 [2019-03-28 22:51:33,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca96412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:51:33, skipping insertion in model container 18.02/8.40 [2019-03-28 22:51:33,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:51:33" (3/4) ... 18.02/8.40 [2019-03-28 22:51:33,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca96412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:51:33, skipping insertion in model container 18.02/8.40 [2019-03-28 22:51:33,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:51:33" (4/4) ... 18.02/8.40 [2019-03-28 22:51:33,237 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 18.02/8.40 [2019-03-28 22:51:33,247 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 18.02/8.40 [2019-03-28 22:51:33,254 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 18.02/8.40 [2019-03-28 22:51:33,272 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 18.02/8.40 [2019-03-28 22:51:33,301 INFO L133 ementStrategyFactory]: Using default assertion order modulation 18.02/8.40 [2019-03-28 22:51:33,302 INFO L382 AbstractCegarLoop]: Interprodecural is true 18.02/8.40 [2019-03-28 22:51:33,302 INFO L383 AbstractCegarLoop]: Hoare is true 18.02/8.40 [2019-03-28 22:51:33,302 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 18.02/8.40 [2019-03-28 22:51:33,302 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 18.02/8.40 [2019-03-28 22:51:33,302 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 18.02/8.40 [2019-03-28 22:51:33,302 INFO L387 AbstractCegarLoop]: Difference is false 18.02/8.40 [2019-03-28 22:51:33,303 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 18.02/8.40 [2019-03-28 22:51:33,303 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 18.02/8.40 [2019-03-28 22:51:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. 18.02/8.40 [2019-03-28 22:51:33,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 18.02/8.40 [2019-03-28 22:51:33,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. 18.02/8.40 [2019-03-28 22:51:33,376 INFO L451 ceAbstractionStarter]: At program point L19-2(lines 19 25) the Hoare annotation is: true 18.02/8.40 [2019-03-28 22:51:33,377 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 18.02/8.40 [2019-03-28 22:51:33,377 INFO L451 ceAbstractionStarter]: At program point L21-2(lines 21 23) the Hoare annotation is: true 18.02/8.40 [2019-03-28 22:51:33,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:51:33 BasicIcfg 18.02/8.40 [2019-03-28 22:51:33,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 18.02/8.40 [2019-03-28 22:51:33,387 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 18.02/8.40 [2019-03-28 22:51:33,387 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 18.02/8.40 [2019-03-28 22:51:33,390 INFO L276 PluginConnector]: BuchiAutomizer initialized 18.02/8.40 [2019-03-28 22:51:33,391 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.02/8.40 [2019-03-28 22:51:33,391 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 10:51:32" (1/5) ... 18.02/8.40 [2019-03-28 22:51:33,392 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1730e425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:51:33, skipping insertion in model container 18.02/8.40 [2019-03-28 22:51:33,392 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.02/8.40 [2019-03-28 22:51:33,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:51:32" (2/5) ... 18.02/8.40 [2019-03-28 22:51:33,392 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1730e425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:51:33, skipping insertion in model container 18.02/8.40 [2019-03-28 22:51:33,393 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.02/8.40 [2019-03-28 22:51:33,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:51:33" (3/5) ... 18.02/8.40 [2019-03-28 22:51:33,393 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1730e425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:51:33, skipping insertion in model container 18.02/8.40 [2019-03-28 22:51:33,393 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.02/8.40 [2019-03-28 22:51:33,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:51:33" (4/5) ... 18.02/8.40 [2019-03-28 22:51:33,394 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1730e425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:51:33, skipping insertion in model container 18.02/8.40 [2019-03-28 22:51:33,394 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.02/8.40 [2019-03-28 22:51:33,394 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:51:33" (5/5) ... 18.02/8.40 [2019-03-28 22:51:33,396 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 18.02/8.40 [2019-03-28 22:51:33,423 INFO L133 ementStrategyFactory]: Using default assertion order modulation 18.02/8.40 [2019-03-28 22:51:33,423 INFO L374 BuchiCegarLoop]: Interprodecural is true 18.02/8.40 [2019-03-28 22:51:33,423 INFO L375 BuchiCegarLoop]: Hoare is true 18.02/8.40 [2019-03-28 22:51:33,424 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 18.02/8.40 [2019-03-28 22:51:33,424 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 18.02/8.40 [2019-03-28 22:51:33,424 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 18.02/8.40 [2019-03-28 22:51:33,424 INFO L379 BuchiCegarLoop]: Difference is false 18.02/8.40 [2019-03-28 22:51:33,424 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 18.02/8.40 [2019-03-28 22:51:33,424 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 18.02/8.40 [2019-03-28 22:51:33,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 18.02/8.40 [2019-03-28 22:51:33,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 18.02/8.40 [2019-03-28 22:51:33,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.02/8.40 [2019-03-28 22:51:33,445 INFO L119 BuchiIsEmpty]: Starting construction of run 18.02/8.40 [2019-03-28 22:51:33,450 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 18.02/8.40 [2019-03-28 22:51:33,451 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 18.02/8.40 [2019-03-28 22:51:33,451 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 18.02/8.40 [2019-03-28 22:51:33,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 18.02/8.40 [2019-03-28 22:51:33,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 18.02/8.40 [2019-03-28 22:51:33,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.02/8.40 [2019-03-28 22:51:33,452 INFO L119 BuchiIsEmpty]: Starting construction of run 18.02/8.40 [2019-03-28 22:51:33,452 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 18.02/8.40 [2019-03-28 22:51:33,452 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 18.02/8.40 [2019-03-28 22:51:33,457 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 4#L19-2true 18.02/8.40 [2019-03-28 22:51:33,458 INFO L796 eck$LassoCheckResult]: Loop: 4#L19-2true [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 5#L21-2true [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 4#L19-2true 18.02/8.40 [2019-03-28 22:51:33,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:33,464 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 1 times 18.02/8.40 [2019-03-28 22:51:33,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:33,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:33,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:33,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:33,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2122, now seen corresponding path program 1 times 18.02/8.40 [2019-03-28 22:51:33,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:33,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:33,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:33,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.02/8.40 [2019-03-28 22:51:33,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 18.02/8.40 [2019-03-28 22:51:33,594 INFO L811 eck$LassoCheckResult]: loop already infeasible 18.02/8.40 [2019-03-28 22:51:33,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 18.02/8.40 [2019-03-28 22:51:33,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.02/8.40 [2019-03-28 22:51:33,611 INFO L87 Difference]: Start difference. First operand 3 states. Second operand 3 states. 18.02/8.40 [2019-03-28 22:51:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.02/8.40 [2019-03-28 22:51:33,630 INFO L93 Difference]: Finished difference Result 4 states and 5 transitions. 18.02/8.40 [2019-03-28 22:51:33,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 18.02/8.40 [2019-03-28 22:51:33,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4 states and 5 transitions. 18.02/8.40 [2019-03-28 22:51:33,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 18.02/8.40 [2019-03-28 22:51:33,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4 states to 4 states and 5 transitions. 18.02/8.40 [2019-03-28 22:51:33,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 18.02/8.40 [2019-03-28 22:51:33,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 18.02/8.40 [2019-03-28 22:51:33,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 5 transitions. 18.02/8.40 [2019-03-28 22:51:33,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 18.02/8.40 [2019-03-28 22:51:33,642 INFO L706 BuchiCegarLoop]: Abstraction has 4 states and 5 transitions. 18.02/8.40 [2019-03-28 22:51:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states and 5 transitions. 18.02/8.40 [2019-03-28 22:51:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. 18.02/8.40 [2019-03-28 22:51:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 18.02/8.40 [2019-03-28 22:51:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. 18.02/8.40 [2019-03-28 22:51:33,672 INFO L729 BuchiCegarLoop]: Abstraction has 4 states and 5 transitions. 18.02/8.40 [2019-03-28 22:51:33,672 INFO L609 BuchiCegarLoop]: Abstraction has 4 states and 5 transitions. 18.02/8.40 [2019-03-28 22:51:33,672 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 18.02/8.40 [2019-03-28 22:51:33,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 5 transitions. 18.02/8.40 [2019-03-28 22:51:33,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 18.02/8.40 [2019-03-28 22:51:33,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.02/8.40 [2019-03-28 22:51:33,673 INFO L119 BuchiIsEmpty]: Starting construction of run 18.02/8.40 [2019-03-28 22:51:33,674 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 18.02/8.40 [2019-03-28 22:51:33,674 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 18.02/8.40 [2019-03-28 22:51:33,674 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 17#L19-2 18.02/8.40 [2019-03-28 22:51:33,675 INFO L796 eck$LassoCheckResult]: Loop: 17#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 18#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 19#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 17#L19-2 18.02/8.40 [2019-03-28 22:51:33,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:33,675 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 2 times 18.02/8.40 [2019-03-28 22:51:33,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:33,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:33,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:33,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:33,682 INFO L82 PathProgramCache]: Analyzing trace with hash 65672, now seen corresponding path program 1 times 18.02/8.40 [2019-03-28 22:51:33,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:33,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:33,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:33,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 18.02/8.40 [2019-03-28 22:51:33,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 18.02/8.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.40 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 18.02/8.40 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 18.02/8.40 [2019-03-28 22:51:33,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:33,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjunts are in the unsatisfiable core 18.02/8.40 [2019-03-28 22:51:33,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.02/8.40 [2019-03-28 22:51:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:33,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 18.02/8.40 [2019-03-28 22:51:33,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 18.02/8.40 [2019-03-28 22:51:33,784 INFO L811 eck$LassoCheckResult]: loop already infeasible 18.02/8.40 [2019-03-28 22:51:33,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 18.02/8.40 [2019-03-28 22:51:33,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 18.02/8.40 [2019-03-28 22:51:33,784 INFO L87 Difference]: Start difference. First operand 4 states and 5 transitions. cyclomatic complexity: 2 Second operand 4 states. 18.02/8.40 [2019-03-28 22:51:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.02/8.40 [2019-03-28 22:51:33,801 INFO L93 Difference]: Finished difference Result 5 states and 6 transitions. 18.02/8.40 [2019-03-28 22:51:33,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 18.02/8.40 [2019-03-28 22:51:33,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5 states and 6 transitions. 18.02/8.40 [2019-03-28 22:51:33,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 18.02/8.40 [2019-03-28 22:51:33,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5 states to 5 states and 6 transitions. 18.02/8.40 [2019-03-28 22:51:33,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 18.02/8.40 [2019-03-28 22:51:33,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 18.02/8.40 [2019-03-28 22:51:33,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. 18.02/8.40 [2019-03-28 22:51:33,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 18.02/8.40 [2019-03-28 22:51:33,804 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. 18.02/8.40 [2019-03-28 22:51:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. 18.02/8.40 [2019-03-28 22:51:33,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. 18.02/8.40 [2019-03-28 22:51:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 18.02/8.40 [2019-03-28 22:51:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. 18.02/8.40 [2019-03-28 22:51:33,806 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. 18.02/8.40 [2019-03-28 22:51:33,806 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. 18.02/8.40 [2019-03-28 22:51:33,806 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 18.02/8.40 [2019-03-28 22:51:33,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. 18.02/8.40 [2019-03-28 22:51:33,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 18.02/8.40 [2019-03-28 22:51:33,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.02/8.40 [2019-03-28 22:51:33,807 INFO L119 BuchiIsEmpty]: Starting construction of run 18.02/8.40 [2019-03-28 22:51:33,807 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 18.02/8.40 [2019-03-28 22:51:33,807 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] 18.02/8.40 [2019-03-28 22:51:33,807 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 39#L19-2 18.02/8.40 [2019-03-28 22:51:33,808 INFO L796 eck$LassoCheckResult]: Loop: 39#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 40#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 41#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 42#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 39#L19-2 18.02/8.40 [2019-03-28 22:51:33,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:33,808 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 3 times 18.02/8.40 [2019-03-28 22:51:33,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:33,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:33,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:33,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:33,815 INFO L82 PathProgramCache]: Analyzing trace with hash 2035722, now seen corresponding path program 2 times 18.02/8.40 [2019-03-28 22:51:33,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:33,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:33,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:33,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 18.02/8.40 [2019-03-28 22:51:33,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 18.02/8.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.40 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 18.02/8.40 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 18.02/8.40 [2019-03-28 22:51:33,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 18.02/8.40 [2019-03-28 22:51:33,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 18.02/8.40 [2019-03-28 22:51:33,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:33,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core 18.02/8.40 [2019-03-28 22:51:33,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.02/8.40 [2019-03-28 22:51:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:33,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 18.02/8.40 [2019-03-28 22:51:33,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 18.02/8.40 [2019-03-28 22:51:33,902 INFO L811 eck$LassoCheckResult]: loop already infeasible 18.02/8.40 [2019-03-28 22:51:33,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 18.02/8.40 [2019-03-28 22:51:33,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 18.02/8.40 [2019-03-28 22:51:33,902 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 5 states. 18.02/8.40 [2019-03-28 22:51:33,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.02/8.40 [2019-03-28 22:51:33,929 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. 18.02/8.40 [2019-03-28 22:51:33,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 18.02/8.40 [2019-03-28 22:51:33,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 7 transitions. 18.02/8.40 [2019-03-28 22:51:33,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 18.02/8.40 [2019-03-28 22:51:33,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 7 transitions. 18.02/8.40 [2019-03-28 22:51:33,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 18.02/8.40 [2019-03-28 22:51:33,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 18.02/8.40 [2019-03-28 22:51:33,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. 18.02/8.40 [2019-03-28 22:51:33,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 18.02/8.40 [2019-03-28 22:51:33,932 INFO L706 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. 18.02/8.40 [2019-03-28 22:51:33,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. 18.02/8.40 [2019-03-28 22:51:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. 18.02/8.40 [2019-03-28 22:51:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 18.02/8.40 [2019-03-28 22:51:33,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. 18.02/8.40 [2019-03-28 22:51:33,933 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. 18.02/8.40 [2019-03-28 22:51:33,933 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. 18.02/8.40 [2019-03-28 22:51:33,934 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 18.02/8.40 [2019-03-28 22:51:33,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. 18.02/8.40 [2019-03-28 22:51:33,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 18.02/8.40 [2019-03-28 22:51:33,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.02/8.40 [2019-03-28 22:51:33,934 INFO L119 BuchiIsEmpty]: Starting construction of run 18.02/8.40 [2019-03-28 22:51:33,935 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 18.02/8.40 [2019-03-28 22:51:33,935 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 1, 1] 18.02/8.40 [2019-03-28 22:51:33,935 INFO L794 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 67#L19-2 18.02/8.40 [2019-03-28 22:51:33,936 INFO L796 eck$LassoCheckResult]: Loop: 67#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 68#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 69#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 71#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 70#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 67#L19-2 18.02/8.40 [2019-03-28 22:51:33,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:33,936 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 4 times 18.02/8.40 [2019-03-28 22:51:33,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:33,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:33,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:33,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:33,943 INFO L82 PathProgramCache]: Analyzing trace with hash 63107272, now seen corresponding path program 3 times 18.02/8.40 [2019-03-28 22:51:33,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:33,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:33,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:33,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 18.02/8.40 [2019-03-28 22:51:33,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 18.02/8.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.40 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 18.02/8.40 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 18.02/8.40 [2019-03-28 22:51:34,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 18.02/8.40 [2019-03-28 22:51:34,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) 18.02/8.40 [2019-03-28 22:51:34,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:34,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core 18.02/8.40 [2019-03-28 22:51:34,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.02/8.40 [2019-03-28 22:51:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:34,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 18.02/8.40 [2019-03-28 22:51:34,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 18.02/8.40 [2019-03-28 22:51:34,044 INFO L811 eck$LassoCheckResult]: loop already infeasible 18.02/8.40 [2019-03-28 22:51:34,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 18.02/8.40 [2019-03-28 22:51:34,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 18.02/8.40 [2019-03-28 22:51:34,045 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 6 states. 18.02/8.40 [2019-03-28 22:51:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.02/8.40 [2019-03-28 22:51:34,058 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. 18.02/8.40 [2019-03-28 22:51:34,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 18.02/8.40 [2019-03-28 22:51:34,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. 18.02/8.40 [2019-03-28 22:51:34,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 18.02/8.40 [2019-03-28 22:51:34,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. 18.02/8.40 [2019-03-28 22:51:34,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 18.02/8.40 [2019-03-28 22:51:34,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 18.02/8.40 [2019-03-28 22:51:34,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. 18.02/8.40 [2019-03-28 22:51:34,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 18.02/8.40 [2019-03-28 22:51:34,060 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. 18.02/8.40 [2019-03-28 22:51:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. 18.02/8.40 [2019-03-28 22:51:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. 18.02/8.40 [2019-03-28 22:51:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 18.02/8.40 [2019-03-28 22:51:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. 18.02/8.40 [2019-03-28 22:51:34,062 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. 18.02/8.40 [2019-03-28 22:51:34,062 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. 18.02/8.40 [2019-03-28 22:51:34,062 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 18.02/8.40 [2019-03-28 22:51:34,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. 18.02/8.40 [2019-03-28 22:51:34,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 18.02/8.40 [2019-03-28 22:51:34,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.02/8.40 [2019-03-28 22:51:34,063 INFO L119 BuchiIsEmpty]: Starting construction of run 18.02/8.40 [2019-03-28 22:51:34,063 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 18.02/8.40 [2019-03-28 22:51:34,063 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 1, 1] 18.02/8.40 [2019-03-28 22:51:34,063 INFO L794 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 101#L19-2 18.02/8.40 [2019-03-28 22:51:34,064 INFO L796 eck$LassoCheckResult]: Loop: 101#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 102#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 103#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 106#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 105#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 104#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 101#L19-2 18.02/8.40 [2019-03-28 22:51:34,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:34,064 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 5 times 18.02/8.40 [2019-03-28 22:51:34,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:34,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:34,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:34,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:34,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1956325322, now seen corresponding path program 4 times 18.02/8.40 [2019-03-28 22:51:34,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:34,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:34,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:34,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 18.02/8.40 [2019-03-28 22:51:34,128 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 18.02/8.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.40 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 18.02/8.40 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 18.02/8.40 [2019-03-28 22:51:34,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST 18.02/8.40 [2019-03-28 22:51:34,147 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) 18.02/8.40 [2019-03-28 22:51:34,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:34,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core 18.02/8.40 [2019-03-28 22:51:34,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.02/8.40 [2019-03-28 22:51:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:34,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 18.02/8.40 [2019-03-28 22:51:34,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 18.02/8.40 [2019-03-28 22:51:34,181 INFO L811 eck$LassoCheckResult]: loop already infeasible 18.02/8.40 [2019-03-28 22:51:34,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 18.02/8.40 [2019-03-28 22:51:34,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 18.02/8.40 [2019-03-28 22:51:34,182 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 7 states. 18.02/8.40 [2019-03-28 22:51:34,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.02/8.40 [2019-03-28 22:51:34,223 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. 18.02/8.40 [2019-03-28 22:51:34,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 18.02/8.40 [2019-03-28 22:51:34,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. 18.02/8.40 [2019-03-28 22:51:34,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 18.02/8.40 [2019-03-28 22:51:34,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. 18.02/8.40 [2019-03-28 22:51:34,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 18.02/8.40 [2019-03-28 22:51:34,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 18.02/8.40 [2019-03-28 22:51:34,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. 18.02/8.40 [2019-03-28 22:51:34,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 18.02/8.40 [2019-03-28 22:51:34,226 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. 18.02/8.40 [2019-03-28 22:51:34,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. 18.02/8.40 [2019-03-28 22:51:34,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. 18.02/8.40 [2019-03-28 22:51:34,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 18.02/8.40 [2019-03-28 22:51:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. 18.02/8.40 [2019-03-28 22:51:34,228 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. 18.02/8.40 [2019-03-28 22:51:34,228 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. 18.02/8.40 [2019-03-28 22:51:34,228 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 18.02/8.40 [2019-03-28 22:51:34,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. 18.02/8.40 [2019-03-28 22:51:34,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 18.02/8.40 [2019-03-28 22:51:34,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.02/8.40 [2019-03-28 22:51:34,229 INFO L119 BuchiIsEmpty]: Starting construction of run 18.02/8.40 [2019-03-28 22:51:34,229 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 18.02/8.40 [2019-03-28 22:51:34,229 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 1, 1] 18.02/8.40 [2019-03-28 22:51:34,230 INFO L794 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 141#L19-2 18.02/8.40 [2019-03-28 22:51:34,230 INFO L796 eck$LassoCheckResult]: Loop: 141#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 142#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 143#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 147#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 146#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 145#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 144#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 141#L19-2 18.02/8.40 [2019-03-28 22:51:34,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:34,231 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 6 times 18.02/8.40 [2019-03-28 22:51:34,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:34,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:34,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:34,237 INFO L82 PathProgramCache]: Analyzing trace with hash 516542728, now seen corresponding path program 5 times 18.02/8.40 [2019-03-28 22:51:34,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:34,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:34,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:34,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 18.02/8.40 [2019-03-28 22:51:34,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 18.02/8.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.40 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 18.02/8.40 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 18.02/8.40 [2019-03-28 22:51:34,305 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 18.02/8.40 [2019-03-28 22:51:34,315 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) 18.02/8.40 [2019-03-28 22:51:34,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:34,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core 18.02/8.40 [2019-03-28 22:51:34,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.02/8.40 [2019-03-28 22:51:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:34,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 18.02/8.40 [2019-03-28 22:51:34,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 18.02/8.40 [2019-03-28 22:51:34,349 INFO L811 eck$LassoCheckResult]: loop already infeasible 18.02/8.40 [2019-03-28 22:51:34,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 18.02/8.40 [2019-03-28 22:51:34,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 18.02/8.40 [2019-03-28 22:51:34,349 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 8 states. 18.02/8.40 [2019-03-28 22:51:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.02/8.40 [2019-03-28 22:51:34,375 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. 18.02/8.40 [2019-03-28 22:51:34,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 18.02/8.40 [2019-03-28 22:51:34,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. 18.02/8.40 [2019-03-28 22:51:34,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 18.02/8.40 [2019-03-28 22:51:34,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. 18.02/8.40 [2019-03-28 22:51:34,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 18.02/8.40 [2019-03-28 22:51:34,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 18.02/8.40 [2019-03-28 22:51:34,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. 18.02/8.40 [2019-03-28 22:51:34,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 18.02/8.40 [2019-03-28 22:51:34,378 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. 18.02/8.40 [2019-03-28 22:51:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. 18.02/8.40 [2019-03-28 22:51:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. 18.02/8.40 [2019-03-28 22:51:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 18.02/8.40 [2019-03-28 22:51:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. 18.02/8.40 [2019-03-28 22:51:34,380 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. 18.02/8.40 [2019-03-28 22:51:34,380 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. 18.02/8.40 [2019-03-28 22:51:34,380 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 18.02/8.40 [2019-03-28 22:51:34,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. 18.02/8.40 [2019-03-28 22:51:34,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 18.02/8.40 [2019-03-28 22:51:34,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.02/8.40 [2019-03-28 22:51:34,381 INFO L119 BuchiIsEmpty]: Starting construction of run 18.02/8.40 [2019-03-28 22:51:34,381 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 18.02/8.40 [2019-03-28 22:51:34,381 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 1, 1] 18.02/8.40 [2019-03-28 22:51:34,381 INFO L794 eck$LassoCheckResult]: Stem: 186#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 187#L19-2 18.02/8.40 [2019-03-28 22:51:34,382 INFO L796 eck$LassoCheckResult]: Loop: 187#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 188#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 189#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 194#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 193#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 192#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 191#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 190#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 187#L19-2 18.02/8.40 [2019-03-28 22:51:34,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:34,382 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 7 times 18.02/8.40 [2019-03-28 22:51:34,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:34,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:34,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:34,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:34,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1167044726, now seen corresponding path program 6 times 18.02/8.40 [2019-03-28 22:51:34,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:34,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:34,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:34,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 18.02/8.40 [2019-03-28 22:51:34,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 18.02/8.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.40 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 18.02/8.40 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 18.02/8.40 [2019-03-28 22:51:34,473 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE 18.02/8.40 [2019-03-28 22:51:34,486 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) 18.02/8.40 [2019-03-28 22:51:34,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:34,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core 18.02/8.40 [2019-03-28 22:51:34,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.02/8.40 [2019-03-28 22:51:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:34,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 18.02/8.40 [2019-03-28 22:51:34,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 18.02/8.40 [2019-03-28 22:51:34,521 INFO L811 eck$LassoCheckResult]: loop already infeasible 18.02/8.40 [2019-03-28 22:51:34,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 18.02/8.40 [2019-03-28 22:51:34,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 18.02/8.40 [2019-03-28 22:51:34,522 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 9 states. 18.02/8.40 [2019-03-28 22:51:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.02/8.40 [2019-03-28 22:51:34,544 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. 18.02/8.40 [2019-03-28 22:51:34,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 18.02/8.40 [2019-03-28 22:51:34,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. 18.02/8.40 [2019-03-28 22:51:34,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 18.02/8.40 [2019-03-28 22:51:34,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. 18.02/8.40 [2019-03-28 22:51:34,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 18.02/8.40 [2019-03-28 22:51:34,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 18.02/8.40 [2019-03-28 22:51:34,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. 18.02/8.40 [2019-03-28 22:51:34,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 18.02/8.40 [2019-03-28 22:51:34,547 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. 18.02/8.40 [2019-03-28 22:51:34,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. 18.02/8.40 [2019-03-28 22:51:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 18.02/8.40 [2019-03-28 22:51:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 18.02/8.40 [2019-03-28 22:51:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. 18.02/8.40 [2019-03-28 22:51:34,549 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. 18.02/8.40 [2019-03-28 22:51:34,549 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. 18.02/8.40 [2019-03-28 22:51:34,549 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 18.02/8.40 [2019-03-28 22:51:34,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. 18.02/8.40 [2019-03-28 22:51:34,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 18.02/8.40 [2019-03-28 22:51:34,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.02/8.40 [2019-03-28 22:51:34,550 INFO L119 BuchiIsEmpty]: Starting construction of run 18.02/8.40 [2019-03-28 22:51:34,551 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 18.02/8.40 [2019-03-28 22:51:34,551 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 1, 1] 18.02/8.40 [2019-03-28 22:51:34,551 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 239#L19-2 18.02/8.40 [2019-03-28 22:51:34,551 INFO L796 eck$LassoCheckResult]: Loop: 239#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 240#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 241#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 247#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 246#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 245#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 244#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 243#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 242#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 239#L19-2 18.02/8.40 [2019-03-28 22:51:34,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:34,552 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 8 times 18.02/8.40 [2019-03-28 22:51:34,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:34,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:34,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:34,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:34,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1818648248, now seen corresponding path program 7 times 18.02/8.40 [2019-03-28 22:51:34,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:34,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:34,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:34,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 18.02/8.40 [2019-03-28 22:51:34,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 18.02/8.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.40 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 18.02/8.40 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 18.02/8.40 [2019-03-28 22:51:34,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:34,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core 18.02/8.40 [2019-03-28 22:51:34,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.02/8.40 [2019-03-28 22:51:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:34,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 18.02/8.40 [2019-03-28 22:51:34,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 18.02/8.40 [2019-03-28 22:51:34,729 INFO L811 eck$LassoCheckResult]: loop already infeasible 18.02/8.40 [2019-03-28 22:51:34,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 18.02/8.40 [2019-03-28 22:51:34,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 18.02/8.40 [2019-03-28 22:51:34,730 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 10 states. 18.02/8.40 [2019-03-28 22:51:34,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.02/8.40 [2019-03-28 22:51:34,763 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. 18.02/8.40 [2019-03-28 22:51:34,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 18.02/8.40 [2019-03-28 22:51:34,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. 18.02/8.40 [2019-03-28 22:51:34,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 18.02/8.40 [2019-03-28 22:51:34,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. 18.02/8.40 [2019-03-28 22:51:34,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 18.02/8.40 [2019-03-28 22:51:34,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 18.02/8.40 [2019-03-28 22:51:34,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. 18.02/8.40 [2019-03-28 22:51:34,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 18.02/8.40 [2019-03-28 22:51:34,766 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. 18.02/8.40 [2019-03-28 22:51:34,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. 18.02/8.40 [2019-03-28 22:51:34,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 18.02/8.40 [2019-03-28 22:51:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 18.02/8.40 [2019-03-28 22:51:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. 18.02/8.40 [2019-03-28 22:51:34,768 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. 18.02/8.40 [2019-03-28 22:51:34,768 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. 18.02/8.40 [2019-03-28 22:51:34,768 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 18.02/8.40 [2019-03-28 22:51:34,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. 18.02/8.40 [2019-03-28 22:51:34,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 18.02/8.40 [2019-03-28 22:51:34,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.02/8.40 [2019-03-28 22:51:34,769 INFO L119 BuchiIsEmpty]: Starting construction of run 18.02/8.40 [2019-03-28 22:51:34,769 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 18.02/8.40 [2019-03-28 22:51:34,769 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [8, 1, 1] 18.02/8.40 [2019-03-28 22:51:34,770 INFO L794 eck$LassoCheckResult]: Stem: 296#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 297#L19-2 18.02/8.40 [2019-03-28 22:51:34,771 INFO L796 eck$LassoCheckResult]: Loop: 297#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 298#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 299#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 306#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 305#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 304#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 303#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 302#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 301#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 300#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 297#L19-2 18.02/8.40 [2019-03-28 22:51:34,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:34,771 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 9 times 18.02/8.40 [2019-03-28 22:51:34,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:34,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:34,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:34,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:34,776 INFO L82 PathProgramCache]: Analyzing trace with hash -543520950, now seen corresponding path program 8 times 18.02/8.40 [2019-03-28 22:51:34,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:34,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:34,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:34,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 18.02/8.40 [2019-03-28 22:51:34,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 18.02/8.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.40 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 18.02/8.40 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 18.02/8.40 [2019-03-28 22:51:34,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 18.02/8.40 [2019-03-28 22:51:34,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 18.02/8.40 [2019-03-28 22:51:34,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 18.02/8.40 [2019-03-28 22:51:34,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core 18.02/8.40 [2019-03-28 22:51:34,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.02/8.40 [2019-03-28 22:51:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.40 [2019-03-28 22:51:34,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 18.02/8.40 [2019-03-28 22:51:34,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 18.02/8.40 [2019-03-28 22:51:34,930 INFO L811 eck$LassoCheckResult]: loop already infeasible 18.02/8.40 [2019-03-28 22:51:34,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 18.02/8.40 [2019-03-28 22:51:34,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 18.02/8.40 [2019-03-28 22:51:34,931 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 11 states. 18.02/8.40 [2019-03-28 22:51:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.02/8.40 [2019-03-28 22:51:34,957 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. 18.02/8.40 [2019-03-28 22:51:34,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 18.02/8.40 [2019-03-28 22:51:34,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. 18.02/8.40 [2019-03-28 22:51:34,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 18.02/8.40 [2019-03-28 22:51:34,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. 18.02/8.40 [2019-03-28 22:51:34,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 18.02/8.40 [2019-03-28 22:51:34,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 18.02/8.40 [2019-03-28 22:51:34,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. 18.02/8.40 [2019-03-28 22:51:34,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 18.02/8.40 [2019-03-28 22:51:34,960 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. 18.02/8.40 [2019-03-28 22:51:34,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. 18.02/8.40 [2019-03-28 22:51:34,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. 18.02/8.40 [2019-03-28 22:51:34,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 18.02/8.40 [2019-03-28 22:51:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. 18.02/8.40 [2019-03-28 22:51:34,962 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. 18.02/8.40 [2019-03-28 22:51:34,962 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. 18.02/8.40 [2019-03-28 22:51:34,962 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 18.02/8.40 [2019-03-28 22:51:34,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. 18.02/8.40 [2019-03-28 22:51:34,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 18.02/8.40 [2019-03-28 22:51:34,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.02/8.40 [2019-03-28 22:51:34,963 INFO L119 BuchiIsEmpty]: Starting construction of run 18.02/8.40 [2019-03-28 22:51:34,964 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 18.02/8.40 [2019-03-28 22:51:34,964 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [9, 1, 1] 18.02/8.40 [2019-03-28 22:51:34,965 INFO L794 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 361#L19-2 18.02/8.40 [2019-03-28 22:51:34,965 INFO L796 eck$LassoCheckResult]: Loop: 361#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 362#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 363#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 371#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 370#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 369#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 368#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 367#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 366#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 365#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 364#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 361#L19-2 18.02/8.40 [2019-03-28 22:51:34,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:34,965 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 10 times 18.02/8.40 [2019-03-28 22:51:34,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:34,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:34,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:34,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:34,971 INFO L82 PathProgramCache]: Analyzing trace with hash 330719624, now seen corresponding path program 9 times 18.02/8.40 [2019-03-28 22:51:34,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:34,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:34,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:34,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.40 [2019-03-28 22:51:34,987 INFO L82 PathProgramCache]: Analyzing trace with hash -256086390, now seen corresponding path program 1 times 18.02/8.40 [2019-03-28 22:51:34,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.40 [2019-03-28 22:51:34,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.40 [2019-03-28 22:51:34,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.40 [2019-03-28 22:51:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.40 [2019-03-28 22:51:35,122 INFO L216 LassoAnalysis]: Preferences: 18.02/8.40 [2019-03-28 22:51:35,124 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.02/8.40 [2019-03-28 22:51:35,124 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.02/8.40 [2019-03-28 22:51:35,124 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.02/8.40 [2019-03-28 22:51:35,124 INFO L127 ssoRankerPreferences]: Use exernal solver: true 18.02/8.40 [2019-03-28 22:51:35,124 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.02/8.40 [2019-03-28 22:51:35,125 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.02/8.40 [2019-03-28 22:51:35,125 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.02/8.40 [2019-03-28 22:51:35,125 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop 18.02/8.40 [2019-03-28 22:51:35,125 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.02/8.40 [2019-03-28 22:51:35,125 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.02/8.40 [2019-03-28 22:51:35,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.02/8.40 [2019-03-28 22:51:35,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.02/8.40 [2019-03-28 22:51:35,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.02/8.40 [2019-03-28 22:51:35,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.02/8.40 [2019-03-28 22:51:35,232 INFO L300 LassoAnalysis]: Preprocessing complete. 18.02/8.40 [2019-03-28 22:51:35,233 INFO L412 LassoAnalysis]: Checking for nontermination... 18.02/8.40 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.40 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.02/8.40 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.02/8.40 [2019-03-28 22:51:35,240 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.02/8.41 [2019-03-28 22:51:35,240 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.02/8.41 [2019-03-28 22:51:35,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. 18.02/8.41 [2019-03-28 22:51:35,274 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: [] 18.02/8.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.41 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.02/8.41 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.02/8.41 [2019-03-28 22:51:35,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.02/8.41 [2019-03-28 22:51:35,281 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.02/8.41 [2019-03-28 22:51:35,308 INFO L445 LassoAnalysis]: Proved nontermination for one component. 18.02/8.41 [2019-03-28 22:51:35,309 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: [] 18.02/8.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.41 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.02/8.41 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.02/8.41 [2019-03-28 22:51:35,317 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.02/8.41 [2019-03-28 22:51:35,317 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.02/8.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.41 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.02/8.41 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.02/8.41 [2019-03-28 22:51:35,350 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 18.02/8.41 [2019-03-28 22:51:35,350 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.02/8.41 [2019-03-28 22:51:35,382 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 18.02/8.41 [2019-03-28 22:51:35,384 INFO L216 LassoAnalysis]: Preferences: 18.02/8.41 [2019-03-28 22:51:35,384 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.02/8.41 [2019-03-28 22:51:35,385 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.02/8.41 [2019-03-28 22:51:35,385 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.02/8.41 [2019-03-28 22:51:35,385 INFO L127 ssoRankerPreferences]: Use exernal solver: false 18.02/8.41 [2019-03-28 22:51:35,386 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 18.02/8.41 [2019-03-28 22:51:35,386 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.02/8.41 [2019-03-28 22:51:35,386 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.02/8.41 [2019-03-28 22:51:35,386 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop 18.02/8.41 [2019-03-28 22:51:35,386 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.02/8.41 [2019-03-28 22:51:35,386 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.02/8.41 [2019-03-28 22:51:35,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.02/8.41 [2019-03-28 22:51:35,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.02/8.41 [2019-03-28 22:51:35,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.02/8.41 [2019-03-28 22:51:35,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.02/8.41 [2019-03-28 22:51:35,495 INFO L300 LassoAnalysis]: Preprocessing complete. 18.02/8.41 [2019-03-28 22:51:35,502 INFO L497 LassoAnalysis]: Using template 'affine'. 18.02/8.41 [2019-03-28 22:51:35,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.02/8.41 Termination analysis: LINEAR_WITH_GUESSES 18.02/8.41 Number of strict supporting invariants: 0 18.02/8.41 Number of non-strict supporting invariants: 1 18.02/8.41 Consider only non-deceasing supporting invariants: true 18.02/8.41 Simplify termination arguments: true 18.02/8.41 Simplify supporting invariants: trueOverapproximate stem: false 18.02/8.41 [2019-03-28 22:51:35,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.02/8.41 [2019-03-28 22:51:35,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.02/8.41 [2019-03-28 22:51:35,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.02/8.41 [2019-03-28 22:51:35,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.02/8.41 [2019-03-28 22:51:35,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 18.02/8.41 [2019-03-28 22:51:35,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 18.02/8.41 [2019-03-28 22:51:35,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 18.02/8.41 [2019-03-28 22:51:35,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.02/8.41 Termination analysis: LINEAR_WITH_GUESSES 18.02/8.41 Number of strict supporting invariants: 0 18.02/8.41 Number of non-strict supporting invariants: 1 18.02/8.41 Consider only non-deceasing supporting invariants: true 18.02/8.41 Simplify termination arguments: true 18.02/8.41 Simplify supporting invariants: trueOverapproximate stem: false 18.02/8.41 [2019-03-28 22:51:35,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.02/8.41 [2019-03-28 22:51:35,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.02/8.41 [2019-03-28 22:51:35,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.02/8.41 [2019-03-28 22:51:35,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.02/8.41 [2019-03-28 22:51:35,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 18.02/8.41 [2019-03-28 22:51:35,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 18.02/8.41 [2019-03-28 22:51:35,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 18.02/8.41 [2019-03-28 22:51:35,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.02/8.41 Termination analysis: LINEAR_WITH_GUESSES 18.02/8.41 Number of strict supporting invariants: 0 18.02/8.41 Number of non-strict supporting invariants: 1 18.02/8.41 Consider only non-deceasing supporting invariants: true 18.02/8.41 Simplify termination arguments: true 18.02/8.41 Simplify supporting invariants: trueOverapproximate stem: false 18.02/8.41 [2019-03-28 22:51:35,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.02/8.41 [2019-03-28 22:51:35,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 18.02/8.41 [2019-03-28 22:51:35,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.02/8.41 [2019-03-28 22:51:35,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.02/8.41 [2019-03-28 22:51:35,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.02/8.41 [2019-03-28 22:51:35,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 18.02/8.41 [2019-03-28 22:51:35,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 18.02/8.41 [2019-03-28 22:51:35,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 18.02/8.41 [2019-03-28 22:51:35,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.02/8.41 Termination analysis: LINEAR_WITH_GUESSES 18.02/8.41 Number of strict supporting invariants: 0 18.02/8.41 Number of non-strict supporting invariants: 1 18.02/8.41 Consider only non-deceasing supporting invariants: true 18.02/8.41 Simplify termination arguments: true 18.02/8.41 Simplify supporting invariants: trueOverapproximate stem: false 18.02/8.41 [2019-03-28 22:51:35,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.02/8.41 [2019-03-28 22:51:35,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 18.02/8.41 [2019-03-28 22:51:35,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.02/8.41 [2019-03-28 22:51:35,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.02/8.41 [2019-03-28 22:51:35,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.02/8.41 [2019-03-28 22:51:35,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 18.02/8.41 [2019-03-28 22:51:35,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 18.02/8.41 [2019-03-28 22:51:35,549 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 18.02/8.41 [2019-03-28 22:51:35,554 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 18.02/8.41 [2019-03-28 22:51:35,554 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 18.02/8.41 [2019-03-28 22:51:35,557 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 18.02/8.41 [2019-03-28 22:51:35,557 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 18.02/8.41 [2019-03-28 22:51:35,557 INFO L518 LassoAnalysis]: Proved termination. 18.02/8.41 [2019-03-28 22:51:35,557 INFO L520 LassoAnalysis]: Termination argument consisting of: 18.02/8.41 Ranking function f(ULTIMATE.start_main_~x1~0) = -2*ULTIMATE.start_main_~x1~0 + 21 18.02/8.41 Supporting invariants [] 18.02/8.41 [2019-03-28 22:51:35,559 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 18.02/8.41 [2019-03-28 22:51:35,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.41 [2019-03-28 22:51:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.02/8.41 [2019-03-28 22:51:35,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 18.02/8.41 [2019-03-28 22:51:35,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.02/8.41 [2019-03-28 22:51:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.02/8.41 [2019-03-28 22:51:35,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core 18.02/8.41 [2019-03-28 22:51:35,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.02/8.41 [2019-03-28 22:51:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. 18.02/8.41 [2019-03-28 22:51:35,662 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 18.02/8.41 [2019-03-28 22:51:35,664 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 2 loop predicates 18.02/8.41 [2019-03-28 22:51:35,665 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 3 states. 18.02/8.41 [2019-03-28 22:51:35,684 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 23 states and 26 transitions. Complement of second has 4 states. 18.02/8.41 [2019-03-28 22:51:35,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 18.02/8.41 [2019-03-28 22:51:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 18.02/8.41 [2019-03-28 22:51:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. 18.02/8.41 [2019-03-28 22:51:35,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 1 letters. Loop has 11 letters. 18.02/8.41 [2019-03-28 22:51:35,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.02/8.41 [2019-03-28 22:51:35,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 11 letters. 18.02/8.41 [2019-03-28 22:51:35,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.02/8.41 [2019-03-28 22:51:35,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 1 letters. Loop has 22 letters. 18.02/8.41 [2019-03-28 22:51:35,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.02/8.41 [2019-03-28 22:51:35,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. 18.02/8.41 [2019-03-28 22:51:35,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 18.02/8.41 [2019-03-28 22:51:35,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. 18.02/8.41 [2019-03-28 22:51:35,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 18.02/8.41 [2019-03-28 22:51:35,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 18.02/8.41 [2019-03-28 22:51:35,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. 18.02/8.41 [2019-03-28 22:51:35,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 18.02/8.41 [2019-03-28 22:51:35,696 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. 18.02/8.41 [2019-03-28 22:51:35,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. 18.02/8.41 [2019-03-28 22:51:35,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. 18.02/8.41 [2019-03-28 22:51:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 18.02/8.41 [2019-03-28 22:51:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. 18.02/8.41 [2019-03-28 22:51:35,698 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. 18.02/8.41 [2019-03-28 22:51:35,698 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. 18.02/8.41 [2019-03-28 22:51:35,698 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 18.02/8.41 [2019-03-28 22:51:35,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. 18.02/8.41 [2019-03-28 22:51:35,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 18.02/8.41 [2019-03-28 22:51:35,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.02/8.41 [2019-03-28 22:51:35,699 INFO L119 BuchiIsEmpty]: Starting construction of run 18.02/8.41 [2019-03-28 22:51:35,699 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 18.02/8.41 [2019-03-28 22:51:35,699 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 18.02/8.41 [2019-03-28 22:51:35,699 INFO L794 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 453#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 455#L21-2 18.02/8.41 [2019-03-28 22:51:35,700 INFO L796 eck$LassoCheckResult]: Loop: 455#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 455#L21-2 18.02/8.41 [2019-03-28 22:51:35,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.41 [2019-03-28 22:51:35,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1989, now seen corresponding path program 1 times 18.02/8.41 [2019-03-28 22:51:35,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.41 [2019-03-28 22:51:35,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.41 [2019-03-28 22:51:35,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.41 [2019-03-28 22:51:35,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.02/8.41 [2019-03-28 22:51:35,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.41 [2019-03-28 22:51:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.41 [2019-03-28 22:51:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.41 [2019-03-28 22:51:35,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.41 [2019-03-28 22:51:35,706 INFO L82 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 1 times 18.02/8.41 [2019-03-28 22:51:35,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.41 [2019-03-28 22:51:35,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.41 [2019-03-28 22:51:35,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.41 [2019-03-28 22:51:35,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.02/8.41 [2019-03-28 22:51:35,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.41 [2019-03-28 22:51:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.41 [2019-03-28 22:51:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.41 [2019-03-28 22:51:35,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.41 [2019-03-28 22:51:35,710 INFO L82 PathProgramCache]: Analyzing trace with hash 61699, now seen corresponding path program 1 times 18.02/8.41 [2019-03-28 22:51:35,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.02/8.41 [2019-03-28 22:51:35,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.02/8.41 [2019-03-28 22:51:35,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.41 [2019-03-28 22:51:35,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.02/8.41 [2019-03-28 22:51:35,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.02/8.41 [2019-03-28 22:51:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.41 [2019-03-28 22:51:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.02/8.41 [2019-03-28 22:51:35,725 INFO L216 LassoAnalysis]: Preferences: 18.02/8.41 [2019-03-28 22:51:35,725 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.02/8.41 [2019-03-28 22:51:35,725 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.02/8.41 [2019-03-28 22:51:35,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.02/8.41 [2019-03-28 22:51:35,726 INFO L127 ssoRankerPreferences]: Use exernal solver: true 18.02/8.41 [2019-03-28 22:51:35,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.02/8.41 [2019-03-28 22:51:35,726 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.02/8.41 [2019-03-28 22:51:35,726 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.02/8.41 [2019-03-28 22:51:35,726 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop 18.02/8.41 [2019-03-28 22:51:35,726 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.02/8.41 [2019-03-28 22:51:35,726 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.02/8.41 [2019-03-28 22:51:35,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.02/8.41 [2019-03-28 22:51:35,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.02/8.41 [2019-03-28 22:51:35,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.02/8.41 [2019-03-28 22:51:35,773 INFO L300 LassoAnalysis]: Preprocessing complete. 18.02/8.41 [2019-03-28 22:51:35,774 INFO L412 LassoAnalysis]: Checking for nontermination... 18.02/8.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.41 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.02/8.41 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.02/8.41 [2019-03-28 22:51:35,778 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.02/8.41 [2019-03-28 22:51:35,778 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.02/8.41 [2019-03-28 22:51:35,806 INFO L445 LassoAnalysis]: Proved nontermination for one component. 18.02/8.41 [2019-03-28 22:51:35,806 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: [] 18.02/8.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.41 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.02/8.41 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.02/8.41 [2019-03-28 22:51:35,810 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.02/8.41 [2019-03-28 22:51:35,810 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.02/8.41 [2019-03-28 22:51:35,837 INFO L445 LassoAnalysis]: Proved nontermination for one component. 18.02/8.41 [2019-03-28 22:51:35,838 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: [] 18.02/8.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.41 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.02/8.41 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.02/8.41 [2019-03-28 22:51:35,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 18.02/8.41 [2019-03-28 22:51:35,842 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.02/8.41 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 18.02/8.41 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 18.02/8.41 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.02/8.41 [2019-03-28 22:51:35,871 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 18.02/8.41 [2019-03-28 22:51:35,871 INFO L163 nArgumentSynthesizer]: Using integer mode. 18.02/8.41 [2019-03-28 22:51:35,901 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 18.02/8.41 [2019-03-28 22:51:35,902 INFO L216 LassoAnalysis]: Preferences: 18.02/8.41 [2019-03-28 22:51:35,902 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.02/8.41 [2019-03-28 22:51:35,903 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.02/8.41 [2019-03-28 22:51:35,903 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.02/8.41 [2019-03-28 22:51:35,903 INFO L127 ssoRankerPreferences]: Use exernal solver: false 18.02/8.41 [2019-03-28 22:51:35,903 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 18.02/8.41 [2019-03-28 22:51:35,903 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.02/8.41 [2019-03-28 22:51:35,903 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.02/8.41 [2019-03-28 22:51:35,903 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop 18.02/8.41 [2019-03-28 22:51:35,903 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.02/8.41 [2019-03-28 22:51:35,903 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.02/8.41 [2019-03-28 22:51:35,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.02/8.41 [2019-03-28 22:51:35,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.02/8.41 [2019-03-28 22:51:35,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.02/8.41 [2019-03-28 22:51:35,942 INFO L300 LassoAnalysis]: Preprocessing complete. 18.02/8.41 [2019-03-28 22:51:35,942 INFO L497 LassoAnalysis]: Using template 'affine'. 18.02/8.41 [2019-03-28 22:51:35,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.02/8.41 Termination analysis: LINEAR_WITH_GUESSES 18.02/8.41 Number of strict supporting invariants: 0 18.02/8.41 Number of non-strict supporting invariants: 1 18.02/8.41 Consider only non-deceasing supporting invariants: true 18.02/8.41 Simplify termination arguments: true 18.02/8.41 Simplify supporting invariants: trueOverapproximate stem: false 18.02/8.41 [2019-03-28 22:51:35,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.02/8.41 [2019-03-28 22:51:35,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.02/8.41 [2019-03-28 22:51:35,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.02/8.41 [2019-03-28 22:51:35,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.02/8.41 [2019-03-28 22:51:35,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 18.02/8.41 [2019-03-28 22:51:35,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 18.02/8.41 [2019-03-28 22:51:35,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 18.02/8.41 [2019-03-28 22:51:35,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.02/8.41 Termination analysis: LINEAR_WITH_GUESSES 18.02/8.41 Number of strict supporting invariants: 0 18.02/8.41 Number of non-strict supporting invariants: 1 18.02/8.41 Consider only non-deceasing supporting invariants: true 18.02/8.41 Simplify termination arguments: true 18.02/8.41 Simplify supporting invariants: trueOverapproximate stem: false 18.02/8.41 [2019-03-28 22:51:35,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.02/8.41 [2019-03-28 22:51:35,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 18.02/8.41 [2019-03-28 22:51:35,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.02/8.41 [2019-03-28 22:51:35,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.02/8.41 [2019-03-28 22:51:35,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.02/8.41 [2019-03-28 22:51:35,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 18.02/8.41 [2019-03-28 22:51:35,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 18.02/8.41 [2019-03-28 22:51:35,953 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 18.02/8.41 [2019-03-28 22:51:35,955 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 18.02/8.41 [2019-03-28 22:51:35,955 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 18.02/8.41 [2019-03-28 22:51:35,955 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 18.02/8.41 [2019-03-28 22:51:35,955 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 18.02/8.41 [2019-03-28 22:51:35,956 INFO L518 LassoAnalysis]: Proved termination. 18.02/8.41 [2019-03-28 22:51:35,956 INFO L520 LassoAnalysis]: Termination argument consisting of: 18.02/8.41 Ranking function f(ULTIMATE.start_main_~x2~0) = 1*ULTIMATE.start_main_~x2~0 18.02/8.41 Supporting invariants [] 18.02/8.41 [2019-03-28 22:51:35,956 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 18.02/8.41 [2019-03-28 22:51:35,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.02/8.41 [2019-03-28 22:51:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.02/8.41 [2019-03-28 22:51:35,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core 18.02/8.41 [2019-03-28 22:51:35,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.02/8.41 [2019-03-28 22:51:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.02/8.41 [2019-03-28 22:51:35,987 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core 18.02/8.41 [2019-03-28 22:51:35,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.02/8.41 [2019-03-28 22:51:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.02/8.41 [2019-03-28 22:51:35,988 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 18.02/8.41 [2019-03-28 22:51:35,988 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 1 loop predicates 18.02/8.41 [2019-03-28 22:51:35,988 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 2 states. 18.02/8.41 [2019-03-28 22:51:35,997 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 16 states and 19 transitions. Complement of second has 4 states. 18.02/8.41 [2019-03-28 22:51:35,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 18.02/8.41 [2019-03-28 22:51:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. 18.02/8.41 [2019-03-28 22:51:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. 18.02/8.41 [2019-03-28 22:51:35,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 1 letters. 18.02/8.41 [2019-03-28 22:51:35,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.02/8.41 [2019-03-28 22:51:35,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 1 letters. 18.02/8.41 [2019-03-28 22:51:35,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.02/8.41 [2019-03-28 22:51:35,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 2 letters. 18.02/8.41 [2019-03-28 22:51:35,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.02/8.41 [2019-03-28 22:51:36,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. 18.02/8.41 [2019-03-28 22:51:36,002 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 18.02/8.41 [2019-03-28 22:51:36,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. 18.02/8.41 [2019-03-28 22:51:36,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 18.02/8.41 [2019-03-28 22:51:36,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 18.02/8.41 [2019-03-28 22:51:36,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 18.02/8.41 [2019-03-28 22:51:36,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 18.02/8.41 [2019-03-28 22:51:36,003 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 18.02/8.41 [2019-03-28 22:51:36,003 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 18.02/8.41 [2019-03-28 22:51:36,003 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 18.02/8.41 [2019-03-28 22:51:36,003 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ 18.02/8.41 [2019-03-28 22:51:36,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 18.02/8.41 [2019-03-28 22:51:36,003 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 18.02/8.41 [2019-03-28 22:51:36,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 18.02/8.41 [2019-03-28 22:51:36,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:51:36 BasicIcfg 18.02/8.41 [2019-03-28 22:51:36,009 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 18.02/8.41 [2019-03-28 22:51:36,010 INFO L168 Benchmark]: Toolchain (without parser) took 3379.70 ms. Allocated memory was 649.6 MB in the beginning and 752.4 MB in the end (delta: 102.8 MB). Free memory was 563.8 MB in the beginning and 638.4 MB in the end (delta: -74.6 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. 18.02/8.41 [2019-03-28 22:51:36,012 INFO L168 Benchmark]: CDTParser took 0.17 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. 18.02/8.41 [2019-03-28 22:51:36,012 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.85 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 563.8 MB in the beginning and 650.1 MB in the end (delta: -86.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 18.02/8.41 [2019-03-28 22:51:36,013 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.87 ms. Allocated memory is still 683.7 MB. Free memory was 650.1 MB in the beginning and 648.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 18.02/8.41 [2019-03-28 22:51:36,013 INFO L168 Benchmark]: Boogie Preprocessor took 19.35 ms. Allocated memory is still 683.7 MB. Free memory was 648.7 MB in the beginning and 645.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 18.02/8.41 [2019-03-28 22:51:36,014 INFO L168 Benchmark]: RCFGBuilder took 193.25 ms. Allocated memory is still 683.7 MB. Free memory was 645.6 MB in the beginning and 632.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 50.3 GB. 18.02/8.41 [2019-03-28 22:51:36,014 INFO L168 Benchmark]: BlockEncodingV2 took 69.94 ms. Allocated memory is still 683.7 MB. Free memory was 632.6 MB in the beginning and 628.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 50.3 GB. 18.02/8.41 [2019-03-28 22:51:36,015 INFO L168 Benchmark]: TraceAbstraction took 156.16 ms. Allocated memory is still 683.7 MB. Free memory was 627.2 MB in the beginning and 619.0 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. 18.02/8.41 [2019-03-28 22:51:36,015 INFO L168 Benchmark]: BuchiAutomizer took 2623.00 ms. Allocated memory was 683.7 MB in the beginning and 752.4 MB in the end (delta: 68.7 MB). Free memory was 619.0 MB in the beginning and 638.4 MB in the end (delta: -19.3 MB). Peak memory consumption was 49.4 MB. Max. memory is 50.3 GB. 18.02/8.41 [2019-03-28 22:51:36,020 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 18.02/8.41 --- Results --- 18.02/8.41 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 18.02/8.41 - StatisticsResult: Initial Icfg 18.02/8.41 8 locations, 11 edges 18.02/8.41 - StatisticsResult: Encoded RCFG 18.02/8.41 3 locations, 4 edges 18.02/8.41 * Results from de.uni_freiburg.informatik.ultimate.core: 18.02/8.41 - StatisticsResult: Toolchain Benchmarks 18.02/8.41 Benchmark results are: 18.02/8.41 * CDTParser took 0.17 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. 18.02/8.41 * CACSL2BoogieTranslator took 277.85 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 563.8 MB in the beginning and 650.1 MB in the end (delta: -86.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 18.02/8.41 * Boogie Procedure Inliner took 34.87 ms. Allocated memory is still 683.7 MB. Free memory was 650.1 MB in the beginning and 648.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 18.02/8.41 * Boogie Preprocessor took 19.35 ms. Allocated memory is still 683.7 MB. Free memory was 648.7 MB in the beginning and 645.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 18.02/8.41 * RCFGBuilder took 193.25 ms. Allocated memory is still 683.7 MB. Free memory was 645.6 MB in the beginning and 632.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 50.3 GB. 18.02/8.41 * BlockEncodingV2 took 69.94 ms. Allocated memory is still 683.7 MB. Free memory was 632.6 MB in the beginning and 628.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 50.3 GB. 18.02/8.41 * TraceAbstraction took 156.16 ms. Allocated memory is still 683.7 MB. Free memory was 627.2 MB in the beginning and 619.0 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. 18.02/8.41 * BuchiAutomizer took 2623.00 ms. Allocated memory was 683.7 MB in the beginning and 752.4 MB in the end (delta: 68.7 MB). Free memory was 619.0 MB in the beginning and 638.4 MB in the end (delta: -19.3 MB). Peak memory consumption was 49.4 MB. Max. memory is 50.3 GB. 18.02/8.41 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 18.02/8.41 - AllSpecificationsHoldResult: All specifications hold 18.02/8.41 We were not able to verify any specifiation because the program does not contain any specification. 18.02/8.41 - InvariantResult [Line: 19]: Loop Invariant 18.02/8.41 Derived loop invariant: 1 18.02/8.41 - InvariantResult [Line: 21]: Loop Invariant 18.02/8.41 Derived loop invariant: 1 18.02/8.41 - StatisticsResult: Ultimate Automizer benchmark data 18.02/8.41 CFG has 1 procedures, 3 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=3occurred 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, 2 LocationsWithAnnotation, 2 PreInvPairs, 2 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 18.02/8.41 - StatisticsResult: Constructed decomposition of program 18.02/8.41 Your program was decomposed into 11 terminating modules (9 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -2 * x1 + 21 and consists of 3 locations. One nondeterministic module has affine ranking function x2 and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. 18.02/8.41 - StatisticsResult: Timing statistics 18.02/8.41 BüchiAutomizer plugin needed 2.5s and 12 iterations. TraceHistogramMax:9. Analysis of lassos took 2.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 45/45 HoareTripleCheckerStatistics: 37 SDtfs, 12 SDslu, 1 SDs, 0 SdLazy, 126 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax197 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s 18.02/8.41 - TerminationAnalysisResult: Termination proven 18.02/8.41 Buchi Automizer proved that your program is terminating 18.02/8.41 RESULT: Ultimate proved your program to be correct! 18.02/8.41 !SESSION 2019-03-28 22:51:28.721 ----------------------------------------------- 18.02/8.41 eclipse.buildId=unknown 18.02/8.41 java.version=1.8.0_181 18.02/8.41 java.vendor=Oracle Corporation 18.02/8.41 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 18.02/8.41 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 18.02/8.41 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 18.02/8.41 18.02/8.41 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 22:51:36.252 18.02/8.41 !MESSAGE The workspace will exit with unsaved changes in this session. 18.02/8.41 Received shutdown request... 18.02/8.41 Ultimate: 18.02/8.41 GTK+ Version Check 18.02/8.41 EOF