20.65/9.24 YES 20.65/9.24 20.65/9.24 Ultimate: Cannot open display: 20.65/9.24 This is Ultimate 0.1.24-8dc7c08-m 20.65/9.24 [2019-03-28 22:48:15,613 INFO L170 SettingsManager]: Resetting all preferences to default values... 20.65/9.24 [2019-03-28 22:48:15,616 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 20.65/9.24 [2019-03-28 22:48:15,627 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 20.65/9.24 [2019-03-28 22:48:15,627 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 20.65/9.24 [2019-03-28 22:48:15,628 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 20.65/9.24 [2019-03-28 22:48:15,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 20.65/9.24 [2019-03-28 22:48:15,631 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 20.65/9.24 [2019-03-28 22:48:15,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 20.65/9.24 [2019-03-28 22:48:15,633 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 20.65/9.24 [2019-03-28 22:48:15,634 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 20.65/9.24 [2019-03-28 22:48:15,634 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 20.65/9.24 [2019-03-28 22:48:15,635 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 20.65/9.24 [2019-03-28 22:48:15,636 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 20.65/9.24 [2019-03-28 22:48:15,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 20.65/9.24 [2019-03-28 22:48:15,638 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 20.65/9.24 [2019-03-28 22:48:15,639 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 20.65/9.24 [2019-03-28 22:48:15,641 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 20.65/9.24 [2019-03-28 22:48:15,643 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 20.65/9.24 [2019-03-28 22:48:15,644 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 20.65/9.24 [2019-03-28 22:48:15,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 20.65/9.24 [2019-03-28 22:48:15,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 20.65/9.24 [2019-03-28 22:48:15,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 20.65/9.24 [2019-03-28 22:48:15,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 20.65/9.24 [2019-03-28 22:48:15,649 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 20.65/9.24 [2019-03-28 22:48:15,650 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 20.65/9.24 [2019-03-28 22:48:15,650 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 20.65/9.24 [2019-03-28 22:48:15,651 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 20.65/9.24 [2019-03-28 22:48:15,651 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 20.65/9.24 [2019-03-28 22:48:15,652 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 20.65/9.24 [2019-03-28 22:48:15,652 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 20.65/9.24 [2019-03-28 22:48:15,653 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 20.65/9.24 [2019-03-28 22:48:15,654 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 20.65/9.24 [2019-03-28 22:48:15,654 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 20.65/9.24 [2019-03-28 22:48:15,655 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 20.65/9.24 [2019-03-28 22:48:15,655 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 20.65/9.24 [2019-03-28 22:48:15,655 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 20.65/9.24 [2019-03-28 22:48:15,656 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 20.65/9.24 [2019-03-28 22:48:15,657 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 20.65/9.24 [2019-03-28 22:48:15,657 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 20.65/9.24 [2019-03-28 22:48:15,672 INFO L110 SettingsManager]: Loading preferences was successful 20.65/9.24 [2019-03-28 22:48:15,672 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 20.65/9.24 [2019-03-28 22:48:15,673 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 20.65/9.24 [2019-03-28 22:48:15,673 INFO L133 SettingsManager]: * Rewrite not-equals=true 20.65/9.24 [2019-03-28 22:48:15,674 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 20.65/9.24 [2019-03-28 22:48:15,674 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 20.65/9.24 [2019-03-28 22:48:15,674 INFO L133 SettingsManager]: * Use SBE=true 20.65/9.24 [2019-03-28 22:48:15,674 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 20.65/9.24 [2019-03-28 22:48:15,674 INFO L133 SettingsManager]: * Use old map elimination=false 20.65/9.24 [2019-03-28 22:48:15,674 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 20.65/9.24 [2019-03-28 22:48:15,675 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 20.65/9.24 [2019-03-28 22:48:15,675 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 20.65/9.24 [2019-03-28 22:48:15,675 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 20.65/9.24 [2019-03-28 22:48:15,675 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 20.65/9.24 [2019-03-28 22:48:15,675 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:15,675 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 20.65/9.24 [2019-03-28 22:48:15,676 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 20.65/9.24 [2019-03-28 22:48:15,676 INFO L133 SettingsManager]: * Check division by zero=IGNORE 20.65/9.24 [2019-03-28 22:48:15,676 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 20.65/9.24 [2019-03-28 22:48:15,676 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 20.65/9.24 [2019-03-28 22:48:15,676 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 20.65/9.24 [2019-03-28 22:48:15,676 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 20.65/9.24 [2019-03-28 22:48:15,677 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 20.65/9.24 [2019-03-28 22:48:15,677 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 20.65/9.24 [2019-03-28 22:48:15,677 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.65/9.24 [2019-03-28 22:48:15,677 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 20.65/9.24 [2019-03-28 22:48:15,677 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 20.65/9.24 [2019-03-28 22:48:15,677 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 20.65/9.24 [2019-03-28 22:48:15,678 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 20.65/9.24 [2019-03-28 22:48:15,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 20.65/9.24 [2019-03-28 22:48:15,716 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 20.65/9.24 [2019-03-28 22:48:15,719 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 20.65/9.24 [2019-03-28 22:48:15,721 INFO L271 PluginConnector]: Initializing CDTParser... 20.65/9.24 [2019-03-28 22:48:15,721 INFO L276 PluginConnector]: CDTParser initialized 20.65/9.24 [2019-03-28 22:48:15,722 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 20.65/9.24 [2019-03-28 22:48:15,788 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/8e2167ade668411684eb59de13496e6e/FLAGfae150157 20.65/9.24 [2019-03-28 22:48:16,123 INFO L307 CDTParser]: Found 1 translation units. 20.65/9.24 [2019-03-28 22:48:16,124 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 20.65/9.24 [2019-03-28 22:48:16,131 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/8e2167ade668411684eb59de13496e6e/FLAGfae150157 20.65/9.24 [2019-03-28 22:48:16,528 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/8e2167ade668411684eb59de13496e6e 20.65/9.24 [2019-03-28 22:48:16,539 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 20.65/9.24 [2019-03-28 22:48:16,541 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 20.65/9.24 [2019-03-28 22:48:16,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 20.65/9.24 [2019-03-28 22:48:16,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 20.65/9.24 [2019-03-28 22:48:16,546 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 20.65/9.24 [2019-03-28 22:48:16,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:48:16" (1/1) ... 20.65/9.24 [2019-03-28 22:48:16,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4337f75f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:48:16, skipping insertion in model container 20.65/9.24 [2019-03-28 22:48:16,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:48:16" (1/1) ... 20.65/9.24 [2019-03-28 22:48:16,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 20.65/9.24 [2019-03-28 22:48:16,575 INFO L176 MainTranslator]: Built tables and reachable declarations 20.65/9.24 [2019-03-28 22:48:16,731 INFO L206 PostProcessor]: Analyzing one entry point: main 20.65/9.24 [2019-03-28 22:48:16,736 INFO L191 MainTranslator]: Completed pre-run 20.65/9.24 [2019-03-28 22:48:16,754 INFO L206 PostProcessor]: Analyzing one entry point: main 20.65/9.24 [2019-03-28 22:48:16,822 INFO L195 MainTranslator]: Completed translation 20.65/9.24 [2019-03-28 22:48:16,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:48:16 WrapperNode 20.65/9.24 [2019-03-28 22:48:16,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 20.65/9.24 [2019-03-28 22:48:16,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 20.65/9.24 [2019-03-28 22:48:16,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 20.65/9.24 [2019-03-28 22:48:16,824 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 20.65/9.24 [2019-03-28 22:48:16,834 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:48:16" (1/1) ... 20.65/9.24 [2019-03-28 22:48:16,840 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:48:16" (1/1) ... 20.65/9.24 [2019-03-28 22:48:16,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 20.65/9.24 [2019-03-28 22:48:16,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 20.65/9.24 [2019-03-28 22:48:16,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 20.65/9.24 [2019-03-28 22:48:16,862 INFO L276 PluginConnector]: Boogie Preprocessor initialized 20.65/9.24 [2019-03-28 22:48:16,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:48:16" (1/1) ... 20.65/9.24 [2019-03-28 22:48:16,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:48:16" (1/1) ... 20.65/9.24 [2019-03-28 22:48:16,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:48:16" (1/1) ... 20.65/9.24 [2019-03-28 22:48:16,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:48:16" (1/1) ... 20.65/9.24 [2019-03-28 22:48:16,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:48:16" (1/1) ... 20.65/9.24 [2019-03-28 22:48:16,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:48:16" (1/1) ... 20.65/9.24 [2019-03-28 22:48:16,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:48:16" (1/1) ... 20.65/9.24 [2019-03-28 22:48:16,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 20.65/9.24 [2019-03-28 22:48:16,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 20.65/9.24 [2019-03-28 22:48:16,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... 20.65/9.24 [2019-03-28 22:48:16,883 INFO L276 PluginConnector]: RCFGBuilder initialized 20.65/9.24 [2019-03-28 22:48:16,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:48:16" (1/1) ... 20.65/9.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.24 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 20.65/9.24 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.65/9.24 [2019-03-28 22:48:16,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 20.65/9.24 [2019-03-28 22:48:16,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 20.65/9.24 [2019-03-28 22:48:17,103 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 20.65/9.24 [2019-03-28 22:48:17,104 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 20.65/9.24 [2019-03-28 22:48:17,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:48:17 BoogieIcfgContainer 20.65/9.24 [2019-03-28 22:48:17,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 20.65/9.24 [2019-03-28 22:48:17,106 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 20.65/9.24 [2019-03-28 22:48:17,106 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 20.65/9.24 [2019-03-28 22:48:17,108 INFO L276 PluginConnector]: BlockEncodingV2 initialized 20.65/9.24 [2019-03-28 22:48:17,109 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:48:17" (1/1) ... 20.65/9.24 [2019-03-28 22:48:17,126 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 13 edges 20.65/9.24 [2019-03-28 22:48:17,127 INFO L258 BlockEncoder]: Using Remove infeasible edges 20.65/9.24 [2019-03-28 22:48:17,128 INFO L263 BlockEncoder]: Using Maximize final states 20.65/9.24 [2019-03-28 22:48:17,129 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 20.65/9.24 [2019-03-28 22:48:17,129 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 20.65/9.24 [2019-03-28 22:48:17,131 INFO L296 BlockEncoder]: Using Remove sink states 20.65/9.24 [2019-03-28 22:48:17,132 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 20.65/9.24 [2019-03-28 22:48:17,132 INFO L179 BlockEncoder]: Using Rewrite not-equals 20.65/9.24 [2019-03-28 22:48:17,161 INFO L185 BlockEncoder]: Using Use SBE 20.65/9.24 [2019-03-28 22:48:17,179 INFO L200 BlockEncoder]: SBE split 4 edges 20.65/9.24 [2019-03-28 22:48:17,184 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 20.65/9.24 [2019-03-28 22:48:17,186 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.65/9.24 [2019-03-28 22:48:17,198 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 20.65/9.24 [2019-03-28 22:48:17,200 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states 20.65/9.24 [2019-03-28 22:48:17,201 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 20.65/9.24 [2019-03-28 22:48:17,202 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.65/9.24 [2019-03-28 22:48:17,202 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 20.65/9.24 [2019-03-28 22:48:17,202 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 20.65/9.24 [2019-03-28 22:48:17,203 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 11 edges 20.65/9.24 [2019-03-28 22:48:17,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:48:17 BasicIcfg 20.65/9.24 [2019-03-28 22:48:17,203 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 20.65/9.24 [2019-03-28 22:48:17,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 20.65/9.24 [2019-03-28 22:48:17,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... 20.65/9.24 [2019-03-28 22:48:17,209 INFO L276 PluginConnector]: TraceAbstraction initialized 20.65/9.24 [2019-03-28 22:48:17,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 10:48:16" (1/4) ... 20.65/9.24 [2019-03-28 22:48:17,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3ef84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:48:17, skipping insertion in model container 20.65/9.24 [2019-03-28 22:48:17,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:48:16" (2/4) ... 20.65/9.24 [2019-03-28 22:48:17,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3ef84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:48:17, skipping insertion in model container 20.65/9.24 [2019-03-28 22:48:17,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:48:17" (3/4) ... 20.65/9.24 [2019-03-28 22:48:17,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3ef84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:48:17, skipping insertion in model container 20.65/9.24 [2019-03-28 22:48:17,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:48:17" (4/4) ... 20.65/9.24 [2019-03-28 22:48:17,213 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.65/9.24 [2019-03-28 22:48:17,224 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 20.65/9.24 [2019-03-28 22:48:17,232 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 20.65/9.24 [2019-03-28 22:48:17,252 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 20.65/9.24 [2019-03-28 22:48:17,283 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.65/9.24 [2019-03-28 22:48:17,284 INFO L382 AbstractCegarLoop]: Interprodecural is true 20.65/9.24 [2019-03-28 22:48:17,284 INFO L383 AbstractCegarLoop]: Hoare is true 20.65/9.24 [2019-03-28 22:48:17,284 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 20.65/9.24 [2019-03-28 22:48:17,285 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 20.65/9.24 [2019-03-28 22:48:17,285 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.65/9.24 [2019-03-28 22:48:17,285 INFO L387 AbstractCegarLoop]: Difference is false 20.65/9.24 [2019-03-28 22:48:17,285 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 20.65/9.24 [2019-03-28 22:48:17,286 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 20.65/9.24 [2019-03-28 22:48:17,301 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. 20.65/9.24 [2019-03-28 22:48:17,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 20.65/9.24 [2019-03-28 22:48:17,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. 20.65/9.24 [2019-03-28 22:48:17,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 20.65/9.24 [2019-03-28 22:48:17,360 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 30) no Hoare annotation was computed. 20.65/9.24 [2019-03-28 22:48:17,361 INFO L451 ceAbstractionStarter]: At program point L27-2(lines 19 32) the Hoare annotation is: true 20.65/9.24 [2019-03-28 22:48:17,361 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. 20.65/9.24 [2019-03-28 22:48:17,361 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 31) no Hoare annotation was computed. 20.65/9.24 [2019-03-28 22:48:17,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:48:17 BasicIcfg 20.65/9.24 [2019-03-28 22:48:17,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 20.65/9.24 [2019-03-28 22:48:17,370 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 20.65/9.24 [2019-03-28 22:48:17,370 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 20.65/9.24 [2019-03-28 22:48:17,373 INFO L276 PluginConnector]: BuchiAutomizer initialized 20.65/9.24 [2019-03-28 22:48:17,374 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.65/9.24 [2019-03-28 22:48:17,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 10:48:16" (1/5) ... 20.65/9.24 [2019-03-28 22:48:17,375 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3662230c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:48:17, skipping insertion in model container 20.65/9.24 [2019-03-28 22:48:17,375 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.65/9.24 [2019-03-28 22:48:17,375 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:48:16" (2/5) ... 20.65/9.24 [2019-03-28 22:48:17,375 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3662230c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:48:17, skipping insertion in model container 20.65/9.24 [2019-03-28 22:48:17,376 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.65/9.24 [2019-03-28 22:48:17,376 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:48:17" (3/5) ... 20.65/9.24 [2019-03-28 22:48:17,376 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3662230c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:48:17, skipping insertion in model container 20.65/9.24 [2019-03-28 22:48:17,376 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.65/9.24 [2019-03-28 22:48:17,377 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:48:17" (4/5) ... 20.65/9.24 [2019-03-28 22:48:17,377 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3662230c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:48:17, skipping insertion in model container 20.65/9.24 [2019-03-28 22:48:17,377 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.65/9.24 [2019-03-28 22:48:17,377 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:48:17" (5/5) ... 20.65/9.24 [2019-03-28 22:48:17,379 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.65/9.24 [2019-03-28 22:48:17,405 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.65/9.24 [2019-03-28 22:48:17,405 INFO L374 BuchiCegarLoop]: Interprodecural is true 20.65/9.24 [2019-03-28 22:48:17,405 INFO L375 BuchiCegarLoop]: Hoare is true 20.65/9.24 [2019-03-28 22:48:17,405 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 20.65/9.24 [2019-03-28 22:48:17,405 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 20.65/9.24 [2019-03-28 22:48:17,406 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.65/9.24 [2019-03-28 22:48:17,406 INFO L379 BuchiCegarLoop]: Difference is false 20.65/9.24 [2019-03-28 22:48:17,406 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 20.65/9.24 [2019-03-28 22:48:17,406 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 20.65/9.24 [2019-03-28 22:48:17,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 20.65/9.24 [2019-03-28 22:48:17,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 20.65/9.24 [2019-03-28 22:48:17,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.65/9.24 [2019-03-28 22:48:17,427 INFO L119 BuchiIsEmpty]: Starting construction of run 20.65/9.24 [2019-03-28 22:48:17,434 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 20.65/9.24 [2019-03-28 22:48:17,434 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.65/9.24 [2019-03-28 22:48:17,434 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 20.65/9.24 [2019-03-28 22:48:17,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 20.65/9.24 [2019-03-28 22:48:17,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 20.65/9.24 [2019-03-28 22:48:17,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.65/9.24 [2019-03-28 22:48:17,435 INFO L119 BuchiIsEmpty]: Starting construction of run 20.65/9.24 [2019-03-28 22:48:17,435 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 20.65/9.24 [2019-03-28 22:48:17,436 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.65/9.24 [2019-03-28 22:48:17,441 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 6#L27-2true 20.65/9.24 [2019-03-28 22:48:17,441 INFO L796 eck$LassoCheckResult]: Loop: 6#L27-2true [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 7#L20true [55] L20-->L27: Formula: (and (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1))) (> 0 v_ULTIMATE.start_main_~b~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 4#L27true [37] L27-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 6#L27-2true 20.65/9.24 [2019-03-28 22:48:17,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.24 [2019-03-28 22:48:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash 66, now seen corresponding path program 1 times 20.65/9.24 [2019-03-28 22:48:17,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.24 [2019-03-28 22:48:17,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.24 [2019-03-28 22:48:17,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:17,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:17,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.24 [2019-03-28 22:48:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.24 [2019-03-28 22:48:17,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.24 [2019-03-28 22:48:17,521 INFO L82 PathProgramCache]: Analyzing trace with hash 74778, now seen corresponding path program 1 times 20.65/9.24 [2019-03-28 22:48:17,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.24 [2019-03-28 22:48:17,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.24 [2019-03-28 22:48:17,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:17,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:17,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.24 [2019-03-28 22:48:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.24 [2019-03-28 22:48:17,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.24 [2019-03-28 22:48:17,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2011193, now seen corresponding path program 1 times 20.65/9.24 [2019-03-28 22:48:17,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.24 [2019-03-28 22:48:17,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.24 [2019-03-28 22:48:17,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:17,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:17,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.24 [2019-03-28 22:48:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.24 [2019-03-28 22:48:17,615 INFO L216 LassoAnalysis]: Preferences: 20.65/9.24 [2019-03-28 22:48:17,616 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.65/9.24 [2019-03-28 22:48:17,616 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.65/9.24 [2019-03-28 22:48:17,616 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.65/9.24 [2019-03-28 22:48:17,617 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.65/9.24 [2019-03-28 22:48:17,617 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:17,617 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.65/9.24 [2019-03-28 22:48:17,617 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.65/9.24 [2019-03-28 22:48:17,617 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 20.65/9.24 [2019-03-28 22:48:17,617 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.65/9.24 [2019-03-28 22:48:17,618 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.65/9.24 [2019-03-28 22:48:17,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:17,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:17,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:17,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:17,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:17,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:17,785 INFO L300 LassoAnalysis]: Preprocessing complete. 20.65/9.24 [2019-03-28 22:48:17,786 INFO L412 LassoAnalysis]: Checking for nontermination... 20.65/9.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.24 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.24 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:17,810 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.24 [2019-03-28 22:48:17,810 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.24 [2019-03-28 22:48:17,843 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.24 [2019-03-28 22:48:17,843 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~b~0=-1} Honda state: {ULTIMATE.start_main_~b~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.65/9.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.24 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.24 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:17,850 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.24 [2019-03-28 22:48:17,851 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.24 [2019-03-28 22:48:17,878 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.24 [2019-03-28 22:48:17,878 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: [] 20.65/9.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.24 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.24 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:17,883 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.24 [2019-03-28 22:48:17,883 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.24 [2019-03-28 22:48:17,910 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.24 [2019-03-28 22:48:17,910 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: [] 20.65/9.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.24 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.24 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:17,916 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.24 [2019-03-28 22:48:17,916 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.24 [2019-03-28 22:48:17,920 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.24 [2019-03-28 22:48:17,921 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.65/9.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.24 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.24 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:17,949 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.24 [2019-03-28 22:48:17,949 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.24 [2019-03-28 22:48:17,977 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.24 [2019-03-28 22:48:17,977 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.65/9.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.24 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.24 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:17,982 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.24 [2019-03-28 22:48:17,982 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.24 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.24 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:18,013 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.65/9.24 [2019-03-28 22:48:18,013 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.24 [2019-03-28 22:48:18,046 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.65/9.24 [2019-03-28 22:48:18,048 INFO L216 LassoAnalysis]: Preferences: 20.65/9.24 [2019-03-28 22:48:18,048 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.65/9.24 [2019-03-28 22:48:18,048 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.65/9.24 [2019-03-28 22:48:18,048 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.65/9.24 [2019-03-28 22:48:18,049 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.65/9.24 [2019-03-28 22:48:18,049 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:18,049 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.65/9.24 [2019-03-28 22:48:18,049 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.65/9.24 [2019-03-28 22:48:18,049 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 20.65/9.24 [2019-03-28 22:48:18,049 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.65/9.24 [2019-03-28 22:48:18,050 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.65/9.24 [2019-03-28 22:48:18,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,171 INFO L300 LassoAnalysis]: Preprocessing complete. 20.65/9.24 [2019-03-28 22:48:18,177 INFO L497 LassoAnalysis]: Using template 'affine'. 20.65/9.24 [2019-03-28 22:48:18,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.24 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.24 Number of strict supporting invariants: 0 20.65/9.24 Number of non-strict supporting invariants: 1 20.65/9.24 Consider only non-deceasing supporting invariants: true 20.65/9.24 Simplify termination arguments: true 20.65/9.24 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.24 [2019-03-28 22:48:18,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.24 [2019-03-28 22:48:18,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.65/9.24 [2019-03-28 22:48:18,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.24 [2019-03-28 22:48:18,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.24 [2019-03-28 22:48:18,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.24 [2019-03-28 22:48:18,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.65/9.24 [2019-03-28 22:48:18,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.65/9.24 [2019-03-28 22:48:18,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.65/9.24 [2019-03-28 22:48:18,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.24 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.24 Number of strict supporting invariants: 0 20.65/9.24 Number of non-strict supporting invariants: 1 20.65/9.24 Consider only non-deceasing supporting invariants: true 20.65/9.24 Simplify termination arguments: true 20.65/9.24 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.24 [2019-03-28 22:48:18,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.24 [2019-03-28 22:48:18,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.24 [2019-03-28 22:48:18,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.24 [2019-03-28 22:48:18,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.24 [2019-03-28 22:48:18,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.65/9.24 [2019-03-28 22:48:18,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.65/9.24 [2019-03-28 22:48:18,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.65/9.24 [2019-03-28 22:48:18,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.24 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.24 Number of strict supporting invariants: 0 20.65/9.24 Number of non-strict supporting invariants: 1 20.65/9.24 Consider only non-deceasing supporting invariants: true 20.65/9.24 Simplify termination arguments: true 20.65/9.24 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.24 [2019-03-28 22:48:18,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.24 [2019-03-28 22:48:18,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.65/9.24 [2019-03-28 22:48:18,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.24 [2019-03-28 22:48:18,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.24 [2019-03-28 22:48:18,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.24 [2019-03-28 22:48:18,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.65/9.24 [2019-03-28 22:48:18,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.65/9.24 [2019-03-28 22:48:18,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.65/9.24 [2019-03-28 22:48:18,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.24 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.24 Number of strict supporting invariants: 0 20.65/9.24 Number of non-strict supporting invariants: 1 20.65/9.24 Consider only non-deceasing supporting invariants: true 20.65/9.24 Simplify termination arguments: true 20.65/9.24 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.24 [2019-03-28 22:48:18,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.24 [2019-03-28 22:48:18,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.24 [2019-03-28 22:48:18,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.24 [2019-03-28 22:48:18,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.24 [2019-03-28 22:48:18,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.65/9.24 [2019-03-28 22:48:18,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.65/9.24 [2019-03-28 22:48:18,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.65/9.24 [2019-03-28 22:48:18,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.24 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.24 Number of strict supporting invariants: 0 20.65/9.24 Number of non-strict supporting invariants: 1 20.65/9.24 Consider only non-deceasing supporting invariants: true 20.65/9.24 Simplify termination arguments: true 20.65/9.24 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.24 [2019-03-28 22:48:18,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.24 [2019-03-28 22:48:18,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.65/9.24 [2019-03-28 22:48:18,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.24 [2019-03-28 22:48:18,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.24 [2019-03-28 22:48:18,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.24 [2019-03-28 22:48:18,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.65/9.24 [2019-03-28 22:48:18,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.65/9.24 [2019-03-28 22:48:18,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.65/9.24 [2019-03-28 22:48:18,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.24 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.24 Number of strict supporting invariants: 0 20.65/9.24 Number of non-strict supporting invariants: 1 20.65/9.24 Consider only non-deceasing supporting invariants: true 20.65/9.24 Simplify termination arguments: true 20.65/9.24 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.24 [2019-03-28 22:48:18,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.24 [2019-03-28 22:48:18,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.65/9.24 [2019-03-28 22:48:18,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.24 [2019-03-28 22:48:18,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.24 [2019-03-28 22:48:18,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.24 [2019-03-28 22:48:18,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.65/9.24 [2019-03-28 22:48:18,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.65/9.24 [2019-03-28 22:48:18,225 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.65/9.24 [2019-03-28 22:48:18,230 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.65/9.24 [2019-03-28 22:48:18,230 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 20.65/9.24 [2019-03-28 22:48:18,232 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.65/9.24 [2019-03-28 22:48:18,232 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.65/9.24 [2019-03-28 22:48:18,233 INFO L518 LassoAnalysis]: Proved termination. 20.65/9.24 [2019-03-28 22:48:18,233 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.65/9.24 Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 20.65/9.24 Supporting invariants [] 20.65/9.24 [2019-03-28 22:48:18,235 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.65/9.24 [2019-03-28 22:48:18,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.24 [2019-03-28 22:48:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.24 [2019-03-28 22:48:18,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core 20.65/9.24 [2019-03-28 22:48:18,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.24 [2019-03-28 22:48:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.24 [2019-03-28 22:48:18,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.65/9.24 [2019-03-28 22:48:18,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.24 [2019-03-28 22:48:18,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.65/9.24 [2019-03-28 22:48:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.24 [2019-03-28 22:48:18,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.65/9.24 [2019-03-28 22:48:18,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.24 [2019-03-28 22:48:18,383 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 20.65/9.24 [2019-03-28 22:48:18,389 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 20.65/9.24 [2019-03-28 22:48:18,390 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states. Second operand 4 states. 20.65/9.24 [2019-03-28 22:48:18,452 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states.. Second operand 4 states. Result 18 states and 38 transitions. Complement of second has 8 states. 20.65/9.24 [2019-03-28 22:48:18,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 20.65/9.24 [2019-03-28 22:48:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.65/9.24 [2019-03-28 22:48:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. 20.65/9.24 [2019-03-28 22:48:18,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 1 letters. Loop has 3 letters. 20.65/9.24 [2019-03-28 22:48:18,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.24 [2019-03-28 22:48:18,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 3 letters. 20.65/9.24 [2019-03-28 22:48:18,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.24 [2019-03-28 22:48:18,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 1 letters. Loop has 6 letters. 20.65/9.24 [2019-03-28 22:48:18,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.24 [2019-03-28 22:48:18,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 38 transitions. 20.65/9.24 [2019-03-28 22:48:18,468 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 20.65/9.24 [2019-03-28 22:48:18,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 15 states and 32 transitions. 20.65/9.24 [2019-03-28 22:48:18,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 20.65/9.24 [2019-03-28 22:48:18,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 20.65/9.24 [2019-03-28 22:48:18,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 32 transitions. 20.65/9.24 [2019-03-28 22:48:18,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.65/9.24 [2019-03-28 22:48:18,475 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 32 transitions. 20.65/9.24 [2019-03-28 22:48:18,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 32 transitions. 20.65/9.24 [2019-03-28 22:48:18,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. 20.65/9.24 [2019-03-28 22:48:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 20.65/9.24 [2019-03-28 22:48:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. 20.65/9.24 [2019-03-28 22:48:18,508 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 24 transitions. 20.65/9.24 [2019-03-28 22:48:18,508 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 24 transitions. 20.65/9.24 [2019-03-28 22:48:18,508 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 20.65/9.24 [2019-03-28 22:48:18,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 24 transitions. 20.65/9.24 [2019-03-28 22:48:18,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 20.65/9.24 [2019-03-28 22:48:18,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.65/9.24 [2019-03-28 22:48:18,509 INFO L119 BuchiIsEmpty]: Starting construction of run 20.65/9.24 [2019-03-28 22:48:18,510 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 20.65/9.24 [2019-03-28 22:48:18,510 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.65/9.24 [2019-03-28 22:48:18,511 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 73#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 82#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 79#L22 20.65/9.24 [2019-03-28 22:48:18,511 INFO L796 eck$LassoCheckResult]: Loop: 79#L22 [39] L22-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4] 75#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 80#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 79#L22 20.65/9.24 [2019-03-28 22:48:18,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.24 [2019-03-28 22:48:18,512 INFO L82 PathProgramCache]: Analyzing trace with hash 64867, now seen corresponding path program 1 times 20.65/9.24 [2019-03-28 22:48:18,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.24 [2019-03-28 22:48:18,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.24 [2019-03-28 22:48:18,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:18,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:18,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.24 [2019-03-28 22:48:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.24 [2019-03-28 22:48:18,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.24 [2019-03-28 22:48:18,526 INFO L82 PathProgramCache]: Analyzing trace with hash 68711, now seen corresponding path program 1 times 20.65/9.24 [2019-03-28 22:48:18,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.24 [2019-03-28 22:48:18,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.24 [2019-03-28 22:48:18,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:18,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:18,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.24 [2019-03-28 22:48:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.24 [2019-03-28 22:48:18,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.24 [2019-03-28 22:48:18,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1932491717, now seen corresponding path program 1 times 20.65/9.24 [2019-03-28 22:48:18,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.24 [2019-03-28 22:48:18,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.24 [2019-03-28 22:48:18,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:18,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:18,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.24 [2019-03-28 22:48:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.24 [2019-03-28 22:48:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.24 [2019-03-28 22:48:18,582 INFO L216 LassoAnalysis]: Preferences: 20.65/9.24 [2019-03-28 22:48:18,583 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.65/9.24 [2019-03-28 22:48:18,583 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.65/9.24 [2019-03-28 22:48:18,583 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.65/9.24 [2019-03-28 22:48:18,583 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.65/9.24 [2019-03-28 22:48:18,584 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:18,584 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.65/9.24 [2019-03-28 22:48:18,584 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.65/9.24 [2019-03-28 22:48:18,584 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 20.65/9.24 [2019-03-28 22:48:18,584 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.65/9.24 [2019-03-28 22:48:18,584 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.65/9.24 [2019-03-28 22:48:18,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,703 INFO L300 LassoAnalysis]: Preprocessing complete. 20.65/9.24 [2019-03-28 22:48:18,703 INFO L412 LassoAnalysis]: Checking for nontermination... 20.65/9.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.24 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.24 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:18,707 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.24 [2019-03-28 22:48:18,708 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.24 [2019-03-28 22:48:18,735 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.24 [2019-03-28 22:48:18,735 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: [] 20.65/9.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.24 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.24 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:18,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.24 [2019-03-28 22:48:18,740 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.24 [2019-03-28 22:48:18,744 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.24 [2019-03-28 22:48:18,744 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~b~0=0} Honda state: {ULTIMATE.start_main_~b~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.65/9.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.24 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.24 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:18,773 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.24 [2019-03-28 22:48:18,773 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.24 [2019-03-28 22:48:18,800 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.24 [2019-03-28 22:48:18,801 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: [] 20.65/9.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.24 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.24 [2019-03-28 22:48:18,810 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.24 [2019-03-28 22:48:18,810 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.24 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:18,838 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.24 [2019-03-28 22:48:18,838 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.65/9.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.24 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.24 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:18,844 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.24 [2019-03-28 22:48:18,844 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.24 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.24 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:18,878 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.65/9.24 [2019-03-28 22:48:18,878 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.24 [2019-03-28 22:48:18,928 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.65/9.24 [2019-03-28 22:48:18,931 INFO L216 LassoAnalysis]: Preferences: 20.65/9.24 [2019-03-28 22:48:18,931 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.65/9.24 [2019-03-28 22:48:18,931 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.65/9.24 [2019-03-28 22:48:18,932 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.65/9.24 [2019-03-28 22:48:18,932 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.65/9.24 [2019-03-28 22:48:18,932 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.65/9.24 [2019-03-28 22:48:18,932 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.65/9.24 [2019-03-28 22:48:18,932 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.65/9.24 [2019-03-28 22:48:18,932 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 20.65/9.24 [2019-03-28 22:48:18,932 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.65/9.24 [2019-03-28 22:48:18,932 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.65/9.24 [2019-03-28 22:48:18,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:18,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.24 [2019-03-28 22:48:19,028 INFO L300 LassoAnalysis]: Preprocessing complete. 20.65/9.24 [2019-03-28 22:48:19,028 INFO L497 LassoAnalysis]: Using template 'affine'. 20.65/9.24 [2019-03-28 22:48:19,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.24 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.24 Number of strict supporting invariants: 0 20.65/9.24 Number of non-strict supporting invariants: 1 20.65/9.24 Consider only non-deceasing supporting invariants: true 20.65/9.24 Simplify termination arguments: true 20.65/9.24 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.24 [2019-03-28 22:48:19,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.24 [2019-03-28 22:48:19,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.24 [2019-03-28 22:48:19,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.24 [2019-03-28 22:48:19,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.24 [2019-03-28 22:48:19,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.65/9.24 [2019-03-28 22:48:19,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.65/9.24 [2019-03-28 22:48:19,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.65/9.24 [2019-03-28 22:48:19,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.24 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.24 Number of strict supporting invariants: 0 20.65/9.24 Number of non-strict supporting invariants: 1 20.65/9.24 Consider only non-deceasing supporting invariants: true 20.65/9.24 Simplify termination arguments: true 20.65/9.24 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.24 [2019-03-28 22:48:19,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.24 [2019-03-28 22:48:19,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.65/9.24 [2019-03-28 22:48:19,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.24 [2019-03-28 22:48:19,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.24 [2019-03-28 22:48:19,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.24 [2019-03-28 22:48:19,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.65/9.24 [2019-03-28 22:48:19,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.65/9.24 [2019-03-28 22:48:19,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.65/9.24 [2019-03-28 22:48:19,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.24 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.24 Number of strict supporting invariants: 0 20.65/9.24 Number of non-strict supporting invariants: 1 20.65/9.24 Consider only non-deceasing supporting invariants: true 20.65/9.24 Simplify termination arguments: true 20.65/9.24 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.24 [2019-03-28 22:48:19,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.24 [2019-03-28 22:48:19,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.65/9.24 [2019-03-28 22:48:19,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.24 [2019-03-28 22:48:19,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.24 [2019-03-28 22:48:19,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.24 [2019-03-28 22:48:19,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.65/9.24 [2019-03-28 22:48:19,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.65/9.24 [2019-03-28 22:48:19,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.65/9.24 [2019-03-28 22:48:19,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.24 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.24 Number of strict supporting invariants: 0 20.65/9.24 Number of non-strict supporting invariants: 1 20.65/9.24 Consider only non-deceasing supporting invariants: true 20.65/9.24 Simplify termination arguments: true 20.65/9.24 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.24 [2019-03-28 22:48:19,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.24 [2019-03-28 22:48:19,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.65/9.24 [2019-03-28 22:48:19,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.24 [2019-03-28 22:48:19,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.24 [2019-03-28 22:48:19,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.24 [2019-03-28 22:48:19,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.65/9.24 [2019-03-28 22:48:19,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.65/9.24 [2019-03-28 22:48:19,049 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.65/9.24 [2019-03-28 22:48:19,053 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.65/9.24 [2019-03-28 22:48:19,053 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 20.65/9.24 [2019-03-28 22:48:19,054 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.65/9.24 [2019-03-28 22:48:19,054 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.65/9.24 [2019-03-28 22:48:19,054 INFO L518 LassoAnalysis]: Proved termination. 20.65/9.24 [2019-03-28 22:48:19,054 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.65/9.24 Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~n~0 - 2*ULTIMATE.start_main_~y~0 + 1 20.65/9.24 Supporting invariants [] 20.65/9.24 [2019-03-28 22:48:19,055 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.65/9.24 [2019-03-28 22:48:19,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.24 [2019-03-28 22:48:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.24 [2019-03-28 22:48:19,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core 20.65/9.24 [2019-03-28 22:48:19,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.24 [2019-03-28 22:48:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.24 [2019-03-28 22:48:19,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 20.65/9.24 [2019-03-28 22:48:19,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.24 [2019-03-28 22:48:19,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.65/9.24 [2019-03-28 22:48:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.24 [2019-03-28 22:48:19,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 20.65/9.24 [2019-03-28 22:48:19,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.24 [2019-03-28 22:48:19,136 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 20.65/9.24 [2019-03-28 22:48:19,136 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 20.65/9.24 [2019-03-28 22:48:19,136 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 24 transitions. cyclomatic complexity: 15 Second operand 4 states. 20.65/9.24 [2019-03-28 22:48:19,194 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 24 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 19 states and 46 transitions. Complement of second has 8 states. 20.65/9.24 [2019-03-28 22:48:19,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 20.65/9.24 [2019-03-28 22:48:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.65/9.24 [2019-03-28 22:48:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. 20.65/9.24 [2019-03-28 22:48:19,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 3 letters. Loop has 3 letters. 20.65/9.24 [2019-03-28 22:48:19,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.24 [2019-03-28 22:48:19,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 3 letters. 20.65/9.24 [2019-03-28 22:48:19,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.24 [2019-03-28 22:48:19,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 3 letters. Loop has 6 letters. 20.65/9.24 [2019-03-28 22:48:19,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.24 [2019-03-28 22:48:19,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 46 transitions. 20.65/9.24 [2019-03-28 22:48:19,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 20.65/9.24 [2019-03-28 22:48:19,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 38 transitions. 20.65/9.24 [2019-03-28 22:48:19,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 20.65/9.24 [2019-03-28 22:48:19,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 20.65/9.24 [2019-03-28 22:48:19,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 38 transitions. 20.65/9.24 [2019-03-28 22:48:19,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.65/9.24 [2019-03-28 22:48:19,203 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 38 transitions. 20.65/9.24 [2019-03-28 22:48:19,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 38 transitions. 20.65/9.24 [2019-03-28 22:48:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 20.65/9.24 [2019-03-28 22:48:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 20.65/9.24 [2019-03-28 22:48:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 38 transitions. 20.65/9.24 [2019-03-28 22:48:19,206 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 38 transitions. 20.65/9.24 [2019-03-28 22:48:19,206 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 38 transitions. 20.65/9.24 [2019-03-28 22:48:19,206 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 20.65/9.24 [2019-03-28 22:48:19,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 38 transitions. 20.65/9.24 [2019-03-28 22:48:19,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 20.65/9.24 [2019-03-28 22:48:19,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.65/9.24 [2019-03-28 22:48:19,207 INFO L119 BuchiIsEmpty]: Starting construction of run 20.65/9.24 [2019-03-28 22:48:19,207 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 20.65/9.24 [2019-03-28 22:48:19,208 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] 20.65/9.24 [2019-03-28 22:48:19,208 INFO L794 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 155#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 167#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 161#L22 20.65/9.25 [2019-03-28 22:48:19,208 INFO L796 eck$LassoCheckResult]: Loop: 161#L22 [39] L22-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4] 163#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 165#L20 [55] L20-->L27: Formula: (and (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1))) (> 0 v_ULTIMATE.start_main_~b~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 156#L27 [37] L27-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 157#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 168#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 161#L22 20.65/9.25 [2019-03-28 22:48:19,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:19,208 INFO L82 PathProgramCache]: Analyzing trace with hash 64867, now seen corresponding path program 2 times 20.65/9.25 [2019-03-28 22:48:19,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.25 [2019-03-28 22:48:19,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.25 [2019-03-28 22:48:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:19,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:19,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2047274518, now seen corresponding path program 1 times 20.65/9.25 [2019-03-28 22:48:19,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.25 [2019-03-28 22:48:19,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.25 [2019-03-28 22:48:19,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.65/9.25 [2019-03-28 22:48:19,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.65/9.25 [2019-03-28 22:48:19,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.65/9.25 [2019-03-28 22:48:19,261 INFO L811 eck$LassoCheckResult]: loop already infeasible 20.65/9.25 [2019-03-28 22:48:19,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.65/9.25 [2019-03-28 22:48:19,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.65/9.25 [2019-03-28 22:48:19,265 INFO L87 Difference]: Start difference. First operand 16 states and 38 transitions. cyclomatic complexity: 24 Second operand 3 states. 20.65/9.25 [2019-03-28 22:48:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.65/9.25 [2019-03-28 22:48:19,291 INFO L93 Difference]: Finished difference Result 24 states and 52 transitions. 20.65/9.25 [2019-03-28 22:48:19,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.65/9.25 [2019-03-28 22:48:19,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 52 transitions. 20.65/9.25 [2019-03-28 22:48:19,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 20.65/9.25 [2019-03-28 22:48:19,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 50 transitions. 20.65/9.25 [2019-03-28 22:48:19,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 20.65/9.25 [2019-03-28 22:48:19,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 20.65/9.25 [2019-03-28 22:48:19,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 50 transitions. 20.65/9.25 [2019-03-28 22:48:19,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.65/9.25 [2019-03-28 22:48:19,298 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 50 transitions. 20.65/9.25 [2019-03-28 22:48:19,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 50 transitions. 20.65/9.25 [2019-03-28 22:48:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 20.65/9.25 [2019-03-28 22:48:19,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 20.65/9.25 [2019-03-28 22:48:19,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 50 transitions. 20.65/9.25 [2019-03-28 22:48:19,301 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 50 transitions. 20.65/9.25 [2019-03-28 22:48:19,301 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 50 transitions. 20.65/9.25 [2019-03-28 22:48:19,301 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 20.65/9.25 [2019-03-28 22:48:19,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 50 transitions. 20.65/9.25 [2019-03-28 22:48:19,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 20.65/9.25 [2019-03-28 22:48:19,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.65/9.25 [2019-03-28 22:48:19,302 INFO L119 BuchiIsEmpty]: Starting construction of run 20.65/9.25 [2019-03-28 22:48:19,303 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 20.65/9.25 [2019-03-28 22:48:19,303 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] 20.65/9.25 [2019-03-28 22:48:19,303 INFO L794 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 201#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 213#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 209#L22 20.65/9.25 [2019-03-28 22:48:19,304 INFO L796 eck$LassoCheckResult]: Loop: 209#L22 [39] L22-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4] 211#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 219#L20 [56] L20-->L27: Formula: (and (< 0 v_ULTIMATE.start_main_~b~0_8) (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 218#L27 [37] L27-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 204#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 217#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 209#L22 20.65/9.25 [2019-03-28 22:48:19,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:19,305 INFO L82 PathProgramCache]: Analyzing trace with hash 64867, now seen corresponding path program 3 times 20.65/9.25 [2019-03-28 22:48:19,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.25 [2019-03-28 22:48:19,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.25 [2019-03-28 22:48:19,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:19,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:19,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2047304309, now seen corresponding path program 1 times 20.65/9.25 [2019-03-28 22:48:19,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.25 [2019-03-28 22:48:19,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.25 [2019-03-28 22:48:19,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.65/9.25 [2019-03-28 22:48:19,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.65/9.25 [2019-03-28 22:48:19,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.65/9.25 [2019-03-28 22:48:19,331 INFO L811 eck$LassoCheckResult]: loop already infeasible 20.65/9.25 [2019-03-28 22:48:19,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.65/9.25 [2019-03-28 22:48:19,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.65/9.25 [2019-03-28 22:48:19,332 INFO L87 Difference]: Start difference. First operand 22 states and 50 transitions. cyclomatic complexity: 30 Second operand 3 states. 20.65/9.25 [2019-03-28 22:48:19,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.65/9.25 [2019-03-28 22:48:19,352 INFO L93 Difference]: Finished difference Result 32 states and 58 transitions. 20.65/9.25 [2019-03-28 22:48:19,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.65/9.25 [2019-03-28 22:48:19,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 58 transitions. 20.65/9.25 [2019-03-28 22:48:19,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 20.65/9.25 [2019-03-28 22:48:19,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 28 states and 51 transitions. 20.65/9.25 [2019-03-28 22:48:19,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 20.65/9.25 [2019-03-28 22:48:19,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 20.65/9.25 [2019-03-28 22:48:19,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 51 transitions. 20.65/9.25 [2019-03-28 22:48:19,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.65/9.25 [2019-03-28 22:48:19,357 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 51 transitions. 20.65/9.25 [2019-03-28 22:48:19,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 51 transitions. 20.65/9.25 [2019-03-28 22:48:19,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. 20.65/9.25 [2019-03-28 22:48:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 20.65/9.25 [2019-03-28 22:48:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 49 transitions. 20.65/9.25 [2019-03-28 22:48:19,360 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 49 transitions. 20.65/9.25 [2019-03-28 22:48:19,361 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 49 transitions. 20.65/9.25 [2019-03-28 22:48:19,361 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 20.65/9.25 [2019-03-28 22:48:19,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 49 transitions. 20.65/9.25 [2019-03-28 22:48:19,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 20.65/9.25 [2019-03-28 22:48:19,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.65/9.25 [2019-03-28 22:48:19,362 INFO L119 BuchiIsEmpty]: Starting construction of run 20.65/9.25 [2019-03-28 22:48:19,363 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 20.65/9.25 [2019-03-28 22:48:19,363 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] 20.65/9.25 [2019-03-28 22:48:19,363 INFO L794 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 261#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 275#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 269#L22 20.65/9.25 [2019-03-28 22:48:19,364 INFO L796 eck$LassoCheckResult]: Loop: 269#L22 [57] L22-->L27-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~b~0_7 1)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~b~0] 263#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 273#L20 [56] L20-->L27: Formula: (and (< 0 v_ULTIMATE.start_main_~b~0_8) (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 262#L27 [59] L27-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_9 0) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 (- 1))) (> 0 |v_ULTIMATE.start_main_#t~nondet5_3|)) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 264#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 279#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 269#L22 20.65/9.25 [2019-03-28 22:48:19,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:19,364 INFO L82 PathProgramCache]: Analyzing trace with hash 64867, now seen corresponding path program 4 times 20.65/9.25 [2019-03-28 22:48:19,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.25 [2019-03-28 22:48:19,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.25 [2019-03-28 22:48:19,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:19,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:19,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1732317127, now seen corresponding path program 1 times 20.65/9.25 [2019-03-28 22:48:19,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.25 [2019-03-28 22:48:19,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.25 [2019-03-28 22:48:19,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:19,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:19,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1634786331, now seen corresponding path program 1 times 20.65/9.25 [2019-03-28 22:48:19,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.25 [2019-03-28 22:48:19,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.25 [2019-03-28 22:48:19,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:19,487 INFO L216 LassoAnalysis]: Preferences: 20.65/9.25 [2019-03-28 22:48:19,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.65/9.25 [2019-03-28 22:48:19,488 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.65/9.25 [2019-03-28 22:48:19,488 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.65/9.25 [2019-03-28 22:48:19,488 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.65/9.25 [2019-03-28 22:48:19,488 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:19,488 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.65/9.25 [2019-03-28 22:48:19,488 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.65/9.25 [2019-03-28 22:48:19,488 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 20.65/9.25 [2019-03-28 22:48:19,488 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.65/9.25 [2019-03-28 22:48:19,489 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.65/9.25 [2019-03-28 22:48:19,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:19,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:19,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:19,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:19,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:19,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:19,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:19,582 INFO L300 LassoAnalysis]: Preprocessing complete. 20.65/9.25 [2019-03-28 22:48:19,583 INFO L412 LassoAnalysis]: Checking for nontermination... 20.65/9.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.25 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.25 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:19,586 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.25 [2019-03-28 22:48:19,586 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.25 [2019-03-28 22:48:19,614 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.25 [2019-03-28 22:48:19,614 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.65/9.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.25 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.25 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:19,618 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.25 [2019-03-28 22:48:19,619 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.25 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.25 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:19,648 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.65/9.25 [2019-03-28 22:48:19,648 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.25 [2019-03-28 22:48:19,708 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.65/9.25 [2019-03-28 22:48:19,710 INFO L216 LassoAnalysis]: Preferences: 20.65/9.25 [2019-03-28 22:48:19,710 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.65/9.25 [2019-03-28 22:48:19,710 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.65/9.25 [2019-03-28 22:48:19,711 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.65/9.25 [2019-03-28 22:48:19,711 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.65/9.25 [2019-03-28 22:48:19,711 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:19,711 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.65/9.25 [2019-03-28 22:48:19,711 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.65/9.25 [2019-03-28 22:48:19,711 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 20.65/9.25 [2019-03-28 22:48:19,711 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.65/9.25 [2019-03-28 22:48:19,711 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.65/9.25 [2019-03-28 22:48:19,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:19,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:19,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:19,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:19,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:19,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:19,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:19,797 INFO L300 LassoAnalysis]: Preprocessing complete. 20.65/9.25 [2019-03-28 22:48:19,797 INFO L497 LassoAnalysis]: Using template 'affine'. 20.65/9.25 [2019-03-28 22:48:19,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.25 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.25 Number of strict supporting invariants: 0 20.65/9.25 Number of non-strict supporting invariants: 1 20.65/9.25 Consider only non-deceasing supporting invariants: true 20.65/9.25 Simplify termination arguments: true 20.65/9.25 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.25 [2019-03-28 22:48:19,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.25 [2019-03-28 22:48:19,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.65/9.25 [2019-03-28 22:48:19,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.25 [2019-03-28 22:48:19,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.25 [2019-03-28 22:48:19,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.25 [2019-03-28 22:48:19,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.65/9.25 [2019-03-28 22:48:19,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.65/9.25 [2019-03-28 22:48:19,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.65/9.25 [2019-03-28 22:48:19,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.25 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.25 Number of strict supporting invariants: 0 20.65/9.25 Number of non-strict supporting invariants: 1 20.65/9.25 Consider only non-deceasing supporting invariants: true 20.65/9.25 Simplify termination arguments: true 20.65/9.25 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.25 [2019-03-28 22:48:19,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.25 [2019-03-28 22:48:19,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.65/9.25 [2019-03-28 22:48:19,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.25 [2019-03-28 22:48:19,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.25 [2019-03-28 22:48:19,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.25 [2019-03-28 22:48:19,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.65/9.25 [2019-03-28 22:48:19,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.65/9.25 [2019-03-28 22:48:19,806 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.65/9.25 [2019-03-28 22:48:19,808 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.65/9.25 [2019-03-28 22:48:19,808 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 20.65/9.25 [2019-03-28 22:48:19,809 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.65/9.25 [2019-03-28 22:48:19,809 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.65/9.25 [2019-03-28 22:48:19,809 INFO L518 LassoAnalysis]: Proved termination. 20.65/9.25 [2019-03-28 22:48:19,809 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.65/9.25 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 20.65/9.25 Supporting invariants [] 20.65/9.25 [2019-03-28 22:48:19,810 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.65/9.25 [2019-03-28 22:48:19,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:19,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core 20.65/9.25 [2019-03-28 22:48:19,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.25 [2019-03-28 22:48:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:19,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core 20.65/9.25 [2019-03-28 22:48:19,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.25 [2019-03-28 22:48:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.65/9.25 [2019-03-28 22:48:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:19,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core 20.65/9.25 [2019-03-28 22:48:19,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.25 [2019-03-28 22:48:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:19,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core 20.65/9.25 [2019-03-28 22:48:19,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.25 [2019-03-28 22:48:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:19,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core 20.65/9.25 [2019-03-28 22:48:19,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.25 [2019-03-28 22:48:19,932 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 20.65/9.25 [2019-03-28 22:48:19,933 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 20.65/9.25 [2019-03-28 22:48:19,933 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 49 transitions. cyclomatic complexity: 25 Second operand 5 states. 20.65/9.25 [2019-03-28 22:48:19,983 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 49 transitions. cyclomatic complexity: 25. Second operand 5 states. Result 60 states and 107 transitions. Complement of second has 12 states. 20.65/9.25 [2019-03-28 22:48:19,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 20.65/9.25 [2019-03-28 22:48:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 20.65/9.25 [2019-03-28 22:48:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. 20.65/9.25 [2019-03-28 22:48:19,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 3 letters. Loop has 6 letters. 20.65/9.25 [2019-03-28 22:48:19,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.25 [2019-03-28 22:48:19,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 9 letters. Loop has 6 letters. 20.65/9.25 [2019-03-28 22:48:19,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.25 [2019-03-28 22:48:19,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 3 letters. Loop has 12 letters. 20.65/9.25 [2019-03-28 22:48:19,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.25 [2019-03-28 22:48:19,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 107 transitions. 20.65/9.25 [2019-03-28 22:48:19,990 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 20.65/9.25 [2019-03-28 22:48:19,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 51 states and 91 transitions. 20.65/9.25 [2019-03-28 22:48:19,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 20.65/9.25 [2019-03-28 22:48:19,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 20.65/9.25 [2019-03-28 22:48:19,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 91 transitions. 20.65/9.25 [2019-03-28 22:48:19,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.65/9.25 [2019-03-28 22:48:19,992 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 91 transitions. 20.65/9.25 [2019-03-28 22:48:19,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 91 transitions. 20.65/9.25 [2019-03-28 22:48:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. 20.65/9.25 [2019-03-28 22:48:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 20.65/9.25 [2019-03-28 22:48:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 76 transitions. 20.65/9.25 [2019-03-28 22:48:19,996 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 76 transitions. 20.65/9.25 [2019-03-28 22:48:19,997 INFO L609 BuchiCegarLoop]: Abstraction has 39 states and 76 transitions. 20.65/9.25 [2019-03-28 22:48:19,997 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 20.65/9.25 [2019-03-28 22:48:19,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 76 transitions. 20.65/9.25 [2019-03-28 22:48:19,998 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 20.65/9.25 [2019-03-28 22:48:19,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.65/9.25 [2019-03-28 22:48:19,998 INFO L119 BuchiIsEmpty]: Starting construction of run 20.65/9.25 [2019-03-28 22:48:19,999 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 20.65/9.25 [2019-03-28 22:48:19,999 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.65/9.25 [2019-03-28 22:48:19,999 INFO L794 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 451#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 464#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 465#L22 [58] L22-->L27-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~b~0_7 1)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~b~0] 453#L27-2 20.65/9.25 [2019-03-28 22:48:19,999 INFO L796 eck$LassoCheckResult]: Loop: 453#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 470#L20 [56] L20-->L27: Formula: (and (< 0 v_ULTIMATE.start_main_~b~0_8) (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 452#L27 [37] L27-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 453#L27-2 20.65/9.25 [2019-03-28 22:48:19,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:20,000 INFO L82 PathProgramCache]: Analyzing trace with hash 2010935, now seen corresponding path program 1 times 20.65/9.25 [2019-03-28 22:48:20,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.25 [2019-03-28 22:48:20,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.25 [2019-03-28 22:48:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:20,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:20,010 INFO L82 PathProgramCache]: Analyzing trace with hash 74809, now seen corresponding path program 1 times 20.65/9.25 [2019-03-28 22:48:20,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.25 [2019-03-28 22:48:20,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.25 [2019-03-28 22:48:20,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:20,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:20,015 INFO L82 PathProgramCache]: Analyzing trace with hash -221732541, now seen corresponding path program 1 times 20.65/9.25 [2019-03-28 22:48:20,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.25 [2019-03-28 22:48:20,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.25 [2019-03-28 22:48:20,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:20,047 INFO L216 LassoAnalysis]: Preferences: 20.65/9.25 [2019-03-28 22:48:20,047 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.65/9.25 [2019-03-28 22:48:20,048 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.65/9.25 [2019-03-28 22:48:20,048 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.65/9.25 [2019-03-28 22:48:20,048 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.65/9.25 [2019-03-28 22:48:20,048 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:20,048 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.65/9.25 [2019-03-28 22:48:20,048 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.65/9.25 [2019-03-28 22:48:20,048 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 20.65/9.25 [2019-03-28 22:48:20,048 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.65/9.25 [2019-03-28 22:48:20,049 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.65/9.25 [2019-03-28 22:48:20,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,111 INFO L300 LassoAnalysis]: Preprocessing complete. 20.65/9.25 [2019-03-28 22:48:20,111 INFO L412 LassoAnalysis]: Checking for nontermination... 20.65/9.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.25 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.25 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:20,114 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.25 [2019-03-28 22:48:20,114 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.25 [2019-03-28 22:48:20,118 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.25 [2019-03-28 22:48:20,118 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.65/9.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.25 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.25 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:20,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.25 [2019-03-28 22:48:20,145 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.25 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.25 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:20,174 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.65/9.25 [2019-03-28 22:48:20,174 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.25 [2019-03-28 22:48:20,205 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.65/9.25 [2019-03-28 22:48:20,207 INFO L216 LassoAnalysis]: Preferences: 20.65/9.25 [2019-03-28 22:48:20,207 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.65/9.25 [2019-03-28 22:48:20,207 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.65/9.25 [2019-03-28 22:48:20,207 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.65/9.25 [2019-03-28 22:48:20,207 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.65/9.25 [2019-03-28 22:48:20,207 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:20,207 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.65/9.25 [2019-03-28 22:48:20,208 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.65/9.25 [2019-03-28 22:48:20,208 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 20.65/9.25 [2019-03-28 22:48:20,208 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.65/9.25 [2019-03-28 22:48:20,208 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.65/9.25 [2019-03-28 22:48:20,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,268 INFO L300 LassoAnalysis]: Preprocessing complete. 20.65/9.25 [2019-03-28 22:48:20,269 INFO L497 LassoAnalysis]: Using template 'affine'. 20.65/9.25 [2019-03-28 22:48:20,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.25 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.25 Number of strict supporting invariants: 0 20.65/9.25 Number of non-strict supporting invariants: 1 20.65/9.25 Consider only non-deceasing supporting invariants: true 20.65/9.25 Simplify termination arguments: true 20.65/9.25 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.25 [2019-03-28 22:48:20,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.25 [2019-03-28 22:48:20,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.65/9.25 [2019-03-28 22:48:20,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.25 [2019-03-28 22:48:20,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.25 [2019-03-28 22:48:20,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.25 [2019-03-28 22:48:20,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.65/9.25 [2019-03-28 22:48:20,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.65/9.25 [2019-03-28 22:48:20,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.65/9.25 [2019-03-28 22:48:20,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.25 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.25 Number of strict supporting invariants: 0 20.65/9.25 Number of non-strict supporting invariants: 1 20.65/9.25 Consider only non-deceasing supporting invariants: true 20.65/9.25 Simplify termination arguments: true 20.65/9.25 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.25 [2019-03-28 22:48:20,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.25 [2019-03-28 22:48:20,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.65/9.25 [2019-03-28 22:48:20,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.25 [2019-03-28 22:48:20,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.25 [2019-03-28 22:48:20,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.25 [2019-03-28 22:48:20,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.65/9.25 [2019-03-28 22:48:20,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.65/9.25 [2019-03-28 22:48:20,277 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.65/9.25 [2019-03-28 22:48:20,279 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.65/9.25 [2019-03-28 22:48:20,279 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 20.65/9.25 [2019-03-28 22:48:20,279 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.65/9.25 [2019-03-28 22:48:20,279 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.65/9.25 [2019-03-28 22:48:20,280 INFO L518 LassoAnalysis]: Proved termination. 20.65/9.25 [2019-03-28 22:48:20,280 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.65/9.25 Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 20.65/9.25 Supporting invariants [] 20.65/9.25 [2019-03-28 22:48:20,280 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.65/9.25 [2019-03-28 22:48:20,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:20,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core 20.65/9.25 [2019-03-28 22:48:20,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.25 [2019-03-28 22:48:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:20,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.65/9.25 [2019-03-28 22:48:20,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.25 [2019-03-28 22:48:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.65/9.25 [2019-03-28 22:48:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:20,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.65/9.25 [2019-03-28 22:48:20,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.25 [2019-03-28 22:48:20,346 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 20.65/9.25 [2019-03-28 22:48:20,346 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 20.65/9.25 [2019-03-28 22:48:20,346 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 39 states and 76 transitions. cyclomatic complexity: 42 Second operand 4 states. 20.65/9.25 [2019-03-28 22:48:20,392 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 39 states and 76 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 110 states and 176 transitions. Complement of second has 14 states. 20.65/9.25 [2019-03-28 22:48:20,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 20.65/9.25 [2019-03-28 22:48:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.65/9.25 [2019-03-28 22:48:20,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. 20.65/9.25 [2019-03-28 22:48:20,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 3 letters. 20.65/9.25 [2019-03-28 22:48:20,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.25 [2019-03-28 22:48:20,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 3 letters. 20.65/9.25 [2019-03-28 22:48:20,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.25 [2019-03-28 22:48:20,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 6 letters. 20.65/9.25 [2019-03-28 22:48:20,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.25 [2019-03-28 22:48:20,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 176 transitions. 20.65/9.25 [2019-03-28 22:48:20,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 20.65/9.25 [2019-03-28 22:48:20,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 68 states and 121 transitions. 20.65/9.25 [2019-03-28 22:48:20,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 20.65/9.25 [2019-03-28 22:48:20,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 20.65/9.25 [2019-03-28 22:48:20,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 121 transitions. 20.65/9.25 [2019-03-28 22:48:20,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.65/9.25 [2019-03-28 22:48:20,401 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 121 transitions. 20.65/9.25 [2019-03-28 22:48:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 121 transitions. 20.65/9.25 [2019-03-28 22:48:20,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. 20.65/9.25 [2019-03-28 22:48:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. 20.65/9.25 [2019-03-28 22:48:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 93 transitions. 20.65/9.25 [2019-03-28 22:48:20,405 INFO L729 BuchiCegarLoop]: Abstraction has 49 states and 93 transitions. 20.65/9.25 [2019-03-28 22:48:20,405 INFO L609 BuchiCegarLoop]: Abstraction has 49 states and 93 transitions. 20.65/9.25 [2019-03-28 22:48:20,405 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 20.65/9.25 [2019-03-28 22:48:20,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 93 transitions. 20.65/9.25 [2019-03-28 22:48:20,406 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 20.65/9.25 [2019-03-28 22:48:20,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.65/9.25 [2019-03-28 22:48:20,407 INFO L119 BuchiIsEmpty]: Starting construction of run 20.65/9.25 [2019-03-28 22:48:20,407 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 20.65/9.25 [2019-03-28 22:48:20,407 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.65/9.25 [2019-03-28 22:48:20,407 INFO L794 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 661#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 685#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 708#L22 [57] L22-->L27-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~b~0_7 1)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~b~0] 663#L27-2 20.65/9.25 [2019-03-28 22:48:20,408 INFO L796 eck$LassoCheckResult]: Loop: 663#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 683#L20 [56] L20-->L27: Formula: (and (< 0 v_ULTIMATE.start_main_~b~0_8) (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 662#L27 [37] L27-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 663#L27-2 20.65/9.25 [2019-03-28 22:48:20,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:20,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2010934, now seen corresponding path program 1 times 20.65/9.25 [2019-03-28 22:48:20,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.25 [2019-03-28 22:48:20,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.25 [2019-03-28 22:48:20,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:20,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:20,417 INFO L82 PathProgramCache]: Analyzing trace with hash 74809, now seen corresponding path program 2 times 20.65/9.25 [2019-03-28 22:48:20,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.25 [2019-03-28 22:48:20,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.25 [2019-03-28 22:48:20,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:20,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:20,422 INFO L82 PathProgramCache]: Analyzing trace with hash -221762332, now seen corresponding path program 1 times 20.65/9.25 [2019-03-28 22:48:20,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.25 [2019-03-28 22:48:20,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.25 [2019-03-28 22:48:20,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:20,452 INFO L216 LassoAnalysis]: Preferences: 20.65/9.25 [2019-03-28 22:48:20,452 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.65/9.25 [2019-03-28 22:48:20,452 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.65/9.25 [2019-03-28 22:48:20,452 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.65/9.25 [2019-03-28 22:48:20,452 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.65/9.25 [2019-03-28 22:48:20,452 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:20,452 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.65/9.25 [2019-03-28 22:48:20,453 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.65/9.25 [2019-03-28 22:48:20,453 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 20.65/9.25 [2019-03-28 22:48:20,453 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.65/9.25 [2019-03-28 22:48:20,453 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.65/9.25 [2019-03-28 22:48:20,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,511 INFO L300 LassoAnalysis]: Preprocessing complete. 20.65/9.25 [2019-03-28 22:48:20,511 INFO L412 LassoAnalysis]: Checking for nontermination... 20.65/9.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.25 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.25 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:20,514 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.25 [2019-03-28 22:48:20,514 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.25 [2019-03-28 22:48:20,518 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.25 [2019-03-28 22:48:20,518 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.65/9.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.25 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.25 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:20,544 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.25 [2019-03-28 22:48:20,544 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.25 [2019-03-28 22:48:20,571 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.25 [2019-03-28 22:48:20,571 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.65/9.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.25 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.25 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:20,574 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.25 [2019-03-28 22:48:20,575 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.25 [2019-03-28 22:48:20,601 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.25 [2019-03-28 22:48:20,601 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.65/9.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.25 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.25 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:20,605 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.25 [2019-03-28 22:48:20,605 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.25 [2019-03-28 22:48:20,631 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.25 [2019-03-28 22:48:20,631 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.65/9.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.25 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.25 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:20,635 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.25 [2019-03-28 22:48:20,635 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.25 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.25 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:20,664 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.65/9.25 [2019-03-28 22:48:20,664 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.25 [2019-03-28 22:48:20,694 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.65/9.25 [2019-03-28 22:48:20,695 INFO L216 LassoAnalysis]: Preferences: 20.65/9.25 [2019-03-28 22:48:20,696 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.65/9.25 [2019-03-28 22:48:20,696 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.65/9.25 [2019-03-28 22:48:20,696 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.65/9.25 [2019-03-28 22:48:20,696 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.65/9.25 [2019-03-28 22:48:20,696 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:20,696 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.65/9.25 [2019-03-28 22:48:20,696 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.65/9.25 [2019-03-28 22:48:20,696 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 20.65/9.25 [2019-03-28 22:48:20,697 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.65/9.25 [2019-03-28 22:48:20,697 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.65/9.25 [2019-03-28 22:48:20,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,760 INFO L300 LassoAnalysis]: Preprocessing complete. 20.65/9.25 [2019-03-28 22:48:20,760 INFO L497 LassoAnalysis]: Using template 'affine'. 20.65/9.25 [2019-03-28 22:48:20,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.25 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.25 Number of strict supporting invariants: 0 20.65/9.25 Number of non-strict supporting invariants: 1 20.65/9.25 Consider only non-deceasing supporting invariants: true 20.65/9.25 Simplify termination arguments: true 20.65/9.25 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.25 [2019-03-28 22:48:20,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.25 [2019-03-28 22:48:20,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.65/9.25 [2019-03-28 22:48:20,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.25 [2019-03-28 22:48:20,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.25 [2019-03-28 22:48:20,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.25 [2019-03-28 22:48:20,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.65/9.25 [2019-03-28 22:48:20,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.65/9.25 [2019-03-28 22:48:20,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.65/9.25 [2019-03-28 22:48:20,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.25 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.25 Number of strict supporting invariants: 0 20.65/9.25 Number of non-strict supporting invariants: 1 20.65/9.25 Consider only non-deceasing supporting invariants: true 20.65/9.25 Simplify termination arguments: true 20.65/9.25 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.25 [2019-03-28 22:48:20,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.25 [2019-03-28 22:48:20,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.25 [2019-03-28 22:48:20,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.25 [2019-03-28 22:48:20,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.25 [2019-03-28 22:48:20,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.65/9.25 [2019-03-28 22:48:20,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.65/9.25 [2019-03-28 22:48:20,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.65/9.25 [2019-03-28 22:48:20,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.25 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.25 Number of strict supporting invariants: 0 20.65/9.25 Number of non-strict supporting invariants: 1 20.65/9.25 Consider only non-deceasing supporting invariants: true 20.65/9.25 Simplify termination arguments: true 20.65/9.25 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.25 [2019-03-28 22:48:20,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.25 [2019-03-28 22:48:20,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.25 [2019-03-28 22:48:20,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.25 [2019-03-28 22:48:20,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.25 [2019-03-28 22:48:20,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.65/9.25 [2019-03-28 22:48:20,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.65/9.25 [2019-03-28 22:48:20,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.65/9.25 [2019-03-28 22:48:20,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.25 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.25 Number of strict supporting invariants: 0 20.65/9.25 Number of non-strict supporting invariants: 1 20.65/9.25 Consider only non-deceasing supporting invariants: true 20.65/9.25 Simplify termination arguments: true 20.65/9.25 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.25 [2019-03-28 22:48:20,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.25 [2019-03-28 22:48:20,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.65/9.25 [2019-03-28 22:48:20,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.25 [2019-03-28 22:48:20,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.25 [2019-03-28 22:48:20,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.25 [2019-03-28 22:48:20,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.65/9.25 [2019-03-28 22:48:20,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.65/9.25 [2019-03-28 22:48:20,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.65/9.25 [2019-03-28 22:48:20,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.25 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.25 Number of strict supporting invariants: 0 20.65/9.25 Number of non-strict supporting invariants: 1 20.65/9.25 Consider only non-deceasing supporting invariants: true 20.65/9.25 Simplify termination arguments: true 20.65/9.25 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.25 [2019-03-28 22:48:20,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.25 [2019-03-28 22:48:20,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.65/9.25 [2019-03-28 22:48:20,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.25 [2019-03-28 22:48:20,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.25 [2019-03-28 22:48:20,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.25 [2019-03-28 22:48:20,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.65/9.25 [2019-03-28 22:48:20,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.65/9.25 [2019-03-28 22:48:20,781 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.65/9.25 [2019-03-28 22:48:20,783 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.65/9.25 [2019-03-28 22:48:20,783 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 20.65/9.25 [2019-03-28 22:48:20,783 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.65/9.25 [2019-03-28 22:48:20,783 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.65/9.25 [2019-03-28 22:48:20,783 INFO L518 LassoAnalysis]: Proved termination. 20.65/9.25 [2019-03-28 22:48:20,784 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.65/9.25 Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 20.65/9.25 Supporting invariants [] 20.65/9.25 [2019-03-28 22:48:20,784 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.65/9.25 [2019-03-28 22:48:20,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:20,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core 20.65/9.25 [2019-03-28 22:48:20,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.25 [2019-03-28 22:48:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:20,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.65/9.25 [2019-03-28 22:48:20,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.25 [2019-03-28 22:48:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.65/9.25 [2019-03-28 22:48:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:20,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.65/9.25 [2019-03-28 22:48:20,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.25 [2019-03-28 22:48:20,850 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 20.65/9.25 [2019-03-28 22:48:20,850 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 20.65/9.25 [2019-03-28 22:48:20,850 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 49 states and 93 transitions. cyclomatic complexity: 49 Second operand 4 states. 20.65/9.25 [2019-03-28 22:48:20,894 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 49 states and 93 transitions. cyclomatic complexity: 49. Second operand 4 states. Result 116 states and 186 transitions. Complement of second has 14 states. 20.65/9.25 [2019-03-28 22:48:20,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 20.65/9.25 [2019-03-28 22:48:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.65/9.25 [2019-03-28 22:48:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. 20.65/9.25 [2019-03-28 22:48:20,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 3 letters. 20.65/9.25 [2019-03-28 22:48:20,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.25 [2019-03-28 22:48:20,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 3 letters. 20.65/9.25 [2019-03-28 22:48:20,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.25 [2019-03-28 22:48:20,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 4 letters. Loop has 6 letters. 20.65/9.25 [2019-03-28 22:48:20,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.25 [2019-03-28 22:48:20,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 186 transitions. 20.65/9.25 [2019-03-28 22:48:20,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 20.65/9.25 [2019-03-28 22:48:20,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 76 states and 134 transitions. 20.65/9.25 [2019-03-28 22:48:20,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 20.65/9.25 [2019-03-28 22:48:20,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 20.65/9.25 [2019-03-28 22:48:20,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 134 transitions. 20.65/9.25 [2019-03-28 22:48:20,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.65/9.25 [2019-03-28 22:48:20,902 INFO L706 BuchiCegarLoop]: Abstraction has 76 states and 134 transitions. 20.65/9.25 [2019-03-28 22:48:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 134 transitions. 20.65/9.25 [2019-03-28 22:48:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 49. 20.65/9.25 [2019-03-28 22:48:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. 20.65/9.25 [2019-03-28 22:48:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 90 transitions. 20.65/9.25 [2019-03-28 22:48:20,906 INFO L729 BuchiCegarLoop]: Abstraction has 49 states and 90 transitions. 20.65/9.25 [2019-03-28 22:48:20,906 INFO L609 BuchiCegarLoop]: Abstraction has 49 states and 90 transitions. 20.65/9.25 [2019-03-28 22:48:20,906 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 20.65/9.25 [2019-03-28 22:48:20,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 90 transitions. 20.65/9.25 [2019-03-28 22:48:20,907 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 20.65/9.25 [2019-03-28 22:48:20,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.65/9.25 [2019-03-28 22:48:20,908 INFO L119 BuchiIsEmpty]: Starting construction of run 20.65/9.25 [2019-03-28 22:48:20,908 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] 20.65/9.25 [2019-03-28 22:48:20,908 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 20.65/9.25 [2019-03-28 22:48:20,909 INFO L794 eck$LassoCheckResult]: Stem: 886#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) (= v_ULTIMATE.start_main_~b~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~b~0] 887#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 901#L20 [46] L20-->L22: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 1)) (= 0 v_ULTIMATE.start_main_~b~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 925#L22 [39] L22-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4] 896#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 908#L20 [55] L20-->L27: Formula: (and (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1))) (> 0 v_ULTIMATE.start_main_~b~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 888#L27 20.65/9.25 [2019-03-28 22:48:20,909 INFO L796 eck$LassoCheckResult]: Loop: 888#L27 [37] L27-->L27-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 889#L27-2 [45] L27-2-->L20: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_7) (<= 0 v_ULTIMATE.start_main_~x~0_7) (<= v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 907#L20 [55] L20-->L27: Formula: (and (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_11 (- 1))) (> 0 v_ULTIMATE.start_main_~b~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 888#L27 20.65/9.25 [2019-03-28 22:48:20,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:20,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1932491726, now seen corresponding path program 1 times 20.65/9.25 [2019-03-28 22:48:20,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.25 [2019-03-28 22:48:20,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.25 [2019-03-28 22:48:20,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.65/9.25 [2019-03-28 22:48:20,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.65/9.25 [2019-03-28 22:48:20,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.65/9.25 [2019-03-28 22:48:20,924 INFO L799 eck$LassoCheckResult]: stem already infeasible 20.65/9.25 [2019-03-28 22:48:20,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:20,925 INFO L82 PathProgramCache]: Analyzing trace with hash 66798, now seen corresponding path program 2 times 20.65/9.25 [2019-03-28 22:48:20,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.65/9.25 [2019-03-28 22:48:20,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.65/9.25 [2019-03-28 22:48:20,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.65/9.25 [2019-03-28 22:48:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.65/9.25 [2019-03-28 22:48:20,953 INFO L216 LassoAnalysis]: Preferences: 20.65/9.25 [2019-03-28 22:48:20,953 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.65/9.25 [2019-03-28 22:48:20,953 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.65/9.25 [2019-03-28 22:48:20,953 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.65/9.25 [2019-03-28 22:48:20,954 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.65/9.25 [2019-03-28 22:48:20,954 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:20,954 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.65/9.25 [2019-03-28 22:48:20,954 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.65/9.25 [2019-03-28 22:48:20,954 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop 20.65/9.25 [2019-03-28 22:48:20,954 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.65/9.25 [2019-03-28 22:48:20,954 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.65/9.25 [2019-03-28 22:48:20,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:20,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:21,019 INFO L300 LassoAnalysis]: Preprocessing complete. 20.65/9.25 [2019-03-28 22:48:21,019 INFO L412 LassoAnalysis]: Checking for nontermination... 20.65/9.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.25 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.25 Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:21,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.25 [2019-03-28 22:48:21,022 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.25 [2019-03-28 22:48:21,049 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.25 [2019-03-28 22:48:21,049 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.65/9.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.25 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.25 Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:21,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.25 [2019-03-28 22:48:21,054 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.25 [2019-03-28 22:48:21,080 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.65/9.25 [2019-03-28 22:48:21,081 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.65/9.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.25 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.25 Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:21,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.65/9.25 [2019-03-28 22:48:21,085 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.65/9.25 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.65/9.25 Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:21,115 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.65/9.25 [2019-03-28 22:48:21,115 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.65/9.25 [2019-03-28 22:48:21,146 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.65/9.25 [2019-03-28 22:48:21,148 INFO L216 LassoAnalysis]: Preferences: 20.65/9.25 [2019-03-28 22:48:21,148 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.65/9.25 [2019-03-28 22:48:21,148 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.65/9.25 [2019-03-28 22:48:21,148 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.65/9.25 [2019-03-28 22:48:21,148 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.65/9.25 [2019-03-28 22:48:21,148 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.65/9.25 [2019-03-28 22:48:21,148 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.65/9.25 [2019-03-28 22:48:21,149 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.65/9.25 [2019-03-28 22:48:21,149 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop 20.65/9.25 [2019-03-28 22:48:21,149 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.65/9.25 [2019-03-28 22:48:21,149 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.65/9.25 [2019-03-28 22:48:21,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:21,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:21,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:21,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:21,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:21,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.65/9.25 [2019-03-28 22:48:21,222 INFO L300 LassoAnalysis]: Preprocessing complete. 20.65/9.25 [2019-03-28 22:48:21,222 INFO L497 LassoAnalysis]: Using template 'affine'. 20.65/9.25 [2019-03-28 22:48:21,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.25 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.25 Number of strict supporting invariants: 0 20.65/9.25 Number of non-strict supporting invariants: 1 20.65/9.25 Consider only non-deceasing supporting invariants: true 20.65/9.25 Simplify termination arguments: true 20.65/9.25 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.25 [2019-03-28 22:48:21,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.25 [2019-03-28 22:48:21,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.25 [2019-03-28 22:48:21,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.25 [2019-03-28 22:48:21,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.25 [2019-03-28 22:48:21,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.65/9.25 [2019-03-28 22:48:21,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.65/9.25 [2019-03-28 22:48:21,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.65/9.25 [2019-03-28 22:48:21,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.65/9.25 Termination analysis: LINEAR_WITH_GUESSES 20.65/9.25 Number of strict supporting invariants: 0 20.65/9.25 Number of non-strict supporting invariants: 1 20.65/9.25 Consider only non-deceasing supporting invariants: true 20.65/9.25 Simplify termination arguments: true 20.65/9.25 Simplify supporting invariants: trueOverapproximate stem: false 20.65/9.25 [2019-03-28 22:48:21,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.65/9.25 [2019-03-28 22:48:21,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.65/9.25 [2019-03-28 22:48:21,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.65/9.25 [2019-03-28 22:48:21,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.65/9.25 [2019-03-28 22:48:21,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.65/9.25 [2019-03-28 22:48:21,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.65/9.25 [2019-03-28 22:48:21,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.65/9.25 [2019-03-28 22:48:21,233 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.65/9.25 [2019-03-28 22:48:21,235 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.65/9.25 [2019-03-28 22:48:21,235 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 20.65/9.25 [2019-03-28 22:48:21,235 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.65/9.25 [2019-03-28 22:48:21,235 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.65/9.25 [2019-03-28 22:48:21,235 INFO L518 LassoAnalysis]: Proved termination. 20.65/9.25 [2019-03-28 22:48:21,235 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.65/9.25 Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 20.65/9.25 Supporting invariants [] 20.65/9.25 [2019-03-28 22:48:21,236 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.65/9.25 [2019-03-28 22:48:21,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.65/9.25 [2019-03-28 22:48:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:21,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core 20.65/9.25 [2019-03-28 22:48:21,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.25 [2019-03-28 22:48:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:21,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.65/9.25 [2019-03-28 22:48:21,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.25 [2019-03-28 22:48:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.65/9.25 [2019-03-28 22:48:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.65/9.25 [2019-03-28 22:48:21,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 20.65/9.25 [2019-03-28 22:48:21,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.65/9.25 [2019-03-28 22:48:21,301 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 20.65/9.25 [2019-03-28 22:48:21,302 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 20.65/9.25 [2019-03-28 22:48:21,302 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 49 states and 90 transitions. cyclomatic complexity: 46 Second operand 4 states. 20.65/9.25 [2019-03-28 22:48:21,357 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 49 states and 90 transitions. cyclomatic complexity: 46. Second operand 4 states. Result 137 states and 237 transitions. Complement of second has 8 states. 20.65/9.25 [2019-03-28 22:48:21,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 20.65/9.25 [2019-03-28 22:48:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.65/9.25 [2019-03-28 22:48:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. 20.65/9.25 [2019-03-28 22:48:21,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 3 letters. 20.65/9.25 [2019-03-28 22:48:21,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.25 [2019-03-28 22:48:21,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 9 letters. Loop has 3 letters. 20.65/9.25 [2019-03-28 22:48:21,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.25 [2019-03-28 22:48:21,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 6 letters. 20.65/9.25 [2019-03-28 22:48:21,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.65/9.25 [2019-03-28 22:48:21,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 237 transitions. 20.65/9.25 [2019-03-28 22:48:21,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 20.65/9.25 [2019-03-28 22:48:21,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 83 states and 152 transitions. 20.65/9.25 [2019-03-28 22:48:21,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 20.65/9.25 [2019-03-28 22:48:21,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 20.65/9.25 [2019-03-28 22:48:21,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 152 transitions. 20.65/9.25 [2019-03-28 22:48:21,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.65/9.25 [2019-03-28 22:48:21,366 INFO L706 BuchiCegarLoop]: Abstraction has 83 states and 152 transitions. 20.65/9.25 [2019-03-28 22:48:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 152 transitions. 20.65/9.25 [2019-03-28 22:48:21,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 41. 20.65/9.25 [2019-03-28 22:48:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 20.65/9.25 [2019-03-28 22:48:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 78 transitions. 20.65/9.25 [2019-03-28 22:48:21,370 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 78 transitions. 20.65/9.25 [2019-03-28 22:48:21,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.65/9.25 [2019-03-28 22:48:21,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.65/9.25 [2019-03-28 22:48:21,371 INFO L87 Difference]: Start difference. First operand 41 states and 78 transitions. Second operand 3 states. 20.65/9.25 [2019-03-28 22:48:21,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.65/9.25 [2019-03-28 22:48:21,392 INFO L93 Difference]: Finished difference Result 33 states and 54 transitions. 20.65/9.25 [2019-03-28 22:48:21,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.65/9.25 [2019-03-28 22:48:21,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 54 transitions. 20.65/9.25 [2019-03-28 22:48:21,395 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.65/9.25 [2019-03-28 22:48:21,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. 20.65/9.25 [2019-03-28 22:48:21,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 20.65/9.25 [2019-03-28 22:48:21,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 20.65/9.25 [2019-03-28 22:48:21,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 20.65/9.25 [2019-03-28 22:48:21,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.65/9.25 [2019-03-28 22:48:21,395 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.65/9.25 [2019-03-28 22:48:21,395 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.65/9.25 [2019-03-28 22:48:21,396 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.65/9.25 [2019-03-28 22:48:21,396 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 20.65/9.25 [2019-03-28 22:48:21,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 20.65/9.25 [2019-03-28 22:48:21,396 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.65/9.25 [2019-03-28 22:48:21,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 20.65/9.25 [2019-03-28 22:48:21,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:48:21 BasicIcfg 20.65/9.25 [2019-03-28 22:48:21,402 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 20.65/9.25 [2019-03-28 22:48:21,403 INFO L168 Benchmark]: Toolchain (without parser) took 4862.86 ms. Allocated memory was 649.6 MB in the beginning and 743.4 MB in the end (delta: 93.8 MB). Free memory was 563.8 MB in the beginning and 355.2 MB in the end (delta: 208.6 MB). Peak memory consumption was 302.5 MB. Max. memory is 50.3 GB. 20.65/9.25 [2019-03-28 22:48:21,404 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. 20.65/9.25 [2019-03-28 22:48:21,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.60 ms. Allocated memory was 649.6 MB in the beginning and 656.9 MB in the end (delta: 7.3 MB). Free memory was 563.8 MB in the beginning and 623.3 MB in the end (delta: -59.5 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 20.65/9.25 [2019-03-28 22:48:21,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.35 ms. Allocated memory is still 656.9 MB. Free memory was 623.3 MB in the beginning and 621.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 20.65/9.25 [2019-03-28 22:48:21,406 INFO L168 Benchmark]: Boogie Preprocessor took 20.86 ms. Allocated memory is still 656.9 MB. Free memory was 621.9 MB in the beginning and 618.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 20.65/9.25 [2019-03-28 22:48:21,406 INFO L168 Benchmark]: RCFGBuilder took 222.35 ms. Allocated memory is still 656.9 MB. Free memory was 618.8 MB in the beginning and 604.6 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 20.65/9.25 [2019-03-28 22:48:21,407 INFO L168 Benchmark]: BlockEncodingV2 took 97.49 ms. Allocated memory is still 656.9 MB. Free memory was 604.6 MB in the beginning and 599.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 20.65/9.25 [2019-03-28 22:48:21,407 INFO L168 Benchmark]: TraceAbstraction took 165.09 ms. Allocated memory is still 656.9 MB. Free memory was 599.2 MB in the beginning and 589.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 20.65/9.25 [2019-03-28 22:48:21,408 INFO L168 Benchmark]: BuchiAutomizer took 4032.62 ms. Allocated memory was 656.9 MB in the beginning and 743.4 MB in the end (delta: 86.5 MB). Free memory was 589.8 MB in the beginning and 355.2 MB in the end (delta: 234.5 MB). Peak memory consumption was 321.1 MB. Max. memory is 50.3 GB. 20.65/9.25 [2019-03-28 22:48:21,412 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 20.65/9.25 --- Results --- 20.65/9.25 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 20.65/9.25 - StatisticsResult: Initial Icfg 20.65/9.25 9 locations, 13 edges 20.65/9.25 - StatisticsResult: Encoded RCFG 20.65/9.25 5 locations, 11 edges 20.65/9.25 * Results from de.uni_freiburg.informatik.ultimate.core: 20.65/9.25 - StatisticsResult: Toolchain Benchmarks 20.65/9.25 Benchmark results are: 20.65/9.25 * 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. 20.65/9.25 * CACSL2BoogieTranslator took 280.60 ms. Allocated memory was 649.6 MB in the beginning and 656.9 MB in the end (delta: 7.3 MB). Free memory was 563.8 MB in the beginning and 623.3 MB in the end (delta: -59.5 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 20.65/9.25 * Boogie Procedure Inliner took 38.35 ms. Allocated memory is still 656.9 MB. Free memory was 623.3 MB in the beginning and 621.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 20.65/9.25 * Boogie Preprocessor took 20.86 ms. Allocated memory is still 656.9 MB. Free memory was 621.9 MB in the beginning and 618.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 20.65/9.25 * RCFGBuilder took 222.35 ms. Allocated memory is still 656.9 MB. Free memory was 618.8 MB in the beginning and 604.6 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 20.65/9.25 * BlockEncodingV2 took 97.49 ms. Allocated memory is still 656.9 MB. Free memory was 604.6 MB in the beginning and 599.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 20.65/9.25 * TraceAbstraction took 165.09 ms. Allocated memory is still 656.9 MB. Free memory was 599.2 MB in the beginning and 589.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 20.65/9.25 * BuchiAutomizer took 4032.62 ms. Allocated memory was 656.9 MB in the beginning and 743.4 MB in the end (delta: 86.5 MB). Free memory was 589.8 MB in the beginning and 355.2 MB in the end (delta: 234.5 MB). Peak memory consumption was 321.1 MB. Max. memory is 50.3 GB. 20.65/9.25 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 20.65/9.25 - AllSpecificationsHoldResult: All specifications hold 20.65/9.25 We were not able to verify any specifiation because the program does not contain any specification. 20.65/9.25 - InvariantResult [Line: 19]: Loop Invariant 20.65/9.25 Derived loop invariant: 1 20.65/9.25 - StatisticsResult: Ultimate Automizer benchmark data 20.65/9.25 CFG has 1 procedures, 5 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 20.65/9.25 - StatisticsResult: Constructed decomposition of program 20.65/9.25 Your program was decomposed into 9 terminating modules (3 trivial, 0 deterministic, 6 nondeterministic). One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * n + -2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 3 locations. 20.65/9.25 - StatisticsResult: Timing statistics 20.65/9.25 BüchiAutomizer plugin needed 4.0s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 106 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 6. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 63 SDtfs, 121 SDslu, 103 SDs, 0 SdLazy, 264 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax152 hnf100 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq146 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s 20.65/9.25 - TerminationAnalysisResult: Termination proven 20.65/9.25 Buchi Automizer proved that your program is terminating 20.65/9.25 RESULT: Ultimate proved your program to be correct! 20.65/9.25 !SESSION 2019-03-28 22:48:13.299 ----------------------------------------------- 20.65/9.25 eclipse.buildId=unknown 20.65/9.25 java.version=1.8.0_181 20.65/9.25 java.vendor=Oracle Corporation 20.65/9.25 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 20.65/9.25 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 20.65/9.25 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 20.65/9.25 20.65/9.25 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 22:48:21.649 20.65/9.25 !MESSAGE The workspace will exit with unsaved changes in this session. 20.65/9.25 Received shutdown request... 20.65/9.25 Ultimate: 20.65/9.25 GTK+ Version Check 20.65/9.25 EOF