16.54/12.11 YES 16.54/12.11 16.54/12.11 Ultimate: Cannot open display: 16.54/12.11 This is Ultimate 0.1.24-8dc7c08-m 16.54/12.11 [2019-03-28 11:54:05,206 INFO L170 SettingsManager]: Resetting all preferences to default values... 16.54/12.11 [2019-03-28 11:54:05,208 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 16.54/12.11 [2019-03-28 11:54:05,222 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 16.54/12.11 [2019-03-28 11:54:05,222 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 16.54/12.11 [2019-03-28 11:54:05,223 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 16.54/12.11 [2019-03-28 11:54:05,224 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 16.54/12.11 [2019-03-28 11:54:05,226 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 16.54/12.11 [2019-03-28 11:54:05,227 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 16.54/12.11 [2019-03-28 11:54:05,228 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 16.54/12.11 [2019-03-28 11:54:05,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 16.54/12.11 [2019-03-28 11:54:05,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 16.54/12.11 [2019-03-28 11:54:05,230 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 16.54/12.11 [2019-03-28 11:54:05,231 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 16.54/12.11 [2019-03-28 11:54:05,232 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 16.54/12.11 [2019-03-28 11:54:05,233 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 16.54/12.11 [2019-03-28 11:54:05,234 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 16.54/12.11 [2019-03-28 11:54:05,236 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 16.54/12.11 [2019-03-28 11:54:05,237 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 16.54/12.11 [2019-03-28 11:54:05,239 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 16.54/12.11 [2019-03-28 11:54:05,240 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 16.54/12.11 [2019-03-28 11:54:05,241 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 16.54/12.11 [2019-03-28 11:54:05,243 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 16.54/12.11 [2019-03-28 11:54:05,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 16.54/12.11 [2019-03-28 11:54:05,244 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 16.54/12.11 [2019-03-28 11:54:05,244 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 16.54/12.11 [2019-03-28 11:54:05,245 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 16.54/12.11 [2019-03-28 11:54:05,246 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 16.54/12.11 [2019-03-28 11:54:05,246 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 16.54/12.11 [2019-03-28 11:54:05,247 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 16.54/12.11 [2019-03-28 11:54:05,247 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 16.54/12.11 [2019-03-28 11:54:05,248 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 16.54/12.11 [2019-03-28 11:54:05,249 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 16.54/12.11 [2019-03-28 11:54:05,249 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 16.54/12.11 [2019-03-28 11:54:05,250 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 16.54/12.11 [2019-03-28 11:54:05,250 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 16.54/12.11 [2019-03-28 11:54:05,250 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 16.54/12.11 [2019-03-28 11:54:05,251 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 16.54/12.11 [2019-03-28 11:54:05,252 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 16.54/12.11 [2019-03-28 11:54:05,252 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 16.54/12.11 [2019-03-28 11:54:05,267 INFO L110 SettingsManager]: Loading preferences was successful 16.54/12.11 [2019-03-28 11:54:05,267 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 16.54/12.11 [2019-03-28 11:54:05,268 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 16.54/12.11 [2019-03-28 11:54:05,269 INFO L133 SettingsManager]: * Rewrite not-equals=true 16.54/12.11 [2019-03-28 11:54:05,269 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 16.54/12.11 [2019-03-28 11:54:05,269 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 16.54/12.11 [2019-03-28 11:54:05,269 INFO L133 SettingsManager]: * Use SBE=true 16.54/12.11 [2019-03-28 11:54:05,269 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 16.54/12.11 [2019-03-28 11:54:05,270 INFO L133 SettingsManager]: * Use old map elimination=false 16.54/12.11 [2019-03-28 11:54:05,270 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 16.54/12.11 [2019-03-28 11:54:05,270 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 16.54/12.11 [2019-03-28 11:54:05,270 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 16.54/12.11 [2019-03-28 11:54:05,270 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 16.54/12.11 [2019-03-28 11:54:05,271 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 16.54/12.11 [2019-03-28 11:54:05,271 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.11 [2019-03-28 11:54:05,271 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 16.54/12.11 [2019-03-28 11:54:05,271 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 16.54/12.11 [2019-03-28 11:54:05,271 INFO L133 SettingsManager]: * Check division by zero=IGNORE 16.54/12.11 [2019-03-28 11:54:05,272 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 16.54/12.11 [2019-03-28 11:54:05,272 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 16.54/12.11 [2019-03-28 11:54:05,272 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 16.54/12.11 [2019-03-28 11:54:05,272 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 16.54/12.11 [2019-03-28 11:54:05,272 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 16.54/12.11 [2019-03-28 11:54:05,273 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 16.54/12.11 [2019-03-28 11:54:05,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 16.54/12.11 [2019-03-28 11:54:05,273 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 16.54/12.11 [2019-03-28 11:54:05,273 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 16.54/12.11 [2019-03-28 11:54:05,273 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 16.54/12.11 [2019-03-28 11:54:05,274 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 16.54/12.11 [2019-03-28 11:54:05,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 16.54/12.11 [2019-03-28 11:54:05,351 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 16.54/12.11 [2019-03-28 11:54:05,355 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 16.54/12.11 [2019-03-28 11:54:05,356 INFO L271 PluginConnector]: Initializing CDTParser... 16.54/12.11 [2019-03-28 11:54:05,357 INFO L276 PluginConnector]: CDTParser initialized 16.54/12.11 [2019-03-28 11:54:05,358 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 16.54/12.11 [2019-03-28 11:54:05,439 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/c15c2bfc32cc4c67ba47bbcfb432fa28/FLAGeb9e60846 16.54/12.11 [2019-03-28 11:54:05,972 INFO L307 CDTParser]: Found 1 translation units. 16.54/12.11 [2019-03-28 11:54:05,973 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 16.54/12.11 [2019-03-28 11:54:05,979 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/c15c2bfc32cc4c67ba47bbcfb432fa28/FLAGeb9e60846 16.54/12.11 [2019-03-28 11:54:07,660 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/c15c2bfc32cc4c67ba47bbcfb432fa28 16.54/12.11 [2019-03-28 11:54:07,672 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 16.54/12.11 [2019-03-28 11:54:07,674 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 16.54/12.11 [2019-03-28 11:54:07,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 16.54/12.11 [2019-03-28 11:54:07,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 16.54/12.11 [2019-03-28 11:54:07,678 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 16.54/12.11 [2019-03-28 11:54:07,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:54:07" (1/1) ... 16.54/12.11 [2019-03-28 11:54:07,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37349f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:54:07, skipping insertion in model container 16.54/12.11 [2019-03-28 11:54:07,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:54:07" (1/1) ... 16.54/12.11 [2019-03-28 11:54:07,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 16.54/12.11 [2019-03-28 11:54:07,739 INFO L176 MainTranslator]: Built tables and reachable declarations 16.54/12.11 [2019-03-28 11:54:07,893 INFO L206 PostProcessor]: Analyzing one entry point: main 16.54/12.11 [2019-03-28 11:54:07,898 INFO L191 MainTranslator]: Completed pre-run 16.54/12.11 [2019-03-28 11:54:07,914 INFO L206 PostProcessor]: Analyzing one entry point: main 16.54/12.11 [2019-03-28 11:54:07,928 INFO L195 MainTranslator]: Completed translation 16.54/12.11 [2019-03-28 11:54:07,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:54:07 WrapperNode 16.54/12.11 [2019-03-28 11:54:07,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 16.54/12.11 [2019-03-28 11:54:07,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 16.54/12.11 [2019-03-28 11:54:07,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 16.54/12.11 [2019-03-28 11:54:07,929 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 16.54/12.11 [2019-03-28 11:54:07,993 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:54:07" (1/1) ... 16.54/12.11 [2019-03-28 11:54:07,999 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:54:07" (1/1) ... 16.54/12.11 [2019-03-28 11:54:08,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 16.54/12.11 [2019-03-28 11:54:08,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 16.54/12.11 [2019-03-28 11:54:08,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 16.54/12.11 [2019-03-28 11:54:08,019 INFO L276 PluginConnector]: Boogie Preprocessor initialized 16.54/12.11 [2019-03-28 11:54:08,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:54:07" (1/1) ... 16.54/12.11 [2019-03-28 11:54:08,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:54:07" (1/1) ... 16.54/12.11 [2019-03-28 11:54:08,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:54:07" (1/1) ... 16.54/12.11 [2019-03-28 11:54:08,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:54:07" (1/1) ... 16.54/12.11 [2019-03-28 11:54:08,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:54:07" (1/1) ... 16.54/12.11 [2019-03-28 11:54:08,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:54:07" (1/1) ... 16.54/12.11 [2019-03-28 11:54:08,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:54:07" (1/1) ... 16.54/12.11 [2019-03-28 11:54:08,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 16.54/12.11 [2019-03-28 11:54:08,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 16.54/12.11 [2019-03-28 11:54:08,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... 16.54/12.11 [2019-03-28 11:54:08,039 INFO L276 PluginConnector]: RCFGBuilder initialized 16.54/12.11 [2019-03-28 11:54:08,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:54:07" (1/1) ... 16.54/12.11 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.11 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 16.54/12.11 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 16.54/12.11 [2019-03-28 11:54:08,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 16.54/12.11 [2019-03-28 11:54:08,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 16.54/12.11 [2019-03-28 11:54:08,249 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 16.54/12.11 [2019-03-28 11:54:08,249 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 16.54/12.11 [2019-03-28 11:54:08,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:54:08 BoogieIcfgContainer 16.54/12.11 [2019-03-28 11:54:08,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 16.54/12.11 [2019-03-28 11:54:08,251 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 16.54/12.11 [2019-03-28 11:54:08,251 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 16.54/12.11 [2019-03-28 11:54:08,253 INFO L276 PluginConnector]: BlockEncodingV2 initialized 16.54/12.11 [2019-03-28 11:54:08,254 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:54:08" (1/1) ... 16.54/12.11 [2019-03-28 11:54:08,268 INFO L313 BlockEncoder]: Initial Icfg 7 locations, 10 edges 16.54/12.11 [2019-03-28 11:54:08,270 INFO L258 BlockEncoder]: Using Remove infeasible edges 16.54/12.11 [2019-03-28 11:54:08,270 INFO L263 BlockEncoder]: Using Maximize final states 16.54/12.11 [2019-03-28 11:54:08,271 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 16.54/12.11 [2019-03-28 11:54:08,271 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 16.54/12.11 [2019-03-28 11:54:08,273 INFO L296 BlockEncoder]: Using Remove sink states 16.54/12.11 [2019-03-28 11:54:08,274 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 16.54/12.11 [2019-03-28 11:54:08,274 INFO L179 BlockEncoder]: Using Rewrite not-equals 16.54/12.11 [2019-03-28 11:54:08,293 INFO L185 BlockEncoder]: Using Use SBE 16.54/12.11 [2019-03-28 11:54:08,309 INFO L200 BlockEncoder]: SBE split 3 edges 16.54/12.11 [2019-03-28 11:54:08,314 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 16.54/12.11 [2019-03-28 11:54:08,315 INFO L71 MaximizeFinalStates]: 0 new accepting states 16.54/12.11 [2019-03-28 11:54:08,324 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 16.54/12.11 [2019-03-28 11:54:08,326 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states 16.54/12.11 [2019-03-28 11:54:08,327 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 16.54/12.11 [2019-03-28 11:54:08,327 INFO L71 MaximizeFinalStates]: 0 new accepting states 16.54/12.11 [2019-03-28 11:54:08,327 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 16.54/12.11 [2019-03-28 11:54:08,328 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 16.54/12.11 [2019-03-28 11:54:08,328 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 8 edges 16.54/12.11 [2019-03-28 11:54:08,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:54:08 BasicIcfg 16.54/12.11 [2019-03-28 11:54:08,329 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 16.54/12.11 [2019-03-28 11:54:08,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 16.54/12.11 [2019-03-28 11:54:08,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... 16.54/12.11 [2019-03-28 11:54:08,333 INFO L276 PluginConnector]: TraceAbstraction initialized 16.54/12.11 [2019-03-28 11:54:08,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 11:54:07" (1/4) ... 16.54/12.11 [2019-03-28 11:54:08,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be787ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:54:08, skipping insertion in model container 16.54/12.11 [2019-03-28 11:54:08,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:54:07" (2/4) ... 16.54/12.11 [2019-03-28 11:54:08,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be787ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:54:08, skipping insertion in model container 16.54/12.11 [2019-03-28 11:54:08,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:54:08" (3/4) ... 16.54/12.11 [2019-03-28 11:54:08,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be787ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:54:08, skipping insertion in model container 16.54/12.11 [2019-03-28 11:54:08,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:54:08" (4/4) ... 16.54/12.11 [2019-03-28 11:54:08,337 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 16.54/12.11 [2019-03-28 11:54:08,346 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 16.54/12.11 [2019-03-28 11:54:08,354 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 16.54/12.11 [2019-03-28 11:54:08,371 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 16.54/12.11 [2019-03-28 11:54:08,399 INFO L133 ementStrategyFactory]: Using default assertion order modulation 16.54/12.11 [2019-03-28 11:54:08,400 INFO L382 AbstractCegarLoop]: Interprodecural is true 16.54/12.11 [2019-03-28 11:54:08,400 INFO L383 AbstractCegarLoop]: Hoare is true 16.54/12.11 [2019-03-28 11:54:08,400 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 16.54/12.11 [2019-03-28 11:54:08,400 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 16.54/12.11 [2019-03-28 11:54:08,400 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 16.54/12.11 [2019-03-28 11:54:08,400 INFO L387 AbstractCegarLoop]: Difference is false 16.54/12.11 [2019-03-28 11:54:08,401 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 16.54/12.11 [2019-03-28 11:54:08,401 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 16.54/12.11 [2019-03-28 11:54:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. 16.54/12.11 [2019-03-28 11:54:08,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 16.54/12.11 [2019-03-28 11:54:08,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. 16.54/12.11 [2019-03-28 11:54:08,471 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 16.54/12.11 [2019-03-28 11:54:08,471 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 26) no Hoare annotation was computed. 16.54/12.11 [2019-03-28 11:54:08,471 INFO L451 ceAbstractionStarter]: At program point L20-2(lines 17 27) the Hoare annotation is: true 16.54/12.11 [2019-03-28 11:54:08,472 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 26) no Hoare annotation was computed. 16.54/12.11 [2019-03-28 11:54:08,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:54:08 BasicIcfg 16.54/12.11 [2019-03-28 11:54:08,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 16.54/12.11 [2019-03-28 11:54:08,480 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 16.54/12.11 [2019-03-28 11:54:08,481 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 16.54/12.11 [2019-03-28 11:54:08,484 INFO L276 PluginConnector]: BuchiAutomizer initialized 16.54/12.11 [2019-03-28 11:54:08,484 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 16.54/12.11 [2019-03-28 11:54:08,485 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 11:54:07" (1/5) ... 16.54/12.11 [2019-03-28 11:54:08,485 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@458c6bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:54:08, skipping insertion in model container 16.54/12.11 [2019-03-28 11:54:08,485 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 16.54/12.11 [2019-03-28 11:54:08,486 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:54:07" (2/5) ... 16.54/12.11 [2019-03-28 11:54:08,486 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@458c6bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:54:08, skipping insertion in model container 16.54/12.11 [2019-03-28 11:54:08,486 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 16.54/12.11 [2019-03-28 11:54:08,486 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:54:08" (3/5) ... 16.54/12.11 [2019-03-28 11:54:08,487 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@458c6bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:54:08, skipping insertion in model container 16.54/12.11 [2019-03-28 11:54:08,487 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 16.54/12.11 [2019-03-28 11:54:08,487 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:54:08" (4/5) ... 16.54/12.11 [2019-03-28 11:54:08,487 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@458c6bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:54:08, skipping insertion in model container 16.54/12.11 [2019-03-28 11:54:08,487 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 16.54/12.11 [2019-03-28 11:54:08,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:54:08" (5/5) ... 16.54/12.11 [2019-03-28 11:54:08,489 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 16.54/12.11 [2019-03-28 11:54:08,517 INFO L133 ementStrategyFactory]: Using default assertion order modulation 16.54/12.11 [2019-03-28 11:54:08,517 INFO L374 BuchiCegarLoop]: Interprodecural is true 16.54/12.11 [2019-03-28 11:54:08,517 INFO L375 BuchiCegarLoop]: Hoare is true 16.54/12.11 [2019-03-28 11:54:08,518 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 16.54/12.11 [2019-03-28 11:54:08,518 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 16.54/12.11 [2019-03-28 11:54:08,518 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 16.54/12.11 [2019-03-28 11:54:08,518 INFO L379 BuchiCegarLoop]: Difference is false 16.54/12.11 [2019-03-28 11:54:08,518 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 16.54/12.11 [2019-03-28 11:54:08,518 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 16.54/12.11 [2019-03-28 11:54:08,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 16.54/12.11 [2019-03-28 11:54:08,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 16.54/12.11 [2019-03-28 11:54:08,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 16.54/12.11 [2019-03-28 11:54:08,542 INFO L119 BuchiIsEmpty]: Starting construction of run 16.54/12.11 [2019-03-28 11:54:08,549 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 16.54/12.11 [2019-03-28 11:54:08,549 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 16.54/12.11 [2019-03-28 11:54:08,549 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 16.54/12.11 [2019-03-28 11:54:08,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 16.54/12.11 [2019-03-28 11:54:08,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 16.54/12.11 [2019-03-28 11:54:08,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 16.54/12.11 [2019-03-28 11:54:08,550 INFO L119 BuchiIsEmpty]: Starting construction of run 16.54/12.11 [2019-03-28 11:54:08,550 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 16.54/12.11 [2019-03-28 11:54:08,550 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 16.54/12.11 [2019-03-28 11:54:08,555 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [27] ULTIMATE.startENTRY-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 4#L20-2true 16.54/12.11 [2019-03-28 11:54:08,556 INFO L796 eck$LassoCheckResult]: Loop: 4#L20-2true [30] L20-2-->L18: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_8) (< 0 v_ULTIMATE.start_main_~x~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 5#L18true [43] L18-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (< 0 |v_ULTIMATE.start_main_#t~nondet3_3|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 4#L20-2true 16.54/12.11 [2019-03-28 11:54:08,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.11 [2019-03-28 11:54:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash 58, now seen corresponding path program 1 times 16.54/12.11 [2019-03-28 11:54:08,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.54/12.11 [2019-03-28 11:54:08,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.54/12.11 [2019-03-28 11:54:08,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.11 [2019-03-28 11:54:08,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.54/12.11 [2019-03-28 11:54:08,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.11 [2019-03-28 11:54:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.11 [2019-03-28 11:54:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.11 [2019-03-28 11:54:08,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.11 [2019-03-28 11:54:08,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1934, now seen corresponding path program 1 times 16.54/12.11 [2019-03-28 11:54:08,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.54/12.11 [2019-03-28 11:54:08,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.54/12.11 [2019-03-28 11:54:08,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.11 [2019-03-28 11:54:08,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.54/12.11 [2019-03-28 11:54:08,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.11 [2019-03-28 11:54:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.11 [2019-03-28 11:54:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.11 [2019-03-28 11:54:08,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.11 [2019-03-28 11:54:08,649 INFO L82 PathProgramCache]: Analyzing trace with hash 56711, now seen corresponding path program 1 times 16.54/12.11 [2019-03-28 11:54:08,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.54/12.11 [2019-03-28 11:54:08,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.54/12.11 [2019-03-28 11:54:08,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.11 [2019-03-28 11:54:08,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:08,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:08,726 INFO L216 LassoAnalysis]: Preferences: 16.54/12.12 [2019-03-28 11:54:08,727 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 16.54/12.12 [2019-03-28 11:54:08,727 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 16.54/12.12 [2019-03-28 11:54:08,728 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 16.54/12.12 [2019-03-28 11:54:08,728 INFO L127 ssoRankerPreferences]: Use exernal solver: true 16.54/12.12 [2019-03-28 11:54:08,728 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:08,728 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 16.54/12.12 [2019-03-28 11:54:08,728 INFO L130 ssoRankerPreferences]: Path of dumped script: 16.54/12.12 [2019-03-28 11:54:08,729 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 16.54/12.12 [2019-03-28 11:54:08,729 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 16.54/12.12 [2019-03-28 11:54:08,729 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 16.54/12.12 [2019-03-28 11:54:08,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:08,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:08,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:08,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:08,826 INFO L300 LassoAnalysis]: Preprocessing complete. 16.54/12.12 [2019-03-28 11:54:08,827 INFO L412 LassoAnalysis]: Checking for nontermination... 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:08,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:08,833 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 [2019-03-28 11:54:08,866 INFO L445 LassoAnalysis]: Proved nontermination for one component. 16.54/12.12 [2019-03-28 11:54:08,866 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~z~0=1} Honda state: {ULTIMATE.start_main_~z~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:08,877 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:08,877 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 [2019-03-28 11:54:08,904 INFO L445 LassoAnalysis]: Proved nontermination for one component. 16.54/12.12 [2019-03-28 11:54:08,904 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:08,909 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:08,909 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:08,939 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:08,940 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 [2019-03-28 11:54:08,970 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 16.54/12.12 [2019-03-28 11:54:08,972 INFO L216 LassoAnalysis]: Preferences: 16.54/12.12 [2019-03-28 11:54:08,972 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 16.54/12.12 [2019-03-28 11:54:08,972 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 16.54/12.12 [2019-03-28 11:54:08,973 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 16.54/12.12 [2019-03-28 11:54:08,973 INFO L127 ssoRankerPreferences]: Use exernal solver: false 16.54/12.12 [2019-03-28 11:54:08,973 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:08,973 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 16.54/12.12 [2019-03-28 11:54:08,973 INFO L130 ssoRankerPreferences]: Path of dumped script: 16.54/12.12 [2019-03-28 11:54:08,973 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 16.54/12.12 [2019-03-28 11:54:08,974 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 16.54/12.12 [2019-03-28 11:54:08,974 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 16.54/12.12 [2019-03-28 11:54:08,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:08,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:08,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:08,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:09,044 INFO L300 LassoAnalysis]: Preprocessing complete. 16.54/12.12 [2019-03-28 11:54:09,050 INFO L497 LassoAnalysis]: Using template 'affine'. 16.54/12.12 [2019-03-28 11:54:09,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.54/12.12 Termination analysis: LINEAR_WITH_GUESSES 16.54/12.12 Number of strict supporting invariants: 0 16.54/12.12 Number of non-strict supporting invariants: 1 16.54/12.12 Consider only non-deceasing supporting invariants: true 16.54/12.12 Simplify termination arguments: true 16.54/12.12 Simplify supporting invariants: trueOverapproximate stem: false 16.54/12.12 [2019-03-28 11:54:09,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.54/12.12 [2019-03-28 11:54:09,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 16.54/12.12 [2019-03-28 11:54:09,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.54/12.12 [2019-03-28 11:54:09,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.54/12.12 [2019-03-28 11:54:09,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.54/12.12 [2019-03-28 11:54:09,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 16.54/12.12 [2019-03-28 11:54:09,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 16.54/12.12 [2019-03-28 11:54:09,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 16.54/12.12 [2019-03-28 11:54:09,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.54/12.12 Termination analysis: LINEAR_WITH_GUESSES 16.54/12.12 Number of strict supporting invariants: 0 16.54/12.12 Number of non-strict supporting invariants: 1 16.54/12.12 Consider only non-deceasing supporting invariants: true 16.54/12.12 Simplify termination arguments: true 16.54/12.12 Simplify supporting invariants: trueOverapproximate stem: false 16.54/12.12 [2019-03-28 11:54:09,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.54/12.12 [2019-03-28 11:54:09,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 16.54/12.12 [2019-03-28 11:54:09,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.54/12.12 [2019-03-28 11:54:09,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.54/12.12 [2019-03-28 11:54:09,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.54/12.12 [2019-03-28 11:54:09,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 16.54/12.12 [2019-03-28 11:54:09,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 16.54/12.12 [2019-03-28 11:54:09,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 16.54/12.12 [2019-03-28 11:54:09,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.54/12.12 Termination analysis: LINEAR_WITH_GUESSES 16.54/12.12 Number of strict supporting invariants: 0 16.54/12.12 Number of non-strict supporting invariants: 1 16.54/12.12 Consider only non-deceasing supporting invariants: true 16.54/12.12 Simplify termination arguments: true 16.54/12.12 Simplify supporting invariants: trueOverapproximate stem: false 16.54/12.12 [2019-03-28 11:54:09,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.54/12.12 [2019-03-28 11:54:09,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 16.54/12.12 [2019-03-28 11:54:09,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.54/12.12 [2019-03-28 11:54:09,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.54/12.12 [2019-03-28 11:54:09,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.54/12.12 [2019-03-28 11:54:09,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 16.54/12.12 [2019-03-28 11:54:09,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 16.54/12.12 [2019-03-28 11:54:09,075 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 16.54/12.12 [2019-03-28 11:54:09,079 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 16.54/12.12 [2019-03-28 11:54:09,079 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 16.54/12.12 [2019-03-28 11:54:09,081 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 16.54/12.12 [2019-03-28 11:54:09,081 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 16.54/12.12 [2019-03-28 11:54:09,082 INFO L518 LassoAnalysis]: Proved termination. 16.54/12.12 [2019-03-28 11:54:09,082 INFO L520 LassoAnalysis]: Termination argument consisting of: 16.54/12.12 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 16.54/12.12 Supporting invariants [] 16.54/12.12 [2019-03-28 11:54:09,083 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 16.54/12.12 [2019-03-28 11:54:09,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.54/12.12 [2019-03-28 11:54:09,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core 16.54/12.12 [2019-03-28 11:54:09,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.54/12.12 [2019-03-28 11:54:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.54/12.12 [2019-03-28 11:54:09,135 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 16.54/12.12 [2019-03-28 11:54:09,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.54/12.12 [2019-03-28 11:54:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.54/12.12 [2019-03-28 11:54:09,179 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 16.54/12.12 [2019-03-28 11:54:09,184 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 16.54/12.12 [2019-03-28 11:54:09,186 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 3 states. 16.54/12.12 [2019-03-28 11:54:09,235 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 3 states. Result 13 states and 24 transitions. Complement of second has 4 states. 16.54/12.12 [2019-03-28 11:54:09,236 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 16.54/12.12 [2019-03-28 11:54:09,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 16.54/12.12 [2019-03-28 11:54:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. 16.54/12.12 [2019-03-28 11:54:09,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 1 letters. Loop has 2 letters. 16.54/12.12 [2019-03-28 11:54:09,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.54/12.12 [2019-03-28 11:54:09,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 3 letters. Loop has 2 letters. 16.54/12.12 [2019-03-28 11:54:09,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.54/12.12 [2019-03-28 11:54:09,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 1 letters. Loop has 4 letters. 16.54/12.12 [2019-03-28 11:54:09,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.54/12.12 [2019-03-28 11:54:09,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 24 transitions. 16.54/12.12 [2019-03-28 11:54:09,250 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 16.54/12.12 [2019-03-28 11:54:09,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 24 transitions. 16.54/12.12 [2019-03-28 11:54:09,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 16.54/12.12 [2019-03-28 11:54:09,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 16.54/12.12 [2019-03-28 11:54:09,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 24 transitions. 16.54/12.12 [2019-03-28 11:54:09,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 16.54/12.12 [2019-03-28 11:54:09,257 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 24 transitions. 16.54/12.12 [2019-03-28 11:54:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 24 transitions. 16.54/12.12 [2019-03-28 11:54:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. 16.54/12.12 [2019-03-28 11:54:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 16.54/12.12 [2019-03-28 11:54:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. 16.54/12.12 [2019-03-28 11:54:09,288 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 23 transitions. 16.54/12.12 [2019-03-28 11:54:09,288 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 23 transitions. 16.54/12.12 [2019-03-28 11:54:09,288 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 16.54/12.12 [2019-03-28 11:54:09,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 23 transitions. 16.54/12.12 [2019-03-28 11:54:09,289 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 16.54/12.12 [2019-03-28 11:54:09,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 16.54/12.12 [2019-03-28 11:54:09,290 INFO L119 BuchiIsEmpty]: Starting construction of run 16.54/12.12 [2019-03-28 11:54:09,290 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 16.54/12.12 [2019-03-28 11:54:09,290 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 16.54/12.12 [2019-03-28 11:54:09,291 INFO L794 eck$LassoCheckResult]: Stem: 50#ULTIMATE.startENTRY [27] ULTIMATE.startENTRY-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 51#L20-2 [30] L20-2-->L18: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_8) (< 0 v_ULTIMATE.start_main_~x~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 53#L18 16.54/12.12 [2019-03-28 11:54:09,291 INFO L796 eck$LassoCheckResult]: Loop: 53#L18 [32] L18-->L20: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_5|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 56#L20 [45] L20-->L20-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~y~0_4 (+ v_ULTIMATE.start_main_~y~0_5 (- 1))) (= v_ULTIMATE.start_main_~z~0_4 |v_ULTIMATE.start_main_#t~nondet5_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_4, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 52#L20-2 [30] L20-2-->L18: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_8) (< 0 v_ULTIMATE.start_main_~x~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 53#L18 16.54/12.12 [2019-03-28 11:54:09,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:09,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1828, now seen corresponding path program 1 times 16.54/12.12 [2019-03-28 11:54:09,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.54/12.12 [2019-03-28 11:54:09,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.54/12.12 [2019-03-28 11:54:09,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:09,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:09,301 INFO L82 PathProgramCache]: Analyzing trace with hash 61968, now seen corresponding path program 1 times 16.54/12.12 [2019-03-28 11:54:09,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.54/12.12 [2019-03-28 11:54:09,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.54/12.12 [2019-03-28 11:54:09,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:09,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:09,310 INFO L82 PathProgramCache]: Analyzing trace with hash 54490125, now seen corresponding path program 1 times 16.54/12.12 [2019-03-28 11:54:09,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.54/12.12 [2019-03-28 11:54:09,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.54/12.12 [2019-03-28 11:54:09,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:09,381 INFO L216 LassoAnalysis]: Preferences: 16.54/12.12 [2019-03-28 11:54:09,382 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 16.54/12.12 [2019-03-28 11:54:09,382 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 16.54/12.12 [2019-03-28 11:54:09,382 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 16.54/12.12 [2019-03-28 11:54:09,382 INFO L127 ssoRankerPreferences]: Use exernal solver: true 16.54/12.12 [2019-03-28 11:54:09,382 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:09,382 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 16.54/12.12 [2019-03-28 11:54:09,382 INFO L130 ssoRankerPreferences]: Path of dumped script: 16.54/12.12 [2019-03-28 11:54:09,383 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 16.54/12.12 [2019-03-28 11:54:09,383 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 16.54/12.12 [2019-03-28 11:54:09,383 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 16.54/12.12 [2019-03-28 11:54:09,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:09,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:09,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:09,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:09,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:09,466 INFO L300 LassoAnalysis]: Preprocessing complete. 16.54/12.12 [2019-03-28 11:54:09,466 INFO L412 LassoAnalysis]: Checking for nontermination... 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:09,469 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:09,469 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:09,499 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:09,499 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 [2019-03-28 11:54:09,577 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 16.54/12.12 [2019-03-28 11:54:09,579 INFO L216 LassoAnalysis]: Preferences: 16.54/12.12 [2019-03-28 11:54:09,580 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 16.54/12.12 [2019-03-28 11:54:09,580 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 16.54/12.12 [2019-03-28 11:54:09,580 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 16.54/12.12 [2019-03-28 11:54:09,580 INFO L127 ssoRankerPreferences]: Use exernal solver: false 16.54/12.12 [2019-03-28 11:54:09,580 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:09,580 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 16.54/12.12 [2019-03-28 11:54:09,581 INFO L130 ssoRankerPreferences]: Path of dumped script: 16.54/12.12 [2019-03-28 11:54:09,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 16.54/12.12 [2019-03-28 11:54:09,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 16.54/12.12 [2019-03-28 11:54:09,581 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 16.54/12.12 [2019-03-28 11:54:09,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:09,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:09,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:09,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:09,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:09,657 INFO L300 LassoAnalysis]: Preprocessing complete. 16.54/12.12 [2019-03-28 11:54:09,657 INFO L497 LassoAnalysis]: Using template 'affine'. 16.54/12.12 [2019-03-28 11:54:09,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.54/12.12 Termination analysis: LINEAR_WITH_GUESSES 16.54/12.12 Number of strict supporting invariants: 0 16.54/12.12 Number of non-strict supporting invariants: 1 16.54/12.12 Consider only non-deceasing supporting invariants: true 16.54/12.12 Simplify termination arguments: true 16.54/12.12 Simplify supporting invariants: trueOverapproximate stem: false 16.54/12.12 [2019-03-28 11:54:09,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.54/12.12 [2019-03-28 11:54:09,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 16.54/12.12 [2019-03-28 11:54:09,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.54/12.12 [2019-03-28 11:54:09,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.54/12.12 [2019-03-28 11:54:09,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.54/12.12 [2019-03-28 11:54:09,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 16.54/12.12 [2019-03-28 11:54:09,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 16.54/12.12 [2019-03-28 11:54:09,666 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 16.54/12.12 [2019-03-28 11:54:09,670 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 16.54/12.12 [2019-03-28 11:54:09,670 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 16.54/12.12 [2019-03-28 11:54:09,671 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 16.54/12.12 [2019-03-28 11:54:09,671 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 16.54/12.12 [2019-03-28 11:54:09,672 INFO L518 LassoAnalysis]: Proved termination. 16.54/12.12 [2019-03-28 11:54:09,672 INFO L520 LassoAnalysis]: Termination argument consisting of: 16.54/12.12 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 16.54/12.12 Supporting invariants [] 16.54/12.12 [2019-03-28 11:54:09,672 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 16.54/12.12 [2019-03-28 11:54:09,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.54/12.12 [2019-03-28 11:54:09,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core 16.54/12.12 [2019-03-28 11:54:09,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.54/12.12 [2019-03-28 11:54:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.54/12.12 [2019-03-28 11:54:09,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 16.54/12.12 [2019-03-28 11:54:09,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.54/12.12 [2019-03-28 11:54:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.54/12.12 [2019-03-28 11:54:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.54/12.12 [2019-03-28 11:54:09,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 16.54/12.12 [2019-03-28 11:54:09,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.54/12.12 [2019-03-28 11:54:09,789 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 16.54/12.12 [2019-03-28 11:54:09,789 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 16.54/12.12 [2019-03-28 11:54:09,789 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states and 23 transitions. cyclomatic complexity: 14 Second operand 4 states. 16.54/12.12 [2019-03-28 11:54:09,839 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states and 23 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 30 states and 58 transitions. Complement of second has 8 states. 16.54/12.12 [2019-03-28 11:54:09,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states 16.54/12.12 [2019-03-28 11:54:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 16.54/12.12 [2019-03-28 11:54:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. 16.54/12.12 [2019-03-28 11:54:09,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 3 letters. 16.54/12.12 [2019-03-28 11:54:09,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.54/12.12 [2019-03-28 11:54:09,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 3 letters. 16.54/12.12 [2019-03-28 11:54:09,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.54/12.12 [2019-03-28 11:54:09,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 6 letters. 16.54/12.12 [2019-03-28 11:54:09,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.54/12.12 [2019-03-28 11:54:09,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 58 transitions. 16.54/12.12 [2019-03-28 11:54:09,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 16.54/12.12 [2019-03-28 11:54:09,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 55 transitions. 16.54/12.12 [2019-03-28 11:54:09,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 16.54/12.12 [2019-03-28 11:54:09,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 16.54/12.12 [2019-03-28 11:54:09,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 55 transitions. 16.54/12.12 [2019-03-28 11:54:09,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 16.54/12.12 [2019-03-28 11:54:09,849 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 55 transitions. 16.54/12.12 [2019-03-28 11:54:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 55 transitions. 16.54/12.12 [2019-03-28 11:54:09,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. 16.54/12.12 [2019-03-28 11:54:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 16.54/12.12 [2019-03-28 11:54:09,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 45 transitions. 16.54/12.12 [2019-03-28 11:54:09,853 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 45 transitions. 16.54/12.12 [2019-03-28 11:54:09,853 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 45 transitions. 16.54/12.12 [2019-03-28 11:54:09,853 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 16.54/12.12 [2019-03-28 11:54:09,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 45 transitions. 16.54/12.12 [2019-03-28 11:54:09,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 16.54/12.12 [2019-03-28 11:54:09,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 16.54/12.12 [2019-03-28 11:54:09,854 INFO L119 BuchiIsEmpty]: Starting construction of run 16.54/12.12 [2019-03-28 11:54:09,855 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 16.54/12.12 [2019-03-28 11:54:09,855 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 16.54/12.12 [2019-03-28 11:54:09,855 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY [27] ULTIMATE.startENTRY-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 144#L20-2 [30] L20-2-->L18: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_8) (< 0 v_ULTIMATE.start_main_~x~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 149#L18 [32] L18-->L20: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_5|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 146#L20 16.54/12.12 [2019-03-28 11:54:09,856 INFO L796 eck$LassoCheckResult]: Loop: 146#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_5 (+ v_ULTIMATE.start_main_~z~0_6 (- 1))) (= v_ULTIMATE.start_main_~x~0_4 |v_ULTIMATE.start_main_#t~nondet6_3|) (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|)) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 154#L20-2 [30] L20-2-->L18: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_8) (< 0 v_ULTIMATE.start_main_~x~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 157#L18 [32] L18-->L20: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_5|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 146#L20 16.54/12.12 [2019-03-28 11:54:09,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:09,856 INFO L82 PathProgramCache]: Analyzing trace with hash 56700, now seen corresponding path program 1 times 16.54/12.12 [2019-03-28 11:54:09,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.54/12.12 [2019-03-28 11:54:09,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.54/12.12 [2019-03-28 11:54:09,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:09,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:09,866 INFO L82 PathProgramCache]: Analyzing trace with hash 65349, now seen corresponding path program 1 times 16.54/12.12 [2019-03-28 11:54:09,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.54/12.12 [2019-03-28 11:54:09,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.54/12.12 [2019-03-28 11:54:09,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:09,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:09,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1689185258, now seen corresponding path program 1 times 16.54/12.12 [2019-03-28 11:54:09,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.54/12.12 [2019-03-28 11:54:09,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.54/12.12 [2019-03-28 11:54:09,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:09,915 INFO L216 LassoAnalysis]: Preferences: 16.54/12.12 [2019-03-28 11:54:09,915 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 16.54/12.12 [2019-03-28 11:54:09,915 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 16.54/12.12 [2019-03-28 11:54:09,915 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 16.54/12.12 [2019-03-28 11:54:09,916 INFO L127 ssoRankerPreferences]: Use exernal solver: true 16.54/12.12 [2019-03-28 11:54:09,916 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:09,916 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 16.54/12.12 [2019-03-28 11:54:09,916 INFO L130 ssoRankerPreferences]: Path of dumped script: 16.54/12.12 [2019-03-28 11:54:09,916 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 16.54/12.12 [2019-03-28 11:54:09,916 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 16.54/12.12 [2019-03-28 11:54:09,916 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 16.54/12.12 [2019-03-28 11:54:09,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:09,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:09,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:09,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:09,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:10,029 INFO L300 LassoAnalysis]: Preprocessing complete. 16.54/12.12 [2019-03-28 11:54:10,029 INFO L412 LassoAnalysis]: Checking for nontermination... 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:10,035 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:10,035 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 [2019-03-28 11:54:10,041 INFO L445 LassoAnalysis]: Proved nontermination for one component. 16.54/12.12 [2019-03-28 11:54:10,041 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:10,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:10,071 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 [2019-03-28 11:54:10,078 INFO L445 LassoAnalysis]: Proved nontermination for one component. 16.54/12.12 [2019-03-28 11:54:10,078 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=0} Honda state: {ULTIMATE.start_main_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:10,111 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:10,112 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:10,143 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:10,143 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 [2019-03-28 11:54:10,222 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 16.54/12.12 [2019-03-28 11:54:10,224 INFO L216 LassoAnalysis]: Preferences: 16.54/12.12 [2019-03-28 11:54:10,224 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 16.54/12.12 [2019-03-28 11:54:10,225 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 16.54/12.12 [2019-03-28 11:54:10,225 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 16.54/12.12 [2019-03-28 11:54:10,225 INFO L127 ssoRankerPreferences]: Use exernal solver: false 16.54/12.12 [2019-03-28 11:54:10,225 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:10,225 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 16.54/12.12 [2019-03-28 11:54:10,225 INFO L130 ssoRankerPreferences]: Path of dumped script: 16.54/12.12 [2019-03-28 11:54:10,225 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 16.54/12.12 [2019-03-28 11:54:10,225 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 16.54/12.12 [2019-03-28 11:54:10,226 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 16.54/12.12 [2019-03-28 11:54:10,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:10,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:10,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:10,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:10,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:10,299 INFO L300 LassoAnalysis]: Preprocessing complete. 16.54/12.12 [2019-03-28 11:54:10,300 INFO L497 LassoAnalysis]: Using template 'affine'. 16.54/12.12 [2019-03-28 11:54:10,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.54/12.12 Termination analysis: LINEAR_WITH_GUESSES 16.54/12.12 Number of strict supporting invariants: 0 16.54/12.12 Number of non-strict supporting invariants: 1 16.54/12.12 Consider only non-deceasing supporting invariants: true 16.54/12.12 Simplify termination arguments: true 16.54/12.12 Simplify supporting invariants: trueOverapproximate stem: false 16.54/12.12 [2019-03-28 11:54:10,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.54/12.12 [2019-03-28 11:54:10,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 16.54/12.12 [2019-03-28 11:54:10,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.54/12.12 [2019-03-28 11:54:10,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.54/12.12 [2019-03-28 11:54:10,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.54/12.12 [2019-03-28 11:54:10,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 16.54/12.12 [2019-03-28 11:54:10,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 16.54/12.12 [2019-03-28 11:54:10,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 16.54/12.12 [2019-03-28 11:54:10,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.54/12.12 Termination analysis: LINEAR_WITH_GUESSES 16.54/12.12 Number of strict supporting invariants: 0 16.54/12.12 Number of non-strict supporting invariants: 1 16.54/12.12 Consider only non-deceasing supporting invariants: true 16.54/12.12 Simplify termination arguments: true 16.54/12.12 Simplify supporting invariants: trueOverapproximate stem: false 16.54/12.12 [2019-03-28 11:54:10,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.54/12.12 [2019-03-28 11:54:10,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 16.54/12.12 [2019-03-28 11:54:10,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.54/12.12 [2019-03-28 11:54:10,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.54/12.12 [2019-03-28 11:54:10,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.54/12.12 [2019-03-28 11:54:10,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 16.54/12.12 [2019-03-28 11:54:10,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 16.54/12.12 [2019-03-28 11:54:10,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 16.54/12.12 [2019-03-28 11:54:10,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.54/12.12 Termination analysis: LINEAR_WITH_GUESSES 16.54/12.12 Number of strict supporting invariants: 0 16.54/12.12 Number of non-strict supporting invariants: 1 16.54/12.12 Consider only non-deceasing supporting invariants: true 16.54/12.12 Simplify termination arguments: true 16.54/12.12 Simplify supporting invariants: trueOverapproximate stem: false 16.54/12.12 [2019-03-28 11:54:10,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.54/12.12 [2019-03-28 11:54:10,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 16.54/12.12 [2019-03-28 11:54:10,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.54/12.12 [2019-03-28 11:54:10,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.54/12.12 [2019-03-28 11:54:10,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.54/12.12 [2019-03-28 11:54:10,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 16.54/12.12 [2019-03-28 11:54:10,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 16.54/12.12 [2019-03-28 11:54:10,313 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 16.54/12.12 [2019-03-28 11:54:10,317 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 16.54/12.12 [2019-03-28 11:54:10,317 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 16.54/12.12 [2019-03-28 11:54:10,317 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 16.54/12.12 [2019-03-28 11:54:10,318 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 16.54/12.12 [2019-03-28 11:54:10,318 INFO L518 LassoAnalysis]: Proved termination. 16.54/12.12 [2019-03-28 11:54:10,318 INFO L520 LassoAnalysis]: Termination argument consisting of: 16.54/12.12 Ranking function f(ULTIMATE.start_main_~z~0) = 1*ULTIMATE.start_main_~z~0 16.54/12.12 Supporting invariants [] 16.54/12.12 [2019-03-28 11:54:10,319 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 16.54/12.12 [2019-03-28 11:54:10,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.54/12.12 [2019-03-28 11:54:10,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core 16.54/12.12 [2019-03-28 11:54:10,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.54/12.12 [2019-03-28 11:54:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.54/12.12 [2019-03-28 11:54:10,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core 16.54/12.12 [2019-03-28 11:54:10,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.54/12.12 [2019-03-28 11:54:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.54/12.12 [2019-03-28 11:54:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.54/12.12 [2019-03-28 11:54:10,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core 16.54/12.12 [2019-03-28 11:54:10,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.54/12.12 [2019-03-28 11:54:10,395 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 16.54/12.12 [2019-03-28 11:54:10,395 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 16.54/12.12 [2019-03-28 11:54:10,395 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 45 transitions. cyclomatic complexity: 28 Second operand 4 states. 16.54/12.12 [2019-03-28 11:54:10,480 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 45 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 51 states and 103 transitions. Complement of second has 14 states. 16.54/12.12 [2019-03-28 11:54:10,481 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 16.54/12.12 [2019-03-28 11:54:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 16.54/12.12 [2019-03-28 11:54:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. 16.54/12.12 [2019-03-28 11:54:10,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 3 letters. Loop has 3 letters. 16.54/12.12 [2019-03-28 11:54:10,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.54/12.12 [2019-03-28 11:54:10,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 6 letters. Loop has 3 letters. 16.54/12.12 [2019-03-28 11:54:10,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.54/12.12 [2019-03-28 11:54:10,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 3 letters. Loop has 6 letters. 16.54/12.12 [2019-03-28 11:54:10,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.54/12.12 [2019-03-28 11:54:10,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 103 transitions. 16.54/12.12 [2019-03-28 11:54:10,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 16.54/12.12 [2019-03-28 11:54:10,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 45 states and 95 transitions. 16.54/12.12 [2019-03-28 11:54:10,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 16.54/12.12 [2019-03-28 11:54:10,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 16.54/12.12 [2019-03-28 11:54:10,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 95 transitions. 16.54/12.12 [2019-03-28 11:54:10,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 16.54/12.12 [2019-03-28 11:54:10,490 INFO L706 BuchiCegarLoop]: Abstraction has 45 states and 95 transitions. 16.54/12.12 [2019-03-28 11:54:10,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 95 transitions. 16.54/12.12 [2019-03-28 11:54:10,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. 16.54/12.12 [2019-03-28 11:54:10,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 16.54/12.12 [2019-03-28 11:54:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 81 transitions. 16.54/12.12 [2019-03-28 11:54:10,496 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 81 transitions. 16.54/12.12 [2019-03-28 11:54:10,496 INFO L609 BuchiCegarLoop]: Abstraction has 39 states and 81 transitions. 16.54/12.12 [2019-03-28 11:54:10,496 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 16.54/12.12 [2019-03-28 11:54:10,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 81 transitions. 16.54/12.12 [2019-03-28 11:54:10,498 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 16.54/12.12 [2019-03-28 11:54:10,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 16.54/12.12 [2019-03-28 11:54:10,498 INFO L119 BuchiIsEmpty]: Starting construction of run 16.54/12.12 [2019-03-28 11:54:10,499 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] 16.54/12.12 [2019-03-28 11:54:10,499 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 16.54/12.12 [2019-03-28 11:54:10,499 INFO L794 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY [27] ULTIMATE.startENTRY-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 278#L20-2 [30] L20-2-->L18: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_8) (< 0 v_ULTIMATE.start_main_~x~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 305#L18 [32] L18-->L20: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_5|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 286#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_5 (+ v_ULTIMATE.start_main_~z~0_6 (- 1))) (= v_ULTIMATE.start_main_~x~0_4 |v_ULTIMATE.start_main_#t~nondet6_3|) (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|)) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 287#L20-2 [30] L20-2-->L18: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_8) (< 0 v_ULTIMATE.start_main_~x~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 297#L18 [44] L18-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (> 0 |v_ULTIMATE.start_main_#t~nondet3_3|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 284#L20-2 16.54/12.12 [2019-03-28 11:54:10,499 INFO L796 eck$LassoCheckResult]: Loop: 284#L20-2 [30] L20-2-->L18: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_8) (< 0 v_ULTIMATE.start_main_~x~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 285#L18 [43] L18-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (< 0 |v_ULTIMATE.start_main_#t~nondet3_3|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 284#L20-2 16.54/12.12 [2019-03-28 11:54:10,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:10,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1689185270, now seen corresponding path program 1 times 16.54/12.12 [2019-03-28 11:54:10,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.54/12.12 [2019-03-28 11:54:10,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.54/12.12 [2019-03-28 11:54:10,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:10,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:10,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1934, now seen corresponding path program 2 times 16.54/12.12 [2019-03-28 11:54:10,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.54/12.12 [2019-03-28 11:54:10,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.54/12.12 [2019-03-28 11:54:10,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:10,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:10,519 INFO L82 PathProgramCache]: Analyzing trace with hash -190592445, now seen corresponding path program 1 times 16.54/12.12 [2019-03-28 11:54:10,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.54/12.12 [2019-03-28 11:54:10,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.54/12.12 [2019-03-28 11:54:10,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:10,560 INFO L216 LassoAnalysis]: Preferences: 16.54/12.12 [2019-03-28 11:54:10,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 16.54/12.12 [2019-03-28 11:54:10,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 16.54/12.12 [2019-03-28 11:54:10,560 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 16.54/12.12 [2019-03-28 11:54:10,561 INFO L127 ssoRankerPreferences]: Use exernal solver: true 16.54/12.12 [2019-03-28 11:54:10,561 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:10,561 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 16.54/12.12 [2019-03-28 11:54:10,561 INFO L130 ssoRankerPreferences]: Path of dumped script: 16.54/12.12 [2019-03-28 11:54:10,561 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 16.54/12.12 [2019-03-28 11:54:10,561 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 16.54/12.12 [2019-03-28 11:54:10,561 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 16.54/12.12 [2019-03-28 11:54:10,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:10,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:10,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:10,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:10,632 INFO L300 LassoAnalysis]: Preprocessing complete. 16.54/12.12 [2019-03-28 11:54:10,633 INFO L412 LassoAnalysis]: Checking for nontermination... 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:10,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:10,636 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 [2019-03-28 11:54:10,663 INFO L445 LassoAnalysis]: Proved nontermination for one component. 16.54/12.12 [2019-03-28 11:54:10,663 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~z~0=1} Honda state: {ULTIMATE.start_main_~z~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:10,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:10,668 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 [2019-03-28 11:54:10,694 INFO L445 LassoAnalysis]: Proved nontermination for one component. 16.54/12.12 [2019-03-28 11:54:10,694 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:10,698 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:10,698 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 [2019-03-28 11:54:10,724 INFO L445 LassoAnalysis]: Proved nontermination for one component. 16.54/12.12 [2019-03-28 11:54:10,725 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=1} Honda state: {ULTIMATE.start_main_#t~nondet3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:10,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:10,729 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:10,759 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:10,759 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 [2019-03-28 11:54:10,788 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 16.54/12.12 [2019-03-28 11:54:10,789 INFO L216 LassoAnalysis]: Preferences: 16.54/12.12 [2019-03-28 11:54:10,789 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 16.54/12.12 [2019-03-28 11:54:10,789 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 16.54/12.12 [2019-03-28 11:54:10,790 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 16.54/12.12 [2019-03-28 11:54:10,790 INFO L127 ssoRankerPreferences]: Use exernal solver: false 16.54/12.12 [2019-03-28 11:54:10,790 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:10,790 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 16.54/12.12 [2019-03-28 11:54:10,790 INFO L130 ssoRankerPreferences]: Path of dumped script: 16.54/12.12 [2019-03-28 11:54:10,790 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 16.54/12.12 [2019-03-28 11:54:10,790 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 16.54/12.12 [2019-03-28 11:54:10,790 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 16.54/12.12 [2019-03-28 11:54:10,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:10,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:10,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:10,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:10,822 INFO L300 LassoAnalysis]: Preprocessing complete. 16.54/12.12 [2019-03-28 11:54:10,823 INFO L497 LassoAnalysis]: Using template 'affine'. 16.54/12.12 [2019-03-28 11:54:10,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.54/12.12 Termination analysis: LINEAR_WITH_GUESSES 16.54/12.12 Number of strict supporting invariants: 0 16.54/12.12 Number of non-strict supporting invariants: 1 16.54/12.12 Consider only non-deceasing supporting invariants: true 16.54/12.12 Simplify termination arguments: true 16.54/12.12 Simplify supporting invariants: trueOverapproximate stem: false 16.54/12.12 [2019-03-28 11:54:10,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.54/12.12 [2019-03-28 11:54:10,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 16.54/12.12 [2019-03-28 11:54:10,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.54/12.12 [2019-03-28 11:54:10,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.54/12.12 [2019-03-28 11:54:10,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.54/12.12 [2019-03-28 11:54:10,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 16.54/12.12 [2019-03-28 11:54:10,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 16.54/12.12 [2019-03-28 11:54:10,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 16.54/12.12 [2019-03-28 11:54:10,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.54/12.12 Termination analysis: LINEAR_WITH_GUESSES 16.54/12.12 Number of strict supporting invariants: 0 16.54/12.12 Number of non-strict supporting invariants: 1 16.54/12.12 Consider only non-deceasing supporting invariants: true 16.54/12.12 Simplify termination arguments: true 16.54/12.12 Simplify supporting invariants: trueOverapproximate stem: false 16.54/12.12 [2019-03-28 11:54:10,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.54/12.12 [2019-03-28 11:54:10,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 16.54/12.12 [2019-03-28 11:54:10,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.54/12.12 [2019-03-28 11:54:10,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.54/12.12 [2019-03-28 11:54:10,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.54/12.12 [2019-03-28 11:54:10,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 16.54/12.12 [2019-03-28 11:54:10,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 16.54/12.12 [2019-03-28 11:54:10,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 16.54/12.12 [2019-03-28 11:54:10,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.54/12.12 Termination analysis: LINEAR_WITH_GUESSES 16.54/12.12 Number of strict supporting invariants: 0 16.54/12.12 Number of non-strict supporting invariants: 1 16.54/12.12 Consider only non-deceasing supporting invariants: true 16.54/12.12 Simplify termination arguments: true 16.54/12.12 Simplify supporting invariants: trueOverapproximate stem: false 16.54/12.12 [2019-03-28 11:54:10,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.54/12.12 [2019-03-28 11:54:10,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 16.54/12.12 [2019-03-28 11:54:10,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.54/12.12 [2019-03-28 11:54:10,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.54/12.12 [2019-03-28 11:54:10,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.54/12.12 [2019-03-28 11:54:10,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 16.54/12.12 [2019-03-28 11:54:10,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 16.54/12.12 [2019-03-28 11:54:10,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 16.54/12.12 [2019-03-28 11:54:10,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.54/12.12 Termination analysis: LINEAR_WITH_GUESSES 16.54/12.12 Number of strict supporting invariants: 0 16.54/12.12 Number of non-strict supporting invariants: 1 16.54/12.12 Consider only non-deceasing supporting invariants: true 16.54/12.12 Simplify termination arguments: true 16.54/12.12 Simplify supporting invariants: trueOverapproximate stem: false 16.54/12.12 [2019-03-28 11:54:10,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.54/12.12 [2019-03-28 11:54:10,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 16.54/12.12 [2019-03-28 11:54:10,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.54/12.12 [2019-03-28 11:54:10,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.54/12.12 [2019-03-28 11:54:10,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.54/12.12 [2019-03-28 11:54:10,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 16.54/12.12 [2019-03-28 11:54:10,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 16.54/12.12 [2019-03-28 11:54:10,839 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 16.54/12.12 [2019-03-28 11:54:10,841 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 16.54/12.12 [2019-03-28 11:54:10,841 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 16.54/12.12 [2019-03-28 11:54:10,841 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 16.54/12.12 [2019-03-28 11:54:10,842 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 16.54/12.12 [2019-03-28 11:54:10,842 INFO L518 LassoAnalysis]: Proved termination. 16.54/12.12 [2019-03-28 11:54:10,842 INFO L520 LassoAnalysis]: Termination argument consisting of: 16.54/12.12 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 16.54/12.12 Supporting invariants [] 16.54/12.12 [2019-03-28 11:54:10,842 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 16.54/12.12 [2019-03-28 11:54:10,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.54/12.12 [2019-03-28 11:54:10,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core 16.54/12.12 [2019-03-28 11:54:10,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.54/12.12 [2019-03-28 11:54:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.54/12.12 [2019-03-28 11:54:10,875 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 16.54/12.12 [2019-03-28 11:54:10,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.54/12.12 [2019-03-28 11:54:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.54/12.12 [2019-03-28 11:54:10,896 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 16.54/12.12 [2019-03-28 11:54:10,896 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 16.54/12.12 [2019-03-28 11:54:10,896 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 39 states and 81 transitions. cyclomatic complexity: 49 Second operand 3 states. 16.54/12.12 [2019-03-28 11:54:10,929 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 39 states and 81 transitions. cyclomatic complexity: 49. Second operand 3 states. Result 94 states and 177 transitions. Complement of second has 4 states. 16.54/12.12 [2019-03-28 11:54:10,929 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 16.54/12.12 [2019-03-28 11:54:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 16.54/12.12 [2019-03-28 11:54:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. 16.54/12.12 [2019-03-28 11:54:10,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 2 letters. 16.54/12.12 [2019-03-28 11:54:10,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.54/12.12 [2019-03-28 11:54:10,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 8 letters. Loop has 2 letters. 16.54/12.12 [2019-03-28 11:54:10,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.54/12.12 [2019-03-28 11:54:10,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 4 letters. 16.54/12.12 [2019-03-28 11:54:10,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.54/12.12 [2019-03-28 11:54:10,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 177 transitions. 16.54/12.12 [2019-03-28 11:54:10,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 16.54/12.12 [2019-03-28 11:54:10,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 77 states and 148 transitions. 16.54/12.12 [2019-03-28 11:54:10,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 16.54/12.12 [2019-03-28 11:54:10,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 16.54/12.12 [2019-03-28 11:54:10,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 148 transitions. 16.54/12.12 [2019-03-28 11:54:10,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 16.54/12.12 [2019-03-28 11:54:10,937 INFO L706 BuchiCegarLoop]: Abstraction has 77 states and 148 transitions. 16.54/12.12 [2019-03-28 11:54:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 148 transitions. 16.54/12.12 [2019-03-28 11:54:10,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. 16.54/12.12 [2019-03-28 11:54:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. 16.54/12.12 [2019-03-28 11:54:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 110 transitions. 16.54/12.12 [2019-03-28 11:54:10,943 INFO L729 BuchiCegarLoop]: Abstraction has 55 states and 110 transitions. 16.54/12.12 [2019-03-28 11:54:10,944 INFO L609 BuchiCegarLoop]: Abstraction has 55 states and 110 transitions. 16.54/12.12 [2019-03-28 11:54:10,944 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 16.54/12.12 [2019-03-28 11:54:10,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 110 transitions. 16.54/12.12 [2019-03-28 11:54:10,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 16.54/12.12 [2019-03-28 11:54:10,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 16.54/12.12 [2019-03-28 11:54:10,945 INFO L119 BuchiIsEmpty]: Starting construction of run 16.54/12.12 [2019-03-28 11:54:10,946 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] 16.54/12.12 [2019-03-28 11:54:10,946 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 16.54/12.12 [2019-03-28 11:54:10,946 INFO L794 eck$LassoCheckResult]: Stem: 455#ULTIMATE.startENTRY [27] ULTIMATE.startENTRY-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 456#L20-2 [30] L20-2-->L18: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_8) (< 0 v_ULTIMATE.start_main_~x~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 494#L18 [32] L18-->L20: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_5|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 464#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_5 (+ v_ULTIMATE.start_main_~z~0_6 (- 1))) (= v_ULTIMATE.start_main_~x~0_4 |v_ULTIMATE.start_main_#t~nondet6_3|) (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|)) InVars {ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_3|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|} OutVars{ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 465#L20-2 [30] L20-2-->L18: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_8) (< 0 v_ULTIMATE.start_main_~x~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 467#L18 [43] L18-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (< 0 |v_ULTIMATE.start_main_#t~nondet3_3|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 470#L20-2 16.54/12.12 [2019-03-28 11:54:10,946 INFO L796 eck$LassoCheckResult]: Loop: 470#L20-2 [30] L20-2-->L18: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (< 0 v_ULTIMATE.start_main_~z~0_8) (< 0 v_ULTIMATE.start_main_~x~0_6)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 472#L18 [43] L18-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_8 (- 1))) (< 0 |v_ULTIMATE.start_main_#t~nondet3_3|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0] 470#L20-2 16.54/12.12 [2019-03-28 11:54:10,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:10,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1689185269, now seen corresponding path program 1 times 16.54/12.12 [2019-03-28 11:54:10,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.54/12.12 [2019-03-28 11:54:10,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.54/12.12 [2019-03-28 11:54:10,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:10,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:10,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1934, now seen corresponding path program 3 times 16.54/12.12 [2019-03-28 11:54:10,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.54/12.12 [2019-03-28 11:54:10,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.54/12.12 [2019-03-28 11:54:10,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:10,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:10,964 INFO L82 PathProgramCache]: Analyzing trace with hash -190593406, now seen corresponding path program 2 times 16.54/12.12 [2019-03-28 11:54:10,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.54/12.12 [2019-03-28 11:54:10,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.54/12.12 [2019-03-28 11:54:10,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.54/12.12 [2019-03-28 11:54:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.54/12.12 [2019-03-28 11:54:10,993 INFO L216 LassoAnalysis]: Preferences: 16.54/12.12 [2019-03-28 11:54:10,993 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 16.54/12.12 [2019-03-28 11:54:10,993 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 16.54/12.12 [2019-03-28 11:54:10,993 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 16.54/12.12 [2019-03-28 11:54:10,993 INFO L127 ssoRankerPreferences]: Use exernal solver: true 16.54/12.12 [2019-03-28 11:54:10,993 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:10,993 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 16.54/12.12 [2019-03-28 11:54:10,994 INFO L130 ssoRankerPreferences]: Path of dumped script: 16.54/12.12 [2019-03-28 11:54:10,994 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 16.54/12.12 [2019-03-28 11:54:10,994 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 16.54/12.12 [2019-03-28 11:54:10,994 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 16.54/12.12 [2019-03-28 11:54:10,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:10,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:10,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:11,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:11,027 INFO L300 LassoAnalysis]: Preprocessing complete. 16.54/12.12 [2019-03-28 11:54:11,028 INFO L412 LassoAnalysis]: Checking for nontermination... 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:11,030 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:11,030 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 [2019-03-28 11:54:11,057 INFO L445 LassoAnalysis]: Proved nontermination for one component. 16.54/12.12 [2019-03-28 11:54:11,057 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:11,062 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:11,062 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 [2019-03-28 11:54:11,088 INFO L445 LassoAnalysis]: Proved nontermination for one component. 16.54/12.12 [2019-03-28 11:54:11,089 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~z~0=1} Honda state: {ULTIMATE.start_main_~z~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:11,093 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:11,093 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 [2019-03-28 11:54:11,119 INFO L445 LassoAnalysis]: Proved nontermination for one component. 16.54/12.12 [2019-03-28 11:54:11,119 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=1} Honda state: {ULTIMATE.start_main_#t~nondet3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:11,123 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:11,124 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 16.54/12.12 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 16.54/12.12 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:11,152 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 16.54/12.12 [2019-03-28 11:54:11,153 INFO L163 nArgumentSynthesizer]: Using integer mode. 16.54/12.12 [2019-03-28 11:54:11,182 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 16.54/12.12 [2019-03-28 11:54:11,184 INFO L216 LassoAnalysis]: Preferences: 16.54/12.12 [2019-03-28 11:54:11,184 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 16.54/12.12 [2019-03-28 11:54:11,184 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 16.54/12.12 [2019-03-28 11:54:11,184 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 16.54/12.12 [2019-03-28 11:54:11,184 INFO L127 ssoRankerPreferences]: Use exernal solver: false 16.54/12.12 [2019-03-28 11:54:11,184 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 16.54/12.12 [2019-03-28 11:54:11,184 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 16.54/12.12 [2019-03-28 11:54:11,184 INFO L130 ssoRankerPreferences]: Path of dumped script: 16.54/12.12 [2019-03-28 11:54:11,185 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 16.54/12.12 [2019-03-28 11:54:11,185 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 16.54/12.12 [2019-03-28 11:54:11,185 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 16.54/12.12 [2019-03-28 11:54:11,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:11,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:11,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:11,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 16.54/12.12 [2019-03-28 11:54:11,218 INFO L300 LassoAnalysis]: Preprocessing complete. 16.54/12.12 [2019-03-28 11:54:11,219 INFO L497 LassoAnalysis]: Using template 'affine'. 16.54/12.12 [2019-03-28 11:54:11,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.54/12.12 Termination analysis: LINEAR_WITH_GUESSES 16.54/12.12 Number of strict supporting invariants: 0 16.54/12.12 Number of non-strict supporting invariants: 1 16.54/12.12 Consider only non-deceasing supporting invariants: true 16.54/12.12 Simplify termination arguments: true 16.54/12.12 Simplify supporting invariants: trueOverapproximate stem: false 16.54/12.12 [2019-03-28 11:54:11,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.54/12.12 [2019-03-28 11:54:11,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 16.54/12.12 [2019-03-28 11:54:11,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.54/12.12 [2019-03-28 11:54:11,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.54/12.12 [2019-03-28 11:54:11,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.54/12.12 [2019-03-28 11:54:11,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 16.54/12.12 [2019-03-28 11:54:11,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 16.54/12.12 [2019-03-28 11:54:11,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 16.54/12.12 [2019-03-28 11:54:11,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.54/12.12 Termination analysis: LINEAR_WITH_GUESSES 16.54/12.12 Number of strict supporting invariants: 0 16.54/12.12 Number of non-strict supporting invariants: 1 16.54/12.12 Consider only non-deceasing supporting invariants: true 16.54/12.12 Simplify termination arguments: true 16.54/12.12 Simplify supporting invariants: trueOverapproximate stem: false 16.54/12.12 [2019-03-28 11:54:11,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.54/12.12 [2019-03-28 11:54:11,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 16.54/12.12 [2019-03-28 11:54:11,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.54/12.12 [2019-03-28 11:54:11,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.54/12.12 [2019-03-28 11:54:11,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.54/12.12 [2019-03-28 11:54:11,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 16.54/12.12 [2019-03-28 11:54:11,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 16.54/12.12 [2019-03-28 11:54:11,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 16.54/12.12 [2019-03-28 11:54:11,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.54/12.12 Termination analysis: LINEAR_WITH_GUESSES 16.54/12.12 Number of strict supporting invariants: 0 16.54/12.12 Number of non-strict supporting invariants: 1 16.54/12.12 Consider only non-deceasing supporting invariants: true 16.54/12.12 Simplify termination arguments: true 16.54/12.12 Simplify supporting invariants: trueOverapproximate stem: false 16.54/12.12 [2019-03-28 11:54:11,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.54/12.12 [2019-03-28 11:54:11,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 16.54/12.12 [2019-03-28 11:54:11,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.54/12.12 [2019-03-28 11:54:11,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.54/12.12 [2019-03-28 11:54:11,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.54/12.12 [2019-03-28 11:54:11,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 16.54/12.12 [2019-03-28 11:54:11,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 16.54/12.12 [2019-03-28 11:54:11,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 16.54/12.12 [2019-03-28 11:54:11,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 16.54/12.12 Termination analysis: LINEAR_WITH_GUESSES 16.54/12.12 Number of strict supporting invariants: 0 16.54/12.12 Number of non-strict supporting invariants: 1 16.54/12.12 Consider only non-deceasing supporting invariants: true 16.54/12.12 Simplify termination arguments: true 16.54/12.12 Simplify supporting invariants: trueOverapproximate stem: false 16.54/12.12 [2019-03-28 11:54:11,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. 16.54/12.12 [2019-03-28 11:54:11,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 16.54/12.12 [2019-03-28 11:54:11,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 16.54/12.12 [2019-03-28 11:54:11,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 16.54/12.12 [2019-03-28 11:54:11,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 16.54/12.12 [2019-03-28 11:54:11,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 16.54/12.12 [2019-03-28 11:54:11,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 16.54/12.12 [2019-03-28 11:54:11,233 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 16.54/12.12 [2019-03-28 11:54:11,235 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 16.54/12.12 [2019-03-28 11:54:11,235 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 16.54/12.12 [2019-03-28 11:54:11,235 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 16.54/12.12 [2019-03-28 11:54:11,235 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 16.54/12.12 [2019-03-28 11:54:11,236 INFO L518 LassoAnalysis]: Proved termination. 16.54/12.12 [2019-03-28 11:54:11,236 INFO L520 LassoAnalysis]: Termination argument consisting of: 16.54/12.12 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 16.54/12.12 Supporting invariants [] 16.54/12.12 [2019-03-28 11:54:11,236 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 16.54/12.12 [2019-03-28 11:54:11,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.54/12.12 [2019-03-28 11:54:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.54/12.12 [2019-03-28 11:54:11,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core 16.54/12.12 [2019-03-28 11:54:11,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.54/12.12 [2019-03-28 11:54:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.54/12.12 [2019-03-28 11:54:11,258 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 16.54/12.12 [2019-03-28 11:54:11,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... 16.54/12.12 [2019-03-28 11:54:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.54/12.12 [2019-03-28 11:54:11,275 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 16.54/12.12 [2019-03-28 11:54:11,275 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 16.54/12.12 [2019-03-28 11:54:11,275 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 55 states and 110 transitions. cyclomatic complexity: 61 Second operand 3 states. 16.54/12.12 [2019-03-28 11:54:11,309 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 55 states and 110 transitions. cyclomatic complexity: 61. Second operand 3 states. Result 138 states and 263 transitions. Complement of second has 4 states. 16.54/12.12 [2019-03-28 11:54:11,309 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 16.54/12.12 [2019-03-28 11:54:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 16.54/12.12 [2019-03-28 11:54:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. 16.54/12.12 [2019-03-28 11:54:11,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 2 letters. 16.54/12.12 [2019-03-28 11:54:11,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.54/12.12 [2019-03-28 11:54:11,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 8 letters. Loop has 2 letters. 16.54/12.12 [2019-03-28 11:54:11,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.54/12.12 [2019-03-28 11:54:11,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 4 letters. 16.54/12.12 [2019-03-28 11:54:11,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. 16.54/12.12 [2019-03-28 11:54:11,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 263 transitions. 16.54/12.12 [2019-03-28 11:54:11,315 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 16.54/12.12 [2019-03-28 11:54:11,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 0 states and 0 transitions. 16.54/12.12 [2019-03-28 11:54:11,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 16.54/12.12 [2019-03-28 11:54:11,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 16.54/12.12 [2019-03-28 11:54:11,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 16.54/12.12 [2019-03-28 11:54:11,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 16.54/12.12 [2019-03-28 11:54:11,316 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 16.54/12.12 [2019-03-28 11:54:11,316 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 16.54/12.12 [2019-03-28 11:54:11,316 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 16.54/12.12 [2019-03-28 11:54:11,316 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 16.54/12.12 [2019-03-28 11:54:11,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 16.54/12.12 [2019-03-28 11:54:11,316 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 16.54/12.12 [2019-03-28 11:54:11,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 16.54/12.12 [2019-03-28 11:54:11,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:54:11 BasicIcfg 16.54/12.12 [2019-03-28 11:54:11,322 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 16.54/12.12 [2019-03-28 11:54:11,323 INFO L168 Benchmark]: Toolchain (without parser) took 3650.67 ms. Allocated memory was 649.6 MB in the beginning and 750.8 MB in the end (delta: 101.2 MB). Free memory was 559.5 MB in the beginning and 586.2 MB in the end (delta: -26.7 MB). Peak memory consumption was 74.5 MB. Max. memory is 50.3 GB. 16.54/12.12 [2019-03-28 11:54:11,325 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. 16.54/12.12 [2019-03-28 11:54:11,325 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.06 ms. Allocated memory is still 649.6 MB. Free memory was 559.5 MB in the beginning and 548.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 16.54/12.12 [2019-03-28 11:54:11,326 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.05 ms. Allocated memory was 649.6 MB in the beginning and 653.8 MB in the end (delta: 4.2 MB). Free memory was 548.6 MB in the beginning and 620.6 MB in the end (delta: -72.0 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. 16.54/12.12 [2019-03-28 11:54:11,326 INFO L168 Benchmark]: Boogie Preprocessor took 19.82 ms. Allocated memory is still 653.8 MB. Free memory was 620.6 MB in the beginning and 619.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 16.54/12.12 [2019-03-28 11:54:11,327 INFO L168 Benchmark]: RCFGBuilder took 211.98 ms. Allocated memory is still 653.8 MB. Free memory was 619.5 MB in the beginning and 604.3 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 50.3 GB. 16.54/12.12 [2019-03-28 11:54:11,327 INFO L168 Benchmark]: BlockEncodingV2 took 77.80 ms. Allocated memory is still 653.8 MB. Free memory was 604.3 MB in the beginning and 600.0 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. 16.54/12.12 [2019-03-28 11:54:11,328 INFO L168 Benchmark]: TraceAbstraction took 150.40 ms. Allocated memory is still 653.8 MB. Free memory was 598.9 MB in the beginning and 590.2 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 16.54/12.12 [2019-03-28 11:54:11,328 INFO L168 Benchmark]: BuchiAutomizer took 2842.13 ms. Allocated memory was 653.8 MB in the beginning and 750.8 MB in the end (delta: 97.0 MB). Free memory was 590.2 MB in the beginning and 586.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 101.0 MB. Max. memory is 50.3 GB. 16.54/12.12 [2019-03-28 11:54:11,333 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 16.54/12.12 --- Results --- 16.54/12.12 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 16.54/12.12 - StatisticsResult: Initial Icfg 16.54/12.12 7 locations, 10 edges 16.54/12.12 - StatisticsResult: Encoded RCFG 16.54/12.12 4 locations, 8 edges 16.54/12.12 * Results from de.uni_freiburg.informatik.ultimate.core: 16.54/12.12 - StatisticsResult: Toolchain Benchmarks 16.54/12.12 Benchmark results are: 16.54/12.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. 16.54/12.12 * CACSL2BoogieTranslator took 254.06 ms. Allocated memory is still 649.6 MB. Free memory was 559.5 MB in the beginning and 548.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 16.54/12.12 * Boogie Procedure Inliner took 89.05 ms. Allocated memory was 649.6 MB in the beginning and 653.8 MB in the end (delta: 4.2 MB). Free memory was 548.6 MB in the beginning and 620.6 MB in the end (delta: -72.0 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. 16.54/12.12 * Boogie Preprocessor took 19.82 ms. Allocated memory is still 653.8 MB. Free memory was 620.6 MB in the beginning and 619.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 16.54/12.12 * RCFGBuilder took 211.98 ms. Allocated memory is still 653.8 MB. Free memory was 619.5 MB in the beginning and 604.3 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 50.3 GB. 16.54/12.12 * BlockEncodingV2 took 77.80 ms. Allocated memory is still 653.8 MB. Free memory was 604.3 MB in the beginning and 600.0 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. 16.54/12.12 * TraceAbstraction took 150.40 ms. Allocated memory is still 653.8 MB. Free memory was 598.9 MB in the beginning and 590.2 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 16.54/12.12 * BuchiAutomizer took 2842.13 ms. Allocated memory was 653.8 MB in the beginning and 750.8 MB in the end (delta: 97.0 MB). Free memory was 590.2 MB in the beginning and 586.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 101.0 MB. Max. memory is 50.3 GB. 16.54/12.12 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 16.54/12.12 - AllSpecificationsHoldResult: All specifications hold 16.54/12.12 We were not able to verify any specifiation because the program does not contain any specification. 16.54/12.12 - InvariantResult [Line: 17]: Loop Invariant 16.54/12.12 Derived loop invariant: 1 16.54/12.12 - StatisticsResult: Ultimate Automizer benchmark data 16.54/12.12 CFG has 1 procedures, 4 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=4occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 16.54/12.12 - StatisticsResult: Constructed decomposition of program 16.54/12.12 Your program was decomposed into 5 terminating modules (0 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function z and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. 16.54/12.12 - StatisticsResult: Timing statistics 16.54/12.12 BüchiAutomizer plugin needed 2.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 55 states and ocurred in iteration 4. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 81 SDslu, 24 SDs, 0 SdLazy, 116 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf100 lsp47 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s 16.54/12.12 - TerminationAnalysisResult: Termination proven 16.54/12.12 Buchi Automizer proved that your program is terminating 16.54/12.12 RESULT: Ultimate proved your program to be correct! 16.54/12.12 !SESSION 2019-03-28 11:54:02.465 ----------------------------------------------- 16.54/12.12 eclipse.buildId=unknown 16.54/12.12 java.version=1.8.0_181 16.54/12.12 java.vendor=Oracle Corporation 16.54/12.12 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 16.54/12.12 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 16.54/12.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 16.54/12.12 16.54/12.12 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 11:54:11.565 16.54/12.12 !MESSAGE The workspace will exit with unsaved changes in this session. 16.54/12.12 Received shutdown request... 16.54/12.12 Ultimate: 16.54/12.12 GTK+ Version Check 16.54/12.12 EOF