19.46/10.11 YES 19.46/10.11 19.46/10.11 Ultimate: Cannot open display: 19.46/10.11 This is Ultimate 0.1.24-8dc7c08-m 19.46/10.11 [2019-03-28 11:55:20,181 INFO L170 SettingsManager]: Resetting all preferences to default values... 19.46/10.11 [2019-03-28 11:55:20,183 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 19.46/10.11 [2019-03-28 11:55:20,195 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 19.46/10.11 [2019-03-28 11:55:20,195 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 19.46/10.11 [2019-03-28 11:55:20,196 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 19.46/10.11 [2019-03-28 11:55:20,197 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 19.46/10.11 [2019-03-28 11:55:20,199 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 19.46/10.11 [2019-03-28 11:55:20,200 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 19.46/10.11 [2019-03-28 11:55:20,201 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 19.46/10.11 [2019-03-28 11:55:20,202 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 19.46/10.11 [2019-03-28 11:55:20,202 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 19.46/10.11 [2019-03-28 11:55:20,203 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 19.46/10.11 [2019-03-28 11:55:20,204 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 19.46/10.11 [2019-03-28 11:55:20,205 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 19.46/10.11 [2019-03-28 11:55:20,206 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 19.46/10.11 [2019-03-28 11:55:20,206 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 19.46/10.11 [2019-03-28 11:55:20,208 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 19.46/10.11 [2019-03-28 11:55:20,210 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 19.46/10.11 [2019-03-28 11:55:20,212 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 19.46/10.11 [2019-03-28 11:55:20,213 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 19.46/10.11 [2019-03-28 11:55:20,214 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 19.46/10.11 [2019-03-28 11:55:20,216 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 19.46/10.11 [2019-03-28 11:55:20,216 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 19.46/10.11 [2019-03-28 11:55:20,216 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 19.46/10.11 [2019-03-28 11:55:20,217 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 19.46/10.11 [2019-03-28 11:55:20,218 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 19.46/10.11 [2019-03-28 11:55:20,219 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 19.46/10.11 [2019-03-28 11:55:20,219 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 19.46/10.11 [2019-03-28 11:55:20,219 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 19.46/10.11 [2019-03-28 11:55:20,220 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 19.46/10.11 [2019-03-28 11:55:20,221 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 19.46/10.11 [2019-03-28 11:55:20,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 19.46/10.11 [2019-03-28 11:55:20,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 19.46/10.11 [2019-03-28 11:55:20,223 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 19.46/10.11 [2019-03-28 11:55:20,223 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 19.46/10.11 [2019-03-28 11:55:20,223 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 19.46/10.11 [2019-03-28 11:55:20,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 19.46/10.11 [2019-03-28 11:55:20,225 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 19.46/10.11 [2019-03-28 11:55:20,225 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 19.46/10.11 [2019-03-28 11:55:20,240 INFO L110 SettingsManager]: Loading preferences was successful 19.46/10.11 [2019-03-28 11:55:20,240 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 19.46/10.11 [2019-03-28 11:55:20,241 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 19.46/10.11 [2019-03-28 11:55:20,241 INFO L133 SettingsManager]: * Rewrite not-equals=true 19.46/10.11 [2019-03-28 11:55:20,242 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 19.46/10.11 [2019-03-28 11:55:20,242 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 19.46/10.11 [2019-03-28 11:55:20,242 INFO L133 SettingsManager]: * Use SBE=true 19.46/10.11 [2019-03-28 11:55:20,242 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 19.46/10.11 [2019-03-28 11:55:20,242 INFO L133 SettingsManager]: * Use old map elimination=false 19.46/10.11 [2019-03-28 11:55:20,243 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 19.46/10.11 [2019-03-28 11:55:20,243 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 19.46/10.11 [2019-03-28 11:55:20,243 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 19.46/10.11 [2019-03-28 11:55:20,243 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 19.46/10.11 [2019-03-28 11:55:20,243 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 19.46/10.11 [2019-03-28 11:55:20,244 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.11 [2019-03-28 11:55:20,244 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 19.46/10.11 [2019-03-28 11:55:20,244 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 19.46/10.11 [2019-03-28 11:55:20,244 INFO L133 SettingsManager]: * Check division by zero=IGNORE 19.46/10.11 [2019-03-28 11:55:20,244 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 19.46/10.11 [2019-03-28 11:55:20,245 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 19.46/10.11 [2019-03-28 11:55:20,245 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 19.46/10.11 [2019-03-28 11:55:20,245 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 19.46/10.11 [2019-03-28 11:55:20,245 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 19.46/10.11 [2019-03-28 11:55:20,245 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 19.46/10.11 [2019-03-28 11:55:20,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.46/10.11 [2019-03-28 11:55:20,246 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 19.46/10.11 [2019-03-28 11:55:20,246 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 19.46/10.11 [2019-03-28 11:55:20,246 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 19.46/10.11 [2019-03-28 11:55:20,246 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 19.46/10.11 [2019-03-28 11:55:20,272 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 19.46/10.11 [2019-03-28 11:55:20,286 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 19.46/10.11 [2019-03-28 11:55:20,289 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 19.46/10.11 [2019-03-28 11:55:20,291 INFO L271 PluginConnector]: Initializing CDTParser... 19.46/10.11 [2019-03-28 11:55:20,291 INFO L276 PluginConnector]: CDTParser initialized 19.46/10.11 [2019-03-28 11:55:20,292 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 19.46/10.11 [2019-03-28 11:55:20,361 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/23c8c1907f1d4e829adbb461316fd0e5/FLAG5b7332996 19.46/10.11 [2019-03-28 11:55:20,911 INFO L307 CDTParser]: Found 1 translation units. 19.46/10.11 [2019-03-28 11:55:20,911 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 19.46/10.11 [2019-03-28 11:55:20,918 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/23c8c1907f1d4e829adbb461316fd0e5/FLAG5b7332996 19.46/10.11 [2019-03-28 11:55:21,316 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/23c8c1907f1d4e829adbb461316fd0e5 19.46/10.11 [2019-03-28 11:55:21,328 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 19.46/10.11 [2019-03-28 11:55:21,330 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 19.46/10.11 [2019-03-28 11:55:21,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 19.46/10.11 [2019-03-28 11:55:21,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 19.46/10.11 [2019-03-28 11:55:21,335 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 19.46/10.11 [2019-03-28 11:55:21,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:55:21" (1/1) ... 19.46/10.11 [2019-03-28 11:55:21,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648b22bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:21, skipping insertion in model container 19.46/10.11 [2019-03-28 11:55:21,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:55:21" (1/1) ... 19.46/10.11 [2019-03-28 11:55:21,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 19.46/10.11 [2019-03-28 11:55:21,364 INFO L176 MainTranslator]: Built tables and reachable declarations 19.46/10.11 [2019-03-28 11:55:21,524 INFO L206 PostProcessor]: Analyzing one entry point: main 19.46/10.11 [2019-03-28 11:55:21,529 INFO L191 MainTranslator]: Completed pre-run 19.46/10.11 [2019-03-28 11:55:21,545 INFO L206 PostProcessor]: Analyzing one entry point: main 19.46/10.11 [2019-03-28 11:55:21,561 INFO L195 MainTranslator]: Completed translation 19.46/10.11 [2019-03-28 11:55:21,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:21 WrapperNode 19.46/10.11 [2019-03-28 11:55:21,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 19.46/10.11 [2019-03-28 11:55:21,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 19.46/10.11 [2019-03-28 11:55:21,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 19.46/10.11 [2019-03-28 11:55:21,562 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 19.46/10.11 [2019-03-28 11:55:21,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:21" (1/1) ... 19.46/10.11 [2019-03-28 11:55:21,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:21" (1/1) ... 19.46/10.11 [2019-03-28 11:55:21,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 19.46/10.11 [2019-03-28 11:55:21,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 19.46/10.11 [2019-03-28 11:55:21,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 19.46/10.11 [2019-03-28 11:55:21,663 INFO L276 PluginConnector]: Boogie Preprocessor initialized 19.46/10.11 [2019-03-28 11:55:21,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:21" (1/1) ... 19.46/10.11 [2019-03-28 11:55:21,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:21" (1/1) ... 19.46/10.11 [2019-03-28 11:55:21,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:21" (1/1) ... 19.46/10.11 [2019-03-28 11:55:21,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:21" (1/1) ... 19.46/10.11 [2019-03-28 11:55:21,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:21" (1/1) ... 19.46/10.11 [2019-03-28 11:55:21,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:21" (1/1) ... 19.46/10.11 [2019-03-28 11:55:21,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:21" (1/1) ... 19.46/10.11 [2019-03-28 11:55:21,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 19.46/10.11 [2019-03-28 11:55:21,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 19.46/10.11 [2019-03-28 11:55:21,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... 19.46/10.11 [2019-03-28 11:55:21,685 INFO L276 PluginConnector]: RCFGBuilder initialized 19.46/10.11 [2019-03-28 11:55:21,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:21" (1/1) ... 19.46/10.11 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.11 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 19.46/10.11 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.46/10.11 [2019-03-28 11:55:21,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 19.46/10.11 [2019-03-28 11:55:21,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 19.46/10.11 [2019-03-28 11:55:21,907 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 19.46/10.11 [2019-03-28 11:55:21,908 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. 19.46/10.11 [2019-03-28 11:55:21,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:55:21 BoogieIcfgContainer 19.46/10.11 [2019-03-28 11:55:21,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 19.46/10.11 [2019-03-28 11:55:21,910 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 19.46/10.11 [2019-03-28 11:55:21,910 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 19.46/10.11 [2019-03-28 11:55:21,912 INFO L276 PluginConnector]: BlockEncodingV2 initialized 19.46/10.11 [2019-03-28 11:55:21,913 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:55:21" (1/1) ... 19.46/10.11 [2019-03-28 11:55:21,928 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 14 edges 19.46/10.11 [2019-03-28 11:55:21,929 INFO L258 BlockEncoder]: Using Remove infeasible edges 19.46/10.11 [2019-03-28 11:55:21,930 INFO L263 BlockEncoder]: Using Maximize final states 19.46/10.11 [2019-03-28 11:55:21,931 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 19.46/10.11 [2019-03-28 11:55:21,931 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 19.46/10.11 [2019-03-28 11:55:21,933 INFO L296 BlockEncoder]: Using Remove sink states 19.46/10.11 [2019-03-28 11:55:21,934 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 19.46/10.11 [2019-03-28 11:55:21,935 INFO L179 BlockEncoder]: Using Rewrite not-equals 19.46/10.11 [2019-03-28 11:55:21,950 INFO L185 BlockEncoder]: Using Use SBE 19.46/10.11 [2019-03-28 11:55:21,967 INFO L200 BlockEncoder]: SBE split 4 edges 19.46/10.11 [2019-03-28 11:55:21,972 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 19.46/10.11 [2019-03-28 11:55:21,973 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.46/10.11 [2019-03-28 11:55:21,982 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 19.46/10.11 [2019-03-28 11:55:21,985 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 19.46/10.11 [2019-03-28 11:55:21,986 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 19.46/10.11 [2019-03-28 11:55:21,986 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.46/10.11 [2019-03-28 11:55:21,986 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 19.46/10.11 [2019-03-28 11:55:21,987 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 19.46/10.11 [2019-03-28 11:55:21,987 INFO L313 BlockEncoder]: Encoded RCFG 6 locations, 11 edges 19.46/10.11 [2019-03-28 11:55:21,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:55:21 BasicIcfg 19.46/10.11 [2019-03-28 11:55:21,988 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 19.46/10.11 [2019-03-28 11:55:21,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 19.46/10.11 [2019-03-28 11:55:21,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... 19.46/10.11 [2019-03-28 11:55:21,992 INFO L276 PluginConnector]: TraceAbstraction initialized 19.46/10.11 [2019-03-28 11:55:21,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 11:55:21" (1/4) ... 19.46/10.11 [2019-03-28 11:55:21,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad019f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:55:21, skipping insertion in model container 19.46/10.11 [2019-03-28 11:55:21,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:21" (2/4) ... 19.46/10.11 [2019-03-28 11:55:21,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad019f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:55:21, skipping insertion in model container 19.46/10.11 [2019-03-28 11:55:21,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:55:21" (3/4) ... 19.46/10.11 [2019-03-28 11:55:21,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad019f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:55:21, skipping insertion in model container 19.46/10.11 [2019-03-28 11:55:21,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:55:21" (4/4) ... 19.46/10.11 [2019-03-28 11:55:21,997 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.46/10.11 [2019-03-28 11:55:22,007 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 19.46/10.11 [2019-03-28 11:55:22,016 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 19.46/10.11 [2019-03-28 11:55:22,034 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 19.46/10.11 [2019-03-28 11:55:22,062 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.46/10.11 [2019-03-28 11:55:22,063 INFO L382 AbstractCegarLoop]: Interprodecural is true 19.46/10.11 [2019-03-28 11:55:22,063 INFO L383 AbstractCegarLoop]: Hoare is true 19.46/10.11 [2019-03-28 11:55:22,063 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 19.46/10.11 [2019-03-28 11:55:22,064 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 19.46/10.11 [2019-03-28 11:55:22,064 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.46/10.11 [2019-03-28 11:55:22,064 INFO L387 AbstractCegarLoop]: Difference is false 19.46/10.11 [2019-03-28 11:55:22,064 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 19.46/10.11 [2019-03-28 11:55:22,064 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 19.46/10.11 [2019-03-28 11:55:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. 19.46/10.11 [2019-03-28 11:55:22,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 19.46/10.11 [2019-03-28 11:55:22,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. 19.46/10.11 [2019-03-28 11:55:22,139 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. 19.46/10.11 [2019-03-28 11:55:22,139 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 19.46/10.11 [2019-03-28 11:55:22,139 INFO L451 ceAbstractionStarter]: At program point L15-2(lines 15 17) the Hoare annotation is: true 19.46/10.11 [2019-03-28 11:55:22,140 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 14 19) no Hoare annotation was computed. 19.46/10.11 [2019-03-28 11:55:22,140 INFO L448 ceAbstractionStarter]: For program point L15-3(lines 15 17) no Hoare annotation was computed. 19.46/10.11 [2019-03-28 11:55:22,140 INFO L451 ceAbstractionStarter]: At program point L13-2(lines 13 21) the Hoare annotation is: true 19.46/10.11 [2019-03-28 11:55:22,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:55:22 BasicIcfg 19.46/10.11 [2019-03-28 11:55:22,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 19.46/10.11 [2019-03-28 11:55:22,149 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 19.46/10.11 [2019-03-28 11:55:22,150 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 19.46/10.11 [2019-03-28 11:55:22,153 INFO L276 PluginConnector]: BuchiAutomizer initialized 19.46/10.11 [2019-03-28 11:55:22,154 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.46/10.11 [2019-03-28 11:55:22,154 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 11:55:21" (1/5) ... 19.46/10.11 [2019-03-28 11:55:22,155 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@584c6526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:55:22, skipping insertion in model container 19.46/10.11 [2019-03-28 11:55:22,155 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.46/10.11 [2019-03-28 11:55:22,155 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:21" (2/5) ... 19.46/10.11 [2019-03-28 11:55:22,156 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@584c6526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:55:22, skipping insertion in model container 19.46/10.11 [2019-03-28 11:55:22,156 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.46/10.11 [2019-03-28 11:55:22,156 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:55:21" (3/5) ... 19.46/10.11 [2019-03-28 11:55:22,156 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@584c6526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:55:22, skipping insertion in model container 19.46/10.11 [2019-03-28 11:55:22,156 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.46/10.11 [2019-03-28 11:55:22,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:55:21" (4/5) ... 19.46/10.11 [2019-03-28 11:55:22,157 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@584c6526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:55:22, skipping insertion in model container 19.46/10.11 [2019-03-28 11:55:22,157 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.46/10.11 [2019-03-28 11:55:22,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:55:22" (5/5) ... 19.46/10.11 [2019-03-28 11:55:22,159 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.46/10.11 [2019-03-28 11:55:22,187 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.46/10.11 [2019-03-28 11:55:22,188 INFO L374 BuchiCegarLoop]: Interprodecural is true 19.46/10.11 [2019-03-28 11:55:22,188 INFO L375 BuchiCegarLoop]: Hoare is true 19.46/10.11 [2019-03-28 11:55:22,188 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 19.46/10.11 [2019-03-28 11:55:22,188 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 19.46/10.11 [2019-03-28 11:55:22,188 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.46/10.11 [2019-03-28 11:55:22,188 INFO L379 BuchiCegarLoop]: Difference is false 19.46/10.11 [2019-03-28 11:55:22,189 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 19.46/10.11 [2019-03-28 11:55:22,189 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 19.46/10.11 [2019-03-28 11:55:22,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. 19.46/10.11 [2019-03-28 11:55:22,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 19.46/10.11 [2019-03-28 11:55:22,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.46/10.11 [2019-03-28 11:55:22,211 INFO L119 BuchiIsEmpty]: Starting construction of run 19.46/10.11 [2019-03-28 11:55:22,216 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 19.46/10.11 [2019-03-28 11:55:22,216 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 19.46/10.11 [2019-03-28 11:55:22,216 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 19.46/10.11 [2019-03-28 11:55:22,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. 19.46/10.11 [2019-03-28 11:55:22,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 19.46/10.11 [2019-03-28 11:55:22,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.46/10.11 [2019-03-28 11:55:22,218 INFO L119 BuchiIsEmpty]: Starting construction of run 19.46/10.11 [2019-03-28 11:55:22,218 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 19.46/10.11 [2019-03-28 11:55:22,218 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 19.46/10.11 [2019-03-28 11:55:22,223 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [39] ULTIMATE.startENTRY-->L13-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 4#L13-2true 19.46/10.11 [2019-03-28 11:55:22,224 INFO L796 eck$LassoCheckResult]: Loop: 4#L13-2true [42] L13-2-->L14: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 8#L14true [51] L14-->L14-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet1_5|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_5|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 5#L14-2true [44] L14-2-->L13-2: Formula: (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_9 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post5] 4#L13-2true 19.46/10.11 [2019-03-28 11:55:22,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.11 [2019-03-28 11:55:22,230 INFO L82 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 1 times 19.46/10.11 [2019-03-28 11:55:22,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.11 [2019-03-28 11:55:22,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.11 [2019-03-28 11:55:22,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.11 [2019-03-28 11:55:22,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.46/10.11 [2019-03-28 11:55:22,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.11 [2019-03-28 11:55:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.11 [2019-03-28 11:55:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.11 [2019-03-28 11:55:22,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.11 [2019-03-28 11:55:22,302 INFO L82 PathProgramCache]: Analyzing trace with hash 71778, now seen corresponding path program 1 times 19.46/10.11 [2019-03-28 11:55:22,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.11 [2019-03-28 11:55:22,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.11 [2019-03-28 11:55:22,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.11 [2019-03-28 11:55:22,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.46/10.11 [2019-03-28 11:55:22,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.11 [2019-03-28 11:55:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.11 [2019-03-28 11:55:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.11 [2019-03-28 11:55:22,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.11 [2019-03-28 11:55:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2127357, now seen corresponding path program 1 times 19.46/10.11 [2019-03-28 11:55:22,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.11 [2019-03-28 11:55:22,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.11 [2019-03-28 11:55:22,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.11 [2019-03-28 11:55:22,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.46/10.11 [2019-03-28 11:55:22,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.11 [2019-03-28 11:55:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.11 [2019-03-28 11:55:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.11 [2019-03-28 11:55:22,371 INFO L216 LassoAnalysis]: Preferences: 19.46/10.11 [2019-03-28 11:55:22,373 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.46/10.11 [2019-03-28 11:55:22,373 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.46/10.11 [2019-03-28 11:55:22,373 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.46/10.11 [2019-03-28 11:55:22,373 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.46/10.11 [2019-03-28 11:55:22,374 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.11 [2019-03-28 11:55:22,374 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.46/10.11 [2019-03-28 11:55:22,374 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.46/10.11 [2019-03-28 11:55:22,374 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 19.46/10.11 [2019-03-28 11:55:22,374 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.46/10.11 [2019-03-28 11:55:22,375 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.46/10.11 [2019-03-28 11:55:22,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.11 [2019-03-28 11:55:22,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.11 [2019-03-28 11:55:22,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.11 [2019-03-28 11:55:22,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.11 [2019-03-28 11:55:22,495 INFO L300 LassoAnalysis]: Preprocessing complete. 19.46/10.11 [2019-03-28 11:55:22,496 INFO L412 LassoAnalysis]: Checking for nontermination... 19.46/10.11 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.11 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.11 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.11 [2019-03-28 11:55:22,504 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.46/10.11 [2019-03-28 11:55:22,504 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.11 [2019-03-28 11:55:22,514 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.46/10.11 [2019-03-28 11:55:22,514 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.46/10.11 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.11 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.11 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.11 [2019-03-28 11:55:22,544 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.46/10.11 [2019-03-28 11:55:22,544 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.11 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.11 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.11 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.11 [2019-03-28 11:55:22,595 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.46/10.11 [2019-03-28 11:55:22,595 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.11 [2019-03-28 11:55:22,626 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.46/10.11 [2019-03-28 11:55:22,628 INFO L216 LassoAnalysis]: Preferences: 19.46/10.11 [2019-03-28 11:55:22,628 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.46/10.11 [2019-03-28 11:55:22,628 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.46/10.11 [2019-03-28 11:55:22,628 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.46/10.11 [2019-03-28 11:55:22,629 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.46/10.11 [2019-03-28 11:55:22,629 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.46/10.11 [2019-03-28 11:55:22,629 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.46/10.11 [2019-03-28 11:55:22,629 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.46/10.11 [2019-03-28 11:55:22,629 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 19.46/10.11 [2019-03-28 11:55:22,629 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.46/10.11 [2019-03-28 11:55:22,630 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.46/10.11 [2019-03-28 11:55:22,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.11 [2019-03-28 11:55:22,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.11 [2019-03-28 11:55:22,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.11 [2019-03-28 11:55:22,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.11 [2019-03-28 11:55:22,716 INFO L300 LassoAnalysis]: Preprocessing complete. 19.46/10.11 [2019-03-28 11:55:22,722 INFO L497 LassoAnalysis]: Using template 'affine'. 19.46/10.11 [2019-03-28 11:55:22,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.46/10.11 Termination analysis: LINEAR_WITH_GUESSES 19.46/10.11 Number of strict supporting invariants: 0 19.46/10.11 Number of non-strict supporting invariants: 1 19.46/10.11 Consider only non-deceasing supporting invariants: true 19.46/10.11 Simplify termination arguments: true 19.46/10.11 Simplify supporting invariants: trueOverapproximate stem: false 19.46/10.11 [2019-03-28 11:55:22,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.46/10.11 [2019-03-28 11:55:22,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.46/10.11 [2019-03-28 11:55:22,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.46/10.11 [2019-03-28 11:55:22,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.46/10.11 [2019-03-28 11:55:22,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.46/10.11 [2019-03-28 11:55:22,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.46/10.11 [2019-03-28 11:55:22,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.46/10.11 [2019-03-28 11:55:22,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.46/10.11 [2019-03-28 11:55:22,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.46/10.11 Termination analysis: LINEAR_WITH_GUESSES 19.46/10.11 Number of strict supporting invariants: 0 19.46/10.11 Number of non-strict supporting invariants: 1 19.46/10.11 Consider only non-deceasing supporting invariants: true 19.46/10.11 Simplify termination arguments: true 19.46/10.11 Simplify supporting invariants: trueOverapproximate stem: false 19.46/10.11 [2019-03-28 11:55:22,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.46/10.11 [2019-03-28 11:55:22,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.46/10.11 [2019-03-28 11:55:22,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.46/10.11 [2019-03-28 11:55:22,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.46/10.11 [2019-03-28 11:55:22,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.46/10.11 [2019-03-28 11:55:22,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.46/10.11 [2019-03-28 11:55:22,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.46/10.11 [2019-03-28 11:55:22,740 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.46/10.11 [2019-03-28 11:55:22,745 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.46/10.11 [2019-03-28 11:55:22,746 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 19.46/10.11 [2019-03-28 11:55:22,748 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.46/10.11 [2019-03-28 11:55:22,748 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 19.46/10.11 [2019-03-28 11:55:22,748 INFO L518 LassoAnalysis]: Proved termination. 19.46/10.11 [2019-03-28 11:55:22,749 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.46/10.11 Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 19.46/10.11 Supporting invariants [] 19.46/10.11 [2019-03-28 11:55:22,751 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 19.46/10.11 [2019-03-28 11:55:22,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.11 [2019-03-28 11:55:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.11 [2019-03-28 11:55:22,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core 19.46/10.11 [2019-03-28 11:55:22,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.11 [2019-03-28 11:55:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.11 [2019-03-28 11:55:22,814 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 19.46/10.11 [2019-03-28 11:55:22,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.11 [2019-03-28 11:55:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.46/10.11 [2019-03-28 11:55:22,871 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 19.46/10.11 [2019-03-28 11:55:22,876 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 19.46/10.11 [2019-03-28 11:55:22,878 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states. Second operand 3 states. 19.46/10.11 [2019-03-28 11:55:22,963 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states.. Second operand 3 states. Result 22 states and 43 transitions. Complement of second has 7 states. 19.46/10.11 [2019-03-28 11:55:22,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states 19.46/10.11 [2019-03-28 11:55:22,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 19.46/10.11 [2019-03-28 11:55:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. 19.46/10.11 [2019-03-28 11:55:22,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 1 letters. Loop has 3 letters. 19.46/10.11 [2019-03-28 11:55:22,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.11 [2019-03-28 11:55:22,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 4 letters. Loop has 3 letters. 19.46/10.11 [2019-03-28 11:55:22,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.11 [2019-03-28 11:55:22,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 1 letters. Loop has 6 letters. 19.46/10.11 [2019-03-28 11:55:22,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.11 [2019-03-28 11:55:22,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 43 transitions. 19.46/10.11 [2019-03-28 11:55:22,980 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 19.46/10.11 [2019-03-28 11:55:22,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 32 transitions. 19.46/10.11 [2019-03-28 11:55:22,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 19.46/10.11 [2019-03-28 11:55:22,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 19.46/10.11 [2019-03-28 11:55:22,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 32 transitions. 19.46/10.11 [2019-03-28 11:55:22,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.46/10.11 [2019-03-28 11:55:22,988 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 32 transitions. 19.46/10.11 [2019-03-28 11:55:23,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 32 transitions. 19.46/10.11 [2019-03-28 11:55:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. 19.46/10.11 [2019-03-28 11:55:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 19.46/10.11 [2019-03-28 11:55:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. 19.46/10.11 [2019-03-28 11:55:23,019 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 26 transitions. 19.46/10.11 [2019-03-28 11:55:23,019 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 26 transitions. 19.46/10.11 [2019-03-28 11:55:23,019 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 19.46/10.11 [2019-03-28 11:55:23,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 26 transitions. 19.46/10.11 [2019-03-28 11:55:23,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 19.46/10.11 [2019-03-28 11:55:23,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.46/10.11 [2019-03-28 11:55:23,021 INFO L119 BuchiIsEmpty]: Starting construction of run 19.46/10.11 [2019-03-28 11:55:23,021 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 19.46/10.11 [2019-03-28 11:55:23,021 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 19.46/10.11 [2019-03-28 11:55:23,022 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L13-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 73#L13-2 [42] L13-2-->L14: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 78#L14 [59] L14-->L15-2: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 83#L15-2 [63] L15-2-->L15-2: Formula: (and (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 84#L15-2 19.46/10.11 [2019-03-28 11:55:23,022 INFO L796 eck$LassoCheckResult]: Loop: 84#L15-2 [62] L15-2-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 84#L15-2 19.46/10.11 [2019-03-28 11:55:23,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.11 [2019-03-28 11:55:23,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2127624, now seen corresponding path program 1 times 19.46/10.11 [2019-03-28 11:55:23,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.11 [2019-03-28 11:55:23,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.11 [2019-03-28 11:55:23,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.11 [2019-03-28 11:55:23,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.46/10.11 [2019-03-28 11:55:23,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.11 [2019-03-28 11:55:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.11 [2019-03-28 11:55:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.11 [2019-03-28 11:55:23,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.11 [2019-03-28 11:55:23,036 INFO L82 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 1 times 19.46/10.11 [2019-03-28 11:55:23,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.11 [2019-03-28 11:55:23,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.11 [2019-03-28 11:55:23,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.11 [2019-03-28 11:55:23,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.46/10.11 [2019-03-28 11:55:23,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.11 [2019-03-28 11:55:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:23,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:23,043 INFO L82 PathProgramCache]: Analyzing trace with hash 65956406, now seen corresponding path program 1 times 19.46/10.12 [2019-03-28 11:55:23,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.12 [2019-03-28 11:55:23,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.12 [2019-03-28 11:55:23,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:23,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:23,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:23,071 INFO L216 LassoAnalysis]: Preferences: 19.46/10.12 [2019-03-28 11:55:23,071 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.46/10.12 [2019-03-28 11:55:23,071 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.46/10.12 [2019-03-28 11:55:23,071 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.46/10.12 [2019-03-28 11:55:23,072 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.46/10.12 [2019-03-28 11:55:23,072 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:23,072 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.46/10.12 [2019-03-28 11:55:23,072 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.46/10.12 [2019-03-28 11:55:23,072 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 19.46/10.12 [2019-03-28 11:55:23,072 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.46/10.12 [2019-03-28 11:55:23,072 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.46/10.12 [2019-03-28 11:55:23,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:23,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:23,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:23,109 INFO L300 LassoAnalysis]: Preprocessing complete. 19.46/10.12 [2019-03-28 11:55:23,109 INFO L412 LassoAnalysis]: Checking for nontermination... 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:23,116 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:23,116 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 [2019-03-28 11:55:23,143 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.46/10.12 [2019-03-28 11:55:23,143 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:23,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:23,150 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:23,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:23,182 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 [2019-03-28 11:55:23,396 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.46/10.12 [2019-03-28 11:55:23,398 INFO L216 LassoAnalysis]: Preferences: 19.46/10.12 [2019-03-28 11:55:23,399 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.46/10.12 [2019-03-28 11:55:23,399 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.46/10.12 [2019-03-28 11:55:23,399 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.46/10.12 [2019-03-28 11:55:23,399 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.46/10.12 [2019-03-28 11:55:23,399 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:23,399 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.46/10.12 [2019-03-28 11:55:23,400 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.46/10.12 [2019-03-28 11:55:23,400 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 19.46/10.12 [2019-03-28 11:55:23,400 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.46/10.12 [2019-03-28 11:55:23,400 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.46/10.12 [2019-03-28 11:55:23,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:23,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:23,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:23,434 INFO L300 LassoAnalysis]: Preprocessing complete. 19.46/10.12 [2019-03-28 11:55:23,434 INFO L497 LassoAnalysis]: Using template 'affine'. 19.46/10.12 [2019-03-28 11:55:23,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.46/10.12 Termination analysis: LINEAR_WITH_GUESSES 19.46/10.12 Number of strict supporting invariants: 0 19.46/10.12 Number of non-strict supporting invariants: 1 19.46/10.12 Consider only non-deceasing supporting invariants: true 19.46/10.12 Simplify termination arguments: true 19.46/10.12 Simplify supporting invariants: trueOverapproximate stem: false 19.46/10.12 [2019-03-28 11:55:23,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.46/10.12 [2019-03-28 11:55:23,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.46/10.12 [2019-03-28 11:55:23,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.46/10.12 [2019-03-28 11:55:23,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.46/10.12 [2019-03-28 11:55:23,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.46/10.12 [2019-03-28 11:55:23,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.46/10.12 [2019-03-28 11:55:23,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.46/10.12 [2019-03-28 11:55:23,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.46/10.12 [2019-03-28 11:55:23,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.46/10.12 Termination analysis: LINEAR_WITH_GUESSES 19.46/10.12 Number of strict supporting invariants: 0 19.46/10.12 Number of non-strict supporting invariants: 1 19.46/10.12 Consider only non-deceasing supporting invariants: true 19.46/10.12 Simplify termination arguments: true 19.46/10.12 Simplify supporting invariants: trueOverapproximate stem: false 19.46/10.12 [2019-03-28 11:55:23,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.46/10.12 [2019-03-28 11:55:23,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.46/10.12 [2019-03-28 11:55:23,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.46/10.12 [2019-03-28 11:55:23,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.46/10.12 [2019-03-28 11:55:23,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.46/10.12 [2019-03-28 11:55:23,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.46/10.12 [2019-03-28 11:55:23,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.46/10.12 [2019-03-28 11:55:23,450 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.46/10.12 [2019-03-28 11:55:23,454 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.46/10.12 [2019-03-28 11:55:23,455 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 19.46/10.12 [2019-03-28 11:55:23,455 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.46/10.12 [2019-03-28 11:55:23,455 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 19.46/10.12 [2019-03-28 11:55:23,455 INFO L518 LassoAnalysis]: Proved termination. 19.46/10.12 [2019-03-28 11:55:23,456 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.46/10.12 Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~m~0) = -2*ULTIMATE.start_main_~y~0 + 2*ULTIMATE.start_main_~m~0 + 1 19.46/10.12 Supporting invariants [] 19.46/10.12 [2019-03-28 11:55:23,456 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 19.46/10.12 [2019-03-28 11:55:23,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:23,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:23,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:23,489 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:23,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.46/10.12 [2019-03-28 11:55:23,490 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 19.46/10.12 [2019-03-28 11:55:23,490 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 19.46/10.12 [2019-03-28 11:55:23,490 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 26 transitions. cyclomatic complexity: 14 Second operand 2 states. 19.46/10.12 [2019-03-28 11:55:23,520 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 26 transitions. cyclomatic complexity: 14. Second operand 2 states. Result 20 states and 41 transitions. Complement of second has 4 states. 19.46/10.12 [2019-03-28 11:55:23,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 19.46/10.12 [2019-03-28 11:55:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. 19.46/10.12 [2019-03-28 11:55:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. 19.46/10.12 [2019-03-28 11:55:23,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 1 letters. 19.46/10.12 [2019-03-28 11:55:23,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.12 [2019-03-28 11:55:23,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 1 letters. 19.46/10.12 [2019-03-28 11:55:23,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.12 [2019-03-28 11:55:23,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. 19.46/10.12 [2019-03-28 11:55:23,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.12 [2019-03-28 11:55:23,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 41 transitions. 19.46/10.12 [2019-03-28 11:55:23,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 19.46/10.12 [2019-03-28 11:55:23,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 36 transitions. 19.46/10.12 [2019-03-28 11:55:23,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 19.46/10.12 [2019-03-28 11:55:23,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 19.46/10.12 [2019-03-28 11:55:23,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 36 transitions. 19.46/10.12 [2019-03-28 11:55:23,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.46/10.12 [2019-03-28 11:55:23,529 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 36 transitions. 19.46/10.12 [2019-03-28 11:55:23,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 36 transitions. 19.46/10.12 [2019-03-28 11:55:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. 19.46/10.12 [2019-03-28 11:55:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 19.46/10.12 [2019-03-28 11:55:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 34 transitions. 19.46/10.12 [2019-03-28 11:55:23,531 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 34 transitions. 19.46/10.12 [2019-03-28 11:55:23,532 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 34 transitions. 19.46/10.12 [2019-03-28 11:55:23,532 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 19.46/10.12 [2019-03-28 11:55:23,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 34 transitions. 19.46/10.12 [2019-03-28 11:55:23,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 19.46/10.12 [2019-03-28 11:55:23,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.46/10.12 [2019-03-28 11:55:23,533 INFO L119 BuchiIsEmpty]: Starting construction of run 19.46/10.12 [2019-03-28 11:55:23,533 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 19.46/10.12 [2019-03-28 11:55:23,534 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 19.46/10.12 [2019-03-28 11:55:23,534 INFO L794 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L13-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 141#L13-2 [42] L13-2-->L14: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 146#L14 [59] L14-->L15-2: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 151#L15-2 [62] L15-2-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 152#L15-2 19.46/10.12 [2019-03-28 11:55:23,535 INFO L796 eck$LassoCheckResult]: Loop: 152#L15-2 [62] L15-2-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 152#L15-2 19.46/10.12 [2019-03-28 11:55:23,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:23,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2127623, now seen corresponding path program 1 times 19.46/10.12 [2019-03-28 11:55:23,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.12 [2019-03-28 11:55:23,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.12 [2019-03-28 11:55:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:23,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:23,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:23,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:23,546 INFO L82 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 2 times 19.46/10.12 [2019-03-28 11:55:23,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.12 [2019-03-28 11:55:23,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.12 [2019-03-28 11:55:23,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:23,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:23,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:23,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:23,553 INFO L82 PathProgramCache]: Analyzing trace with hash 65956375, now seen corresponding path program 2 times 19.46/10.12 [2019-03-28 11:55:23,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.12 [2019-03-28 11:55:23,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.12 [2019-03-28 11:55:23,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:23,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:23,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:23,582 INFO L216 LassoAnalysis]: Preferences: 19.46/10.12 [2019-03-28 11:55:23,582 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.46/10.12 [2019-03-28 11:55:23,583 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.46/10.12 [2019-03-28 11:55:23,583 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.46/10.12 [2019-03-28 11:55:23,583 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.46/10.12 [2019-03-28 11:55:23,584 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:23,584 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.46/10.12 [2019-03-28 11:55:23,584 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.46/10.12 [2019-03-28 11:55:23,584 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 19.46/10.12 [2019-03-28 11:55:23,584 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.46/10.12 [2019-03-28 11:55:23,584 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.46/10.12 [2019-03-28 11:55:23,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:23,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:23,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:23,621 INFO L300 LassoAnalysis]: Preprocessing complete. 19.46/10.12 [2019-03-28 11:55:23,621 INFO L412 LassoAnalysis]: Checking for nontermination... 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:23,630 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:23,630 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 [2019-03-28 11:55:23,634 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.46/10.12 [2019-03-28 11:55:23,635 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3=0} Honda state: {ULTIMATE.start_main_#t~post3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:23,665 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:23,665 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:23,700 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:23,700 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 [2019-03-28 11:55:23,916 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.46/10.12 [2019-03-28 11:55:23,919 INFO L216 LassoAnalysis]: Preferences: 19.46/10.12 [2019-03-28 11:55:23,919 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.46/10.12 [2019-03-28 11:55:23,919 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.46/10.12 [2019-03-28 11:55:23,919 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.46/10.12 [2019-03-28 11:55:23,919 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.46/10.12 [2019-03-28 11:55:23,919 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:23,920 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.46/10.12 [2019-03-28 11:55:23,920 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.46/10.12 [2019-03-28 11:55:23,920 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 19.46/10.12 [2019-03-28 11:55:23,920 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.46/10.12 [2019-03-28 11:55:23,920 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.46/10.12 [2019-03-28 11:55:23,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:23,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:23,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:23,960 INFO L300 LassoAnalysis]: Preprocessing complete. 19.46/10.12 [2019-03-28 11:55:23,961 INFO L497 LassoAnalysis]: Using template 'affine'. 19.46/10.12 [2019-03-28 11:55:23,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.46/10.12 Termination analysis: LINEAR_WITH_GUESSES 19.46/10.12 Number of strict supporting invariants: 0 19.46/10.12 Number of non-strict supporting invariants: 1 19.46/10.12 Consider only non-deceasing supporting invariants: true 19.46/10.12 Simplify termination arguments: true 19.46/10.12 Simplify supporting invariants: trueOverapproximate stem: false 19.46/10.12 [2019-03-28 11:55:23,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.46/10.12 [2019-03-28 11:55:23,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.46/10.12 [2019-03-28 11:55:23,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.46/10.12 [2019-03-28 11:55:23,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.46/10.12 [2019-03-28 11:55:23,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.46/10.12 [2019-03-28 11:55:23,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.46/10.12 [2019-03-28 11:55:23,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.46/10.12 [2019-03-28 11:55:23,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.46/10.12 [2019-03-28 11:55:23,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.46/10.12 Termination analysis: LINEAR_WITH_GUESSES 19.46/10.12 Number of strict supporting invariants: 0 19.46/10.12 Number of non-strict supporting invariants: 1 19.46/10.12 Consider only non-deceasing supporting invariants: true 19.46/10.12 Simplify termination arguments: true 19.46/10.12 Simplify supporting invariants: trueOverapproximate stem: false 19.46/10.12 [2019-03-28 11:55:23,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.46/10.12 [2019-03-28 11:55:23,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.46/10.12 [2019-03-28 11:55:23,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.46/10.12 [2019-03-28 11:55:23,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.46/10.12 [2019-03-28 11:55:23,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.46/10.12 [2019-03-28 11:55:23,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.46/10.12 [2019-03-28 11:55:23,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.46/10.12 [2019-03-28 11:55:23,972 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.46/10.12 [2019-03-28 11:55:23,976 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.46/10.12 [2019-03-28 11:55:23,976 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 19.46/10.12 [2019-03-28 11:55:23,976 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.46/10.12 [2019-03-28 11:55:23,977 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 19.46/10.12 [2019-03-28 11:55:23,977 INFO L518 LassoAnalysis]: Proved termination. 19.46/10.12 [2019-03-28 11:55:23,977 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.46/10.12 Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~m~0) = -2*ULTIMATE.start_main_~y~0 + 2*ULTIMATE.start_main_~m~0 + 1 19.46/10.12 Supporting invariants [] 19.46/10.12 [2019-03-28 11:55:23,978 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 19.46/10.12 [2019-03-28 11:55:23,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:24,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:24,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:24,008 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:24,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.46/10.12 [2019-03-28 11:55:24,008 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 19.46/10.12 [2019-03-28 11:55:24,009 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 19.46/10.12 [2019-03-28 11:55:24,009 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 34 transitions. cyclomatic complexity: 20 Second operand 2 states. 19.46/10.12 [2019-03-28 11:55:24,037 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 34 transitions. cyclomatic complexity: 20. Second operand 2 states. Result 27 states and 69 transitions. Complement of second has 4 states. 19.46/10.12 [2019-03-28 11:55:24,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 19.46/10.12 [2019-03-28 11:55:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. 19.46/10.12 [2019-03-28 11:55:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. 19.46/10.12 [2019-03-28 11:55:24,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 1 letters. 19.46/10.12 [2019-03-28 11:55:24,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.12 [2019-03-28 11:55:24,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 1 letters. 19.46/10.12 [2019-03-28 11:55:24,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.12 [2019-03-28 11:55:24,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. 19.46/10.12 [2019-03-28 11:55:24,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.12 [2019-03-28 11:55:24,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 69 transitions. 19.46/10.12 [2019-03-28 11:55:24,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 19.46/10.12 [2019-03-28 11:55:24,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 57 transitions. 19.46/10.12 [2019-03-28 11:55:24,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 19.46/10.12 [2019-03-28 11:55:24,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 19.46/10.12 [2019-03-28 11:55:24,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 57 transitions. 19.46/10.12 [2019-03-28 11:55:24,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.46/10.12 [2019-03-28 11:55:24,044 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 57 transitions. 19.46/10.12 [2019-03-28 11:55:24,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 57 transitions. 19.46/10.12 [2019-03-28 11:55:24,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. 19.46/10.12 [2019-03-28 11:55:24,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 19.46/10.12 [2019-03-28 11:55:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 34 transitions. 19.46/10.12 [2019-03-28 11:55:24,048 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 34 transitions. 19.46/10.12 [2019-03-28 11:55:24,048 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 34 transitions. 19.46/10.12 [2019-03-28 11:55:24,048 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 19.46/10.12 [2019-03-28 11:55:24,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 34 transitions. 19.46/10.12 [2019-03-28 11:55:24,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 19.46/10.12 [2019-03-28 11:55:24,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.46/10.12 [2019-03-28 11:55:24,049 INFO L119 BuchiIsEmpty]: Starting construction of run 19.46/10.12 [2019-03-28 11:55:24,049 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 19.46/10.12 [2019-03-28 11:55:24,050 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 19.46/10.12 [2019-03-28 11:55:24,050 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L13-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 218#L13-2 [42] L13-2-->L14: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 223#L14 [59] L14-->L15-2: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 228#L15-2 [63] L15-2-->L15-2: Formula: (and (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 229#L15-2 19.46/10.12 [2019-03-28 11:55:24,050 INFO L796 eck$LassoCheckResult]: Loop: 229#L15-2 [60] L15-2-->L15-3: Formula: (> v_ULTIMATE.start_main_~y~0_6 v_ULTIMATE.start_main_~m~0_4) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_4} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 224#L15-3 [45] L15-3-->L14-2: Formula: (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_6 1)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post4] 225#L14-2 [44] L14-2-->L13-2: Formula: (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_9 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post5] 219#L13-2 [42] L13-2-->L14: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 220#L14 [58] L14-->L15-2: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 232#L15-2 [62] L15-2-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 229#L15-2 19.46/10.12 [2019-03-28 11:55:24,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:24,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2127624, now seen corresponding path program 2 times 19.46/10.12 [2019-03-28 11:55:24,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.12 [2019-03-28 11:55:24,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.12 [2019-03-28 11:55:24,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:24,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:24,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:24,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:24,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1646803084, now seen corresponding path program 1 times 19.46/10.12 [2019-03-28 11:55:24,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.12 [2019-03-28 11:55:24,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.12 [2019-03-28 11:55:24,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:24,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:24,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:24,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:24,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2110692667, now seen corresponding path program 1 times 19.46/10.12 [2019-03-28 11:55:24,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.12 [2019-03-28 11:55:24,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.12 [2019-03-28 11:55:24,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:24,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:24,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.46/10.12 [2019-03-28 11:55:24,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 19.46/10.12 [2019-03-28 11:55:24,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 19.46/10.12 [2019-03-28 11:55:24,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:24,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:24,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.46/10.12 [2019-03-28 11:55:24,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 19.46/10.12 [2019-03-28 11:55:24,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 19.46/10.12 [2019-03-28 11:55:24,278 INFO L216 LassoAnalysis]: Preferences: 19.46/10.12 [2019-03-28 11:55:24,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.46/10.12 [2019-03-28 11:55:24,279 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.46/10.12 [2019-03-28 11:55:24,279 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.46/10.12 [2019-03-28 11:55:24,279 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.46/10.12 [2019-03-28 11:55:24,279 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:24,279 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.46/10.12 [2019-03-28 11:55:24,279 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.46/10.12 [2019-03-28 11:55:24,279 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 19.46/10.12 [2019-03-28 11:55:24,279 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.46/10.12 [2019-03-28 11:55:24,280 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.46/10.12 [2019-03-28 11:55:24,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:24,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:24,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:24,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:24,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:24,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:24,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:24,356 INFO L300 LassoAnalysis]: Preprocessing complete. 19.46/10.12 [2019-03-28 11:55:24,357 INFO L412 LassoAnalysis]: Checking for nontermination... 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:24,361 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:24,362 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 [2019-03-28 11:55:24,366 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.46/10.12 [2019-03-28 11:55:24,366 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:24,394 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:24,394 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 [2019-03-28 11:55:24,397 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.46/10.12 [2019-03-28 11:55:24,397 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:24,426 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:24,427 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 [2019-03-28 11:55:24,430 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.46/10.12 [2019-03-28 11:55:24,430 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3=0} Honda state: {ULTIMATE.start_main_#t~post3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:24,459 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:24,459 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 [2019-03-28 11:55:24,465 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.46/10.12 [2019-03-28 11:55:24,465 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=4, ULTIMATE.start_main_~m~0=3} Honda state: {ULTIMATE.start_main_~y~0=4, ULTIMATE.start_main_~m~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:24,493 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:24,494 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:24,541 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:24,541 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 [2019-03-28 11:55:24,598 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.46/10.12 [2019-03-28 11:55:24,600 INFO L216 LassoAnalysis]: Preferences: 19.46/10.12 [2019-03-28 11:55:24,600 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.46/10.12 [2019-03-28 11:55:24,600 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.46/10.12 [2019-03-28 11:55:24,600 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.46/10.12 [2019-03-28 11:55:24,601 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.46/10.12 [2019-03-28 11:55:24,601 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:24,601 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.46/10.12 [2019-03-28 11:55:24,601 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.46/10.12 [2019-03-28 11:55:24,601 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 19.46/10.12 [2019-03-28 11:55:24,601 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.46/10.12 [2019-03-28 11:55:24,601 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.46/10.12 [2019-03-28 11:55:24,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:24,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:24,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:24,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:24,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:24,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:24,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:24,682 INFO L300 LassoAnalysis]: Preprocessing complete. 19.46/10.12 [2019-03-28 11:55:24,682 INFO L497 LassoAnalysis]: Using template 'affine'. 19.46/10.12 [2019-03-28 11:55:24,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.46/10.12 Termination analysis: LINEAR_WITH_GUESSES 19.46/10.12 Number of strict supporting invariants: 0 19.46/10.12 Number of non-strict supporting invariants: 1 19.46/10.12 Consider only non-deceasing supporting invariants: true 19.46/10.12 Simplify termination arguments: true 19.46/10.12 Simplify supporting invariants: trueOverapproximate stem: false 19.46/10.12 [2019-03-28 11:55:24,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.46/10.12 [2019-03-28 11:55:24,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.46/10.12 [2019-03-28 11:55:24,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.46/10.12 [2019-03-28 11:55:24,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.46/10.12 [2019-03-28 11:55:24,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.46/10.12 [2019-03-28 11:55:24,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.46/10.12 [2019-03-28 11:55:24,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.46/10.12 [2019-03-28 11:55:24,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.46/10.12 [2019-03-28 11:55:24,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.46/10.12 Termination analysis: LINEAR_WITH_GUESSES 19.46/10.12 Number of strict supporting invariants: 0 19.46/10.12 Number of non-strict supporting invariants: 1 19.46/10.12 Consider only non-deceasing supporting invariants: true 19.46/10.12 Simplify termination arguments: true 19.46/10.12 Simplify supporting invariants: trueOverapproximate stem: false 19.46/10.12 [2019-03-28 11:55:24,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.46/10.12 [2019-03-28 11:55:24,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.46/10.12 [2019-03-28 11:55:24,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.46/10.12 [2019-03-28 11:55:24,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.46/10.12 [2019-03-28 11:55:24,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.46/10.12 [2019-03-28 11:55:24,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.46/10.12 [2019-03-28 11:55:24,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.46/10.12 [2019-03-28 11:55:24,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.46/10.12 [2019-03-28 11:55:24,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.46/10.12 Termination analysis: LINEAR_WITH_GUESSES 19.46/10.12 Number of strict supporting invariants: 0 19.46/10.12 Number of non-strict supporting invariants: 1 19.46/10.12 Consider only non-deceasing supporting invariants: true 19.46/10.12 Simplify termination arguments: true 19.46/10.12 Simplify supporting invariants: trueOverapproximate stem: false 19.46/10.12 [2019-03-28 11:55:24,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.46/10.12 [2019-03-28 11:55:24,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.46/10.12 [2019-03-28 11:55:24,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.46/10.12 [2019-03-28 11:55:24,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.46/10.12 [2019-03-28 11:55:24,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.46/10.12 [2019-03-28 11:55:24,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.46/10.12 [2019-03-28 11:55:24,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.46/10.12 [2019-03-28 11:55:24,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.46/10.12 [2019-03-28 11:55:24,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.46/10.12 Termination analysis: LINEAR_WITH_GUESSES 19.46/10.12 Number of strict supporting invariants: 0 19.46/10.12 Number of non-strict supporting invariants: 1 19.46/10.12 Consider only non-deceasing supporting invariants: true 19.46/10.12 Simplify termination arguments: true 19.46/10.12 Simplify supporting invariants: trueOverapproximate stem: false 19.46/10.12 [2019-03-28 11:55:24,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.46/10.12 [2019-03-28 11:55:24,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.46/10.12 [2019-03-28 11:55:24,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.46/10.12 [2019-03-28 11:55:24,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.46/10.12 [2019-03-28 11:55:24,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.46/10.12 [2019-03-28 11:55:24,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.46/10.12 [2019-03-28 11:55:24,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.46/10.12 [2019-03-28 11:55:24,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.46/10.12 [2019-03-28 11:55:24,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.46/10.12 Termination analysis: LINEAR_WITH_GUESSES 19.46/10.12 Number of strict supporting invariants: 0 19.46/10.12 Number of non-strict supporting invariants: 1 19.46/10.12 Consider only non-deceasing supporting invariants: true 19.46/10.12 Simplify termination arguments: true 19.46/10.12 Simplify supporting invariants: trueOverapproximate stem: false 19.46/10.12 [2019-03-28 11:55:24,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.46/10.12 [2019-03-28 11:55:24,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.46/10.12 [2019-03-28 11:55:24,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.46/10.12 [2019-03-28 11:55:24,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.46/10.12 [2019-03-28 11:55:24,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.46/10.12 [2019-03-28 11:55:24,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.46/10.12 [2019-03-28 11:55:24,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.46/10.12 [2019-03-28 11:55:24,704 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.46/10.12 [2019-03-28 11:55:24,707 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.46/10.12 [2019-03-28 11:55:24,707 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 19.46/10.12 [2019-03-28 11:55:24,708 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.46/10.12 [2019-03-28 11:55:24,708 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 19.46/10.12 [2019-03-28 11:55:24,708 INFO L518 LassoAnalysis]: Proved termination. 19.46/10.12 [2019-03-28 11:55:24,708 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.46/10.12 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 19.46/10.12 Supporting invariants [] 19.46/10.12 [2019-03-28 11:55:24,709 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 19.46/10.12 [2019-03-28 11:55:24,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:24,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:24,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:24,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:24,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.46/10.12 [2019-03-28 11:55:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:24,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:24,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:24,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:24,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:24,808 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 19.46/10.12 [2019-03-28 11:55:24,808 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 19.46/10.12 [2019-03-28 11:55:24,808 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 34 transitions. cyclomatic complexity: 20 Second operand 5 states. 19.46/10.12 [2019-03-28 11:55:24,903 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 34 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 86 states and 241 transitions. Complement of second has 31 states. 19.46/10.12 [2019-03-28 11:55:24,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states 19.46/10.12 [2019-03-28 11:55:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 19.46/10.12 [2019-03-28 11:55:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. 19.46/10.12 [2019-03-28 11:55:24,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 6 letters. 19.46/10.12 [2019-03-28 11:55:24,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.12 [2019-03-28 11:55:24,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 10 letters. Loop has 6 letters. 19.46/10.12 [2019-03-28 11:55:24,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.12 [2019-03-28 11:55:24,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 12 letters. 19.46/10.12 [2019-03-28 11:55:24,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.12 [2019-03-28 11:55:24,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 241 transitions. 19.46/10.12 [2019-03-28 11:55:24,913 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 19.46/10.12 [2019-03-28 11:55:24,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 51 states and 117 transitions. 19.46/10.12 [2019-03-28 11:55:24,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 19.46/10.12 [2019-03-28 11:55:24,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 19.46/10.12 [2019-03-28 11:55:24,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 117 transitions. 19.46/10.12 [2019-03-28 11:55:24,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.46/10.12 [2019-03-28 11:55:24,915 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 117 transitions. 19.46/10.12 [2019-03-28 11:55:24,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 117 transitions. 19.46/10.12 [2019-03-28 11:55:24,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. 19.46/10.12 [2019-03-28 11:55:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 19.46/10.12 [2019-03-28 11:55:24,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 69 transitions. 19.46/10.12 [2019-03-28 11:55:24,920 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 69 transitions. 19.46/10.12 [2019-03-28 11:55:24,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 19.46/10.12 [2019-03-28 11:55:24,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 19.46/10.12 [2019-03-28 11:55:24,924 INFO L87 Difference]: Start difference. First operand 33 states and 69 transitions. Second operand 9 states. 19.46/10.12 [2019-03-28 11:55:25,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.46/10.12 [2019-03-28 11:55:25,068 INFO L93 Difference]: Finished difference Result 89 states and 158 transitions. 19.46/10.12 [2019-03-28 11:55:25,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 19.46/10.12 [2019-03-28 11:55:25,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 158 transitions. 19.46/10.12 [2019-03-28 11:55:25,073 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 19.46/10.12 [2019-03-28 11:55:25,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 69 states and 132 transitions. 19.46/10.12 [2019-03-28 11:55:25,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 19.46/10.12 [2019-03-28 11:55:25,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 19.46/10.12 [2019-03-28 11:55:25,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 132 transitions. 19.46/10.12 [2019-03-28 11:55:25,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.46/10.12 [2019-03-28 11:55:25,075 INFO L706 BuchiCegarLoop]: Abstraction has 69 states and 132 transitions. 19.46/10.12 [2019-03-28 11:55:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 132 transitions. 19.46/10.12 [2019-03-28 11:55:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. 19.46/10.12 [2019-03-28 11:55:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. 19.46/10.12 [2019-03-28 11:55:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 104 transitions. 19.46/10.12 [2019-03-28 11:55:25,080 INFO L729 BuchiCegarLoop]: Abstraction has 51 states and 104 transitions. 19.46/10.12 [2019-03-28 11:55:25,080 INFO L609 BuchiCegarLoop]: Abstraction has 51 states and 104 transitions. 19.46/10.12 [2019-03-28 11:55:25,081 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 19.46/10.12 [2019-03-28 11:55:25,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 104 transitions. 19.46/10.12 [2019-03-28 11:55:25,082 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 19.46/10.12 [2019-03-28 11:55:25,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.46/10.12 [2019-03-28 11:55:25,082 INFO L119 BuchiIsEmpty]: Starting construction of run 19.46/10.12 [2019-03-28 11:55:25,082 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 19.46/10.12 [2019-03-28 11:55:25,083 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 19.46/10.12 [2019-03-28 11:55:25,083 INFO L794 eck$LassoCheckResult]: Stem: 600#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L13-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 601#L13-2 [42] L13-2-->L14: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 629#L14 [59] L14-->L15-2: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 635#L15-2 [62] L15-2-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 636#L15-2 19.46/10.12 [2019-03-28 11:55:25,083 INFO L796 eck$LassoCheckResult]: Loop: 636#L15-2 [61] L15-2-->L15-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 641#L15-3 [45] L15-3-->L14-2: Formula: (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_6 1)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post4] 645#L14-2 [44] L14-2-->L13-2: Formula: (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_9 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post5] 643#L13-2 [42] L13-2-->L14: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 644#L14 [58] L14-->L15-2: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 646#L15-2 [62] L15-2-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 636#L15-2 19.46/10.12 [2019-03-28 11:55:25,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:25,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2127623, now seen corresponding path program 3 times 19.46/10.12 [2019-03-28 11:55:25,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.12 [2019-03-28 11:55:25,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.12 [2019-03-28 11:55:25,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:25,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:25,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1618173933, now seen corresponding path program 1 times 19.46/10.12 [2019-03-28 11:55:25,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.12 [2019-03-28 11:55:25,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.12 [2019-03-28 11:55:25,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:25,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:25,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1251818137, now seen corresponding path program 1 times 19.46/10.12 [2019-03-28 11:55:25,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.12 [2019-03-28 11:55:25,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.12 [2019-03-28 11:55:25,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:25,142 INFO L216 LassoAnalysis]: Preferences: 19.46/10.12 [2019-03-28 11:55:25,143 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.46/10.12 [2019-03-28 11:55:25,143 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.46/10.12 [2019-03-28 11:55:25,143 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.46/10.12 [2019-03-28 11:55:25,143 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.46/10.12 [2019-03-28 11:55:25,143 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:25,143 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.46/10.12 [2019-03-28 11:55:25,143 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.46/10.12 [2019-03-28 11:55:25,143 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 19.46/10.12 [2019-03-28 11:55:25,144 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.46/10.12 [2019-03-28 11:55:25,144 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.46/10.12 [2019-03-28 11:55:25,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,210 INFO L300 LassoAnalysis]: Preprocessing complete. 19.46/10.12 [2019-03-28 11:55:25,210 INFO L412 LassoAnalysis]: Checking for nontermination... 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:25,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:25,221 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 [2019-03-28 11:55:25,247 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.46/10.12 [2019-03-28 11:55:25,247 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=1} Honda state: {ULTIMATE.start_main_#t~nondet1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:25,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:25,253 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:25,284 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:25,284 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 [2019-03-28 11:55:25,339 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.46/10.12 [2019-03-28 11:55:25,341 INFO L216 LassoAnalysis]: Preferences: 19.46/10.12 [2019-03-28 11:55:25,341 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.46/10.12 [2019-03-28 11:55:25,341 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.46/10.12 [2019-03-28 11:55:25,342 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.46/10.12 [2019-03-28 11:55:25,342 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.46/10.12 [2019-03-28 11:55:25,342 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:25,342 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.46/10.12 [2019-03-28 11:55:25,342 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.46/10.12 [2019-03-28 11:55:25,342 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 19.46/10.12 [2019-03-28 11:55:25,342 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.46/10.12 [2019-03-28 11:55:25,342 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.46/10.12 [2019-03-28 11:55:25,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,406 INFO L300 LassoAnalysis]: Preprocessing complete. 19.46/10.12 [2019-03-28 11:55:25,406 INFO L497 LassoAnalysis]: Using template 'affine'. 19.46/10.12 [2019-03-28 11:55:25,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.46/10.12 Termination analysis: LINEAR_WITH_GUESSES 19.46/10.12 Number of strict supporting invariants: 0 19.46/10.12 Number of non-strict supporting invariants: 1 19.46/10.12 Consider only non-deceasing supporting invariants: true 19.46/10.12 Simplify termination arguments: true 19.46/10.12 Simplify supporting invariants: trueOverapproximate stem: false 19.46/10.12 [2019-03-28 11:55:25,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.46/10.12 [2019-03-28 11:55:25,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.46/10.12 [2019-03-28 11:55:25,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.46/10.12 [2019-03-28 11:55:25,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.46/10.12 [2019-03-28 11:55:25,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.46/10.12 [2019-03-28 11:55:25,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.46/10.12 [2019-03-28 11:55:25,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.46/10.12 [2019-03-28 11:55:25,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.46/10.12 [2019-03-28 11:55:25,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.46/10.12 Termination analysis: LINEAR_WITH_GUESSES 19.46/10.12 Number of strict supporting invariants: 0 19.46/10.12 Number of non-strict supporting invariants: 1 19.46/10.12 Consider only non-deceasing supporting invariants: true 19.46/10.12 Simplify termination arguments: true 19.46/10.12 Simplify supporting invariants: trueOverapproximate stem: false 19.46/10.12 [2019-03-28 11:55:25,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.46/10.12 [2019-03-28 11:55:25,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.46/10.12 [2019-03-28 11:55:25,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.46/10.12 [2019-03-28 11:55:25,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.46/10.12 [2019-03-28 11:55:25,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.46/10.12 [2019-03-28 11:55:25,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.46/10.12 [2019-03-28 11:55:25,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.46/10.12 [2019-03-28 11:55:25,415 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.46/10.12 [2019-03-28 11:55:25,417 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.46/10.12 [2019-03-28 11:55:25,417 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 19.46/10.12 [2019-03-28 11:55:25,417 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.46/10.12 [2019-03-28 11:55:25,417 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 19.46/10.12 [2019-03-28 11:55:25,418 INFO L518 LassoAnalysis]: Proved termination. 19.46/10.12 [2019-03-28 11:55:25,418 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.46/10.12 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 19.46/10.12 Supporting invariants [] 19.46/10.12 [2019-03-28 11:55:25,418 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 19.46/10.12 [2019-03-28 11:55:25,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:25,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:25,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:25,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:25,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.46/10.12 [2019-03-28 11:55:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:25,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:25,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:25,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:25,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:25,493 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 19.46/10.12 [2019-03-28 11:55:25,493 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 19.46/10.12 [2019-03-28 11:55:25,493 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 51 states and 104 transitions. cyclomatic complexity: 61 Second operand 5 states. 19.46/10.12 [2019-03-28 11:55:25,578 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 51 states and 104 transitions. cyclomatic complexity: 61. Second operand 5 states. Result 354 states and 811 transitions. Complement of second has 31 states. 19.46/10.12 [2019-03-28 11:55:25,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states 19.46/10.12 [2019-03-28 11:55:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 19.46/10.12 [2019-03-28 11:55:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. 19.46/10.12 [2019-03-28 11:55:25,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 6 letters. 19.46/10.12 [2019-03-28 11:55:25,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.12 [2019-03-28 11:55:25,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 10 letters. Loop has 6 letters. 19.46/10.12 [2019-03-28 11:55:25,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.12 [2019-03-28 11:55:25,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 12 letters. 19.46/10.12 [2019-03-28 11:55:25,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.12 [2019-03-28 11:55:25,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 811 transitions. 19.46/10.12 [2019-03-28 11:55:25,592 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 19.46/10.12 [2019-03-28 11:55:25,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 201 states and 397 transitions. 19.46/10.12 [2019-03-28 11:55:25,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 19.46/10.12 [2019-03-28 11:55:25,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 19.46/10.12 [2019-03-28 11:55:25,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 397 transitions. 19.46/10.12 [2019-03-28 11:55:25,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.46/10.12 [2019-03-28 11:55:25,597 INFO L706 BuchiCegarLoop]: Abstraction has 201 states and 397 transitions. 19.46/10.12 [2019-03-28 11:55:25,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states and 397 transitions. 19.46/10.12 [2019-03-28 11:55:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 35. 19.46/10.12 [2019-03-28 11:55:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 19.46/10.12 [2019-03-28 11:55:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 65 transitions. 19.46/10.12 [2019-03-28 11:55:25,603 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 65 transitions. 19.46/10.12 [2019-03-28 11:55:25,603 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 65 transitions. 19.46/10.12 [2019-03-28 11:55:25,603 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 19.46/10.12 [2019-03-28 11:55:25,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 65 transitions. 19.46/10.12 [2019-03-28 11:55:25,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 19.46/10.12 [2019-03-28 11:55:25,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.46/10.12 [2019-03-28 11:55:25,604 INFO L119 BuchiIsEmpty]: Starting construction of run 19.46/10.12 [2019-03-28 11:55:25,605 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] 19.46/10.12 [2019-03-28 11:55:25,605 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 19.46/10.12 [2019-03-28 11:55:25,605 INFO L794 eck$LassoCheckResult]: Stem: 1120#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L13-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 0) (= v_ULTIMATE.start_main_~m~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x~0_1 v_ULTIMATE.start_main_~m~0_1)) 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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_1, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 1121#L13-2 [42] L13-2-->L14: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 1138#L14 [59] L14-->L15-2: Formula: (> 0 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 1139#L15-2 [63] L15-2-->L15-2: Formula: (and (<= v_ULTIMATE.start_main_~y~0_8 v_ULTIMATE.start_main_~m~0_5) (= (+ v_ULTIMATE.start_main_~y~0_8 1) v_ULTIMATE.start_main_~y~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3] 1130#L15-2 [61] L15-2-->L15-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 1131#L15-3 [45] L15-3-->L14-2: Formula: (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_6 1)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post4] 1152#L14-2 [44] L14-2-->L13-2: Formula: (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_9 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post5] 1151#L13-2 [42] L13-2-->L14: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 1145#L14 [51] L14-->L14-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet1_5|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_5|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 1126#L14-2 19.46/10.12 [2019-03-28 11:55:25,605 INFO L796 eck$LassoCheckResult]: Loop: 1126#L14-2 [44] L14-2-->L13-2: Formula: (= v_ULTIMATE.start_main_~y~0_10 (+ v_ULTIMATE.start_main_~y~0_9 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post5] 1122#L13-2 [42] L13-2-->L14: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0_5) (<= 0 v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} AuxVars[] AssignedVars[] 1123#L14 [51] L14-->L14-2: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet1_5|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_5|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1] 1126#L14-2 19.46/10.12 [2019-03-28 11:55:25,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:25,606 INFO L82 PathProgramCache]: Analyzing trace with hash 900294365, now seen corresponding path program 1 times 19.46/10.12 [2019-03-28 11:55:25,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.12 [2019-03-28 11:55:25,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.12 [2019-03-28 11:55:25,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:25,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:25,617 INFO L82 PathProgramCache]: Analyzing trace with hash 73428, now seen corresponding path program 2 times 19.46/10.12 [2019-03-28 11:55:25,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.12 [2019-03-28 11:55:25,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.12 [2019-03-28 11:55:25,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.46/10.12 [2019-03-28 11:55:25,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:25,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1401292168, now seen corresponding path program 2 times 19.46/10.12 [2019-03-28 11:55:25,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.46/10.12 [2019-03-28 11:55:25,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.46/10.12 [2019-03-28 11:55:25,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.46/10.12 [2019-03-28 11:55:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 19.46/10.12 [2019-03-28 11:55:25,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 19.46/10.12 [2019-03-28 11:55:25,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 19.46/10.12 [2019-03-28 11:55:25,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 19.46/10.12 [2019-03-28 11:55:25,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 19.46/10.12 [2019-03-28 11:55:25,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:25,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:25,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:25,674 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 19.46/10.12 [2019-03-28 11:55:25,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 19.46/10.12 [2019-03-28 11:55:25,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 19.46/10.12 [2019-03-28 11:55:25,715 INFO L216 LassoAnalysis]: Preferences: 19.46/10.12 [2019-03-28 11:55:25,715 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.46/10.12 [2019-03-28 11:55:25,715 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.46/10.12 [2019-03-28 11:55:25,715 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.46/10.12 [2019-03-28 11:55:25,715 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.46/10.12 [2019-03-28 11:55:25,715 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:25,716 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.46/10.12 [2019-03-28 11:55:25,716 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.46/10.12 [2019-03-28 11:55:25,716 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 19.46/10.12 [2019-03-28 11:55:25,716 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.46/10.12 [2019-03-28 11:55:25,716 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.46/10.12 [2019-03-28 11:55:25,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,749 INFO L300 LassoAnalysis]: Preprocessing complete. 19.46/10.12 [2019-03-28 11:55:25,750 INFO L412 LassoAnalysis]: Checking for nontermination... 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:25,753 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:25,754 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 [2019-03-28 11:55:25,757 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.46/10.12 [2019-03-28 11:55:25,757 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:25,786 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:25,786 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 19.46/10.12 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.46/10.12 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:25,818 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.46/10.12 [2019-03-28 11:55:25,818 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.46/10.12 [2019-03-28 11:55:25,874 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.46/10.12 [2019-03-28 11:55:25,876 INFO L216 LassoAnalysis]: Preferences: 19.46/10.12 [2019-03-28 11:55:25,876 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.46/10.12 [2019-03-28 11:55:25,876 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.46/10.12 [2019-03-28 11:55:25,876 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.46/10.12 [2019-03-28 11:55:25,877 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.46/10.12 [2019-03-28 11:55:25,877 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.46/10.12 [2019-03-28 11:55:25,877 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.46/10.12 [2019-03-28 11:55:25,877 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.46/10.12 [2019-03-28 11:55:25,877 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 19.46/10.12 [2019-03-28 11:55:25,877 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.46/10.12 [2019-03-28 11:55:25,877 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.46/10.12 [2019-03-28 11:55:25,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.46/10.12 [2019-03-28 11:55:25,912 INFO L300 LassoAnalysis]: Preprocessing complete. 19.46/10.12 [2019-03-28 11:55:25,912 INFO L497 LassoAnalysis]: Using template 'affine'. 19.46/10.12 [2019-03-28 11:55:25,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.46/10.12 Termination analysis: LINEAR_WITH_GUESSES 19.46/10.12 Number of strict supporting invariants: 0 19.46/10.12 Number of non-strict supporting invariants: 1 19.46/10.12 Consider only non-deceasing supporting invariants: true 19.46/10.12 Simplify termination arguments: true 19.46/10.12 Simplify supporting invariants: trueOverapproximate stem: false 19.46/10.12 [2019-03-28 11:55:25,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.46/10.12 [2019-03-28 11:55:25,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.46/10.12 [2019-03-28 11:55:25,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.46/10.12 [2019-03-28 11:55:25,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.46/10.12 [2019-03-28 11:55:25,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.46/10.12 [2019-03-28 11:55:25,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.46/10.12 [2019-03-28 11:55:25,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.46/10.12 [2019-03-28 11:55:25,917 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.46/10.12 [2019-03-28 11:55:25,919 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.46/10.12 [2019-03-28 11:55:25,919 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 19.46/10.12 [2019-03-28 11:55:25,919 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.46/10.12 [2019-03-28 11:55:25,919 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 19.46/10.12 [2019-03-28 11:55:25,920 INFO L518 LassoAnalysis]: Proved termination. 19.46/10.12 [2019-03-28 11:55:25,920 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.46/10.12 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 19.46/10.12 Supporting invariants [] 19.46/10.12 [2019-03-28 11:55:25,920 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 19.46/10.12 [2019-03-28 11:55:25,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.46/10.12 [2019-03-28 11:55:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:25,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:25,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:25,941 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:25,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.46/10.12 [2019-03-28 11:55:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.46/10.12 [2019-03-28 11:55:25,965 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 19.46/10.12 [2019-03-28 11:55:25,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.46/10.12 [2019-03-28 11:55:25,966 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 19.46/10.12 [2019-03-28 11:55:25,966 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 19.46/10.12 [2019-03-28 11:55:25,966 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 35 states and 65 transitions. cyclomatic complexity: 35 Second operand 4 states. 19.46/10.12 [2019-03-28 11:55:26,038 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 35 states and 65 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 138 states and 250 transitions. Complement of second has 16 states. 19.46/10.12 [2019-03-28 11:55:26,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states 19.46/10.12 [2019-03-28 11:55:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 19.46/10.12 [2019-03-28 11:55:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. 19.46/10.12 [2019-03-28 11:55:26,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 9 letters. Loop has 3 letters. 19.46/10.12 [2019-03-28 11:55:26,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.12 [2019-03-28 11:55:26,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 12 letters. Loop has 3 letters. 19.46/10.12 [2019-03-28 11:55:26,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.12 [2019-03-28 11:55:26,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 9 letters. Loop has 6 letters. 19.46/10.12 [2019-03-28 11:55:26,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.46/10.12 [2019-03-28 11:55:26,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 250 transitions. 19.46/10.12 [2019-03-28 11:55:26,044 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.46/10.12 [2019-03-28 11:55:26,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 0 states and 0 transitions. 19.46/10.12 [2019-03-28 11:55:26,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 19.46/10.12 [2019-03-28 11:55:26,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 19.46/10.12 [2019-03-28 11:55:26,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 19.46/10.12 [2019-03-28 11:55:26,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.46/10.12 [2019-03-28 11:55:26,045 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.46/10.12 [2019-03-28 11:55:26,045 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.46/10.12 [2019-03-28 11:55:26,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 19.46/10.12 [2019-03-28 11:55:26,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 19.46/10.12 [2019-03-28 11:55:26,045 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. 19.46/10.12 [2019-03-28 11:55:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.46/10.12 [2019-03-28 11:55:26,045 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. 19.46/10.12 [2019-03-28 11:55:26,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 19.46/10.12 [2019-03-28 11:55:26,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. 19.46/10.12 [2019-03-28 11:55:26,047 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.46/10.12 [2019-03-28 11:55:26,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. 19.46/10.12 [2019-03-28 11:55:26,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 19.46/10.12 [2019-03-28 11:55:26,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 19.46/10.12 [2019-03-28 11:55:26,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 19.46/10.12 [2019-03-28 11:55:26,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.46/10.12 [2019-03-28 11:55:26,047 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.46/10.12 [2019-03-28 11:55:26,048 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.46/10.12 [2019-03-28 11:55:26,048 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.46/10.12 [2019-03-28 11:55:26,048 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 19.46/10.12 [2019-03-28 11:55:26,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 19.46/10.12 [2019-03-28 11:55:26,048 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.46/10.12 [2019-03-28 11:55:26,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 19.46/10.12 [2019-03-28 11:55:26,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:55:26 BasicIcfg 19.46/10.12 [2019-03-28 11:55:26,054 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 19.46/10.12 [2019-03-28 11:55:26,055 INFO L168 Benchmark]: Toolchain (without parser) took 4726.26 ms. Allocated memory was 649.6 MB in the beginning and 769.1 MB in the end (delta: 119.5 MB). Free memory was 559.1 MB in the beginning and 469.9 MB in the end (delta: 89.2 MB). Peak memory consumption was 208.7 MB. Max. memory is 50.3 GB. 19.46/10.12 [2019-03-28 11:55:26,057 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 19.46/10.12 [2019-03-28 11:55:26,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.55 ms. Allocated memory is still 649.6 MB. Free memory was 559.1 MB in the beginning and 548.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 19.46/10.12 [2019-03-28 11:55:26,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.20 ms. Allocated memory was 649.6 MB in the beginning and 703.1 MB in the end (delta: 53.5 MB). Free memory was 548.3 MB in the beginning and 669.9 MB in the end (delta: -121.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. 19.46/10.12 [2019-03-28 11:55:26,058 INFO L168 Benchmark]: Boogie Preprocessor took 21.56 ms. Allocated memory is still 703.1 MB. Free memory was 669.9 MB in the beginning and 667.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 19.46/10.12 [2019-03-28 11:55:26,059 INFO L168 Benchmark]: RCFGBuilder took 224.85 ms. Allocated memory is still 703.1 MB. Free memory was 667.1 MB in the beginning and 653.4 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 50.3 GB. 19.46/10.12 [2019-03-28 11:55:26,059 INFO L168 Benchmark]: BlockEncodingV2 took 78.20 ms. Allocated memory is still 703.1 MB. Free memory was 653.4 MB in the beginning and 648.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 19.46/10.12 [2019-03-28 11:55:26,060 INFO L168 Benchmark]: TraceAbstraction took 160.10 ms. Allocated memory is still 703.1 MB. Free memory was 648.0 MB in the beginning and 638.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 19.46/10.12 [2019-03-28 11:55:26,060 INFO L168 Benchmark]: BuchiAutomizer took 3904.94 ms. Allocated memory was 703.1 MB in the beginning and 769.1 MB in the end (delta: 66.1 MB). Free memory was 638.3 MB in the beginning and 469.9 MB in the end (delta: 168.4 MB). Peak memory consumption was 234.4 MB. Max. memory is 50.3 GB. 19.46/10.12 [2019-03-28 11:55:26,064 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 19.46/10.12 --- Results --- 19.46/10.12 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 19.46/10.12 - StatisticsResult: Initial Icfg 19.46/10.12 10 locations, 14 edges 19.46/10.12 - StatisticsResult: Encoded RCFG 19.46/10.12 6 locations, 11 edges 19.46/10.12 * Results from de.uni_freiburg.informatik.ultimate.core: 19.46/10.12 - StatisticsResult: Toolchain Benchmarks 19.46/10.12 Benchmark results are: 19.46/10.12 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 19.46/10.12 * CACSL2BoogieTranslator took 230.55 ms. Allocated memory is still 649.6 MB. Free memory was 559.1 MB in the beginning and 548.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 19.46/10.12 * Boogie Procedure Inliner took 100.20 ms. Allocated memory was 649.6 MB in the beginning and 703.1 MB in the end (delta: 53.5 MB). Free memory was 548.3 MB in the beginning and 669.9 MB in the end (delta: -121.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. 19.46/10.12 * Boogie Preprocessor took 21.56 ms. Allocated memory is still 703.1 MB. Free memory was 669.9 MB in the beginning and 667.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 19.46/10.12 * RCFGBuilder took 224.85 ms. Allocated memory is still 703.1 MB. Free memory was 667.1 MB in the beginning and 653.4 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 50.3 GB. 19.46/10.12 * BlockEncodingV2 took 78.20 ms. Allocated memory is still 703.1 MB. Free memory was 653.4 MB in the beginning and 648.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 19.46/10.12 * TraceAbstraction took 160.10 ms. Allocated memory is still 703.1 MB. Free memory was 648.0 MB in the beginning and 638.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 19.46/10.12 * BuchiAutomizer took 3904.94 ms. Allocated memory was 703.1 MB in the beginning and 769.1 MB in the end (delta: 66.1 MB). Free memory was 638.3 MB in the beginning and 469.9 MB in the end (delta: 168.4 MB). Peak memory consumption was 234.4 MB. Max. memory is 50.3 GB. 19.46/10.12 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 19.46/10.12 - AllSpecificationsHoldResult: All specifications hold 19.46/10.12 We were not able to verify any specifiation because the program does not contain any specification. 19.46/10.12 - InvariantResult [Line: 13]: Loop Invariant 19.46/10.12 Derived loop invariant: 1 19.46/10.12 - InvariantResult [Line: 15]: Loop Invariant 19.46/10.12 Derived loop invariant: 1 19.46/10.12 - StatisticsResult: Ultimate Automizer benchmark data 19.46/10.12 CFG has 1 procedures, 6 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=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 2 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 19.46/10.12 - StatisticsResult: Constructed decomposition of program 19.46/10.12 Your program was decomposed into 8 terminating modules (2 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 * y + 2 * m + 1 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * y + 2 * m + 1 and consists of 3 locations. One nondeterministic module has affine ranking function x and consists of 6 locations. One nondeterministic module has affine ranking function x and consists of 6 locations. One nondeterministic module has affine ranking function y and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. 19.46/10.12 - StatisticsResult: Timing statistics 19.46/10.12 BüchiAutomizer plugin needed 3.8s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 215 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 51 states and ocurred in iteration 4. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 44 SDtfs, 169 SDslu, 114 SDs, 0 SdLazy, 276 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq149 hnf94 smp100 dnf100 smp100 tf112 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s 19.46/10.12 - TerminationAnalysisResult: Termination proven 19.46/10.12 Buchi Automizer proved that your program is terminating 19.46/10.12 RESULT: Ultimate proved your program to be correct! 19.46/10.12 !SESSION 2019-03-28 11:55:17.773 ----------------------------------------------- 19.46/10.12 eclipse.buildId=unknown 19.46/10.12 java.version=1.8.0_181 19.46/10.12 java.vendor=Oracle Corporation 19.46/10.12 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 19.46/10.12 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 19.46/10.12 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 19.46/10.12 19.46/10.12 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 11:55:26.299 19.46/10.12 !MESSAGE The workspace will exit with unsaved changes in this session. 19.46/10.12 Received shutdown request... 19.46/10.12 Ultimate: 19.46/10.12 GTK+ Version Check 19.46/10.12 EOF