./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3b895ffd-8390-4378-9df6-93151d5e8507/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3b895ffd-8390-4378-9df6-93151d5e8507/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3b895ffd-8390-4378-9df6-93151d5e8507/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3b895ffd-8390-4378-9df6-93151d5e8507/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3b895ffd-8390-4378-9df6-93151d5e8507/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3b895ffd-8390-4378-9df6-93151d5e8507/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 63b671e779f88a024ade70e8e63a2c2a737aca60 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:03:04,270 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:03:04,271 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:03:04,279 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:03:04,279 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:03:04,280 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:03:04,280 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:03:04,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:03:04,283 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:03:04,284 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:03:04,285 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:03:04,285 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:03:04,286 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:03:04,287 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:03:04,288 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:03:04,288 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:03:04,289 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:03:04,291 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:03:04,292 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:03:04,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:03:04,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:03:04,295 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:03:04,297 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:03:04,297 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:03:04,298 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:03:04,299 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:03:04,300 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:03:04,300 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:03:04,301 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:03:04,302 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:03:04,302 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:03:04,302 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:03:04,303 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:03:04,303 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:03:04,304 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:03:04,304 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:03:04,304 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3b895ffd-8390-4378-9df6-93151d5e8507/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 13:03:04,315 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:03:04,316 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:03:04,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:03:04,317 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:03:04,317 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:03:04,317 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:03:04,317 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:03:04,317 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:03:04,317 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:03:04,318 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:03:04,318 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:03:04,318 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:03:04,318 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:03:04,318 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:03:04,319 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:03:04,319 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:03:04,319 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:03:04,319 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:03:04,319 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:03:04,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:03:04,319 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:03:04,320 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:03:04,320 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:03:04,320 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:03:04,320 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:03:04,320 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:03:04,320 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:03:04,320 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:03:04,320 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:03:04,320 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:03:04,320 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:03:04,321 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:03:04,321 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_3b895ffd-8390-4378-9df6-93151d5e8507/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 63b671e779f88a024ade70e8e63a2c2a737aca60 [2018-11-28 13:03:04,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:03:04,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:03:04,358 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:03:04,359 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:03:04,360 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:03:04,360 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3b895ffd-8390-4378-9df6-93151d5e8507/bin-2019/uautomizer/../../sv-benchmarks/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i [2018-11-28 13:03:04,401 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b895ffd-8390-4378-9df6-93151d5e8507/bin-2019/uautomizer/data/7460aea9a/2b606e0dcf334841b438338a3e78ca41/FLAG0626746b2 [2018-11-28 13:03:04,740 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:03:04,740 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3b895ffd-8390-4378-9df6-93151d5e8507/sv-benchmarks/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i [2018-11-28 13:03:04,744 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b895ffd-8390-4378-9df6-93151d5e8507/bin-2019/uautomizer/data/7460aea9a/2b606e0dcf334841b438338a3e78ca41/FLAG0626746b2 [2018-11-28 13:03:05,178 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3b895ffd-8390-4378-9df6-93151d5e8507/bin-2019/uautomizer/data/7460aea9a/2b606e0dcf334841b438338a3e78ca41 [2018-11-28 13:03:05,180 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:03:05,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:03:05,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:03:05,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:03:05,184 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:03:05,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd293b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05, skipping insertion in model container [2018-11-28 13:03:05,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:03:05,203 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:03:05,312 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:03:05,315 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:03:05,328 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:03:05,343 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:03:05,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05 WrapperNode [2018-11-28 13:03:05,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:03:05,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:03:05,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:03:05,344 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:03:05,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:03:05,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:03:05,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:03:05,377 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:03:05,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... [2018-11-28 13:03:05,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:03:05,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:03:05,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:03:05,436 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:03:05,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b895ffd-8390-4378-9df6-93151d5e8507/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:03:05,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:03:05,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:03:05,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:03:05,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:03:05,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:03:05,638 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:03:05,638 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-28 13:03:05,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:03:05 BoogieIcfgContainer [2018-11-28 13:03:05,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:03:05,639 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:03:05,639 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:03:05,642 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:03:05,643 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:03:05,643 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:03:05" (1/3) ... [2018-11-28 13:03:05,644 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b8bfde2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:03:05, skipping insertion in model container [2018-11-28 13:03:05,644 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:03:05,644 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:05" (2/3) ... [2018-11-28 13:03:05,644 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b8bfde2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:03:05, skipping insertion in model container [2018-11-28 13:03:05,645 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:03:05,645 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:03:05" (3/3) ... [2018-11-28 13:03:05,646 INFO L375 chiAutomizerObserver]: Analyzing ICFG sanfoundry_24_true-unreach-call_true-termination.i [2018-11-28 13:03:05,697 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:03:05,697 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:03:05,697 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:03:05,698 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:03:05,698 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:03:05,698 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:03:05,698 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:03:05,698 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:03:05,698 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:03:05,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-28 13:03:05,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-28 13:03:05,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:03:05,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:03:05,734 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:03:05,734 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:03:05,735 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:03:05,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-28 13:03:05,738 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-28 13:03:05,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:03:05,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:03:05,738 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:03:05,738 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:03:05,746 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(400000);havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 15#L15-3true [2018-11-28 13:03:05,746 INFO L796 eck$LassoCheckResult]: Loop: 15#L15-3true assume !!(main_~i~0 < main_~num~0);call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 3#L17true assume !(0 == (if main_#t~mem2 < 0 && 0 != main_#t~mem2 % 2 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2));havoc main_#t~mem2; 18#L15-2true main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 15#L15-3true [2018-11-28 13:03:05,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:05,751 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 13:03:05,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:05,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:05,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:05,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:05,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:05,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:05,821 INFO L82 PathProgramCache]: Analyzing trace with hash 40203, now seen corresponding path program 1 times [2018-11-28 13:03:05,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:05,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:05,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:05,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:05,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:05,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:05,849 INFO L82 PathProgramCache]: Analyzing trace with hash 28699145, now seen corresponding path program 1 times [2018-11-28 13:03:05,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:05,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:05,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:05,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:05,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:06,033 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:03:06,034 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:03:06,034 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:03:06,034 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:03:06,034 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:03:06,034 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:03:06,034 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:03:06,034 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:03:06,034 INFO L131 ssoRankerPreferences]: Filename of dumped script: sanfoundry_24_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-28 13:03:06,035 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:03:06,035 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:03:06,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:06,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:06,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:06,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:06,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:06,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:06,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:06,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:06,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:06,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:06,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:06,269 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:03:06,273 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:03:06,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:06,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:06,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:06,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:06,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:06,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:06,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:06,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:06,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:06,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:06,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:06,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:06,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:06,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:06,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:06,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:06,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:06,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:06,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:06,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:06,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:06,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:06,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:06,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:06,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:06,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:06,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:06,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:06,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:06,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:06,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:06,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:06,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:06,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:06,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:06,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:06,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:06,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:06,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:06,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:06,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:06,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:06,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:06,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:06,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:06,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:06,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:06,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:06,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:06,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:06,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:06,333 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:03:06,356 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 13:03:06,357 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 13:03:06,359 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:03:06,362 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:03:06,362 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:03:06,362 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~num~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~num~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 13:03:06,370 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 13:03:06,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:06,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:06,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:06,466 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:03:06,468 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2018-11-28 13:03:06,513 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 3 states. Result 43 states and 62 transitions. Complement of second has 8 states. [2018-11-28 13:03:06,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 13:03:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:03:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-28 13:03:06,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-28 13:03:06,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:06,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-28 13:03:06,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:06,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 13:03:06,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:06,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 62 transitions. [2018-11-28 13:03:06,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 13:03:06,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2018-11-28 13:03:06,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 13:03:06,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 13:03:06,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-11-28 13:03:06,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:03:06,527 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 13:03:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-11-28 13:03:06,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 13:03:06,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 13:03:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-28 13:03:06,544 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 13:03:06,545 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 13:03:06,545 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:03:06,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-28 13:03:06,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 13:03:06,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:03:06,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:03:06,545 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 13:03:06,545 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:03:06,546 INFO L794 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 117#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(400000);havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 118#L15-3 assume !(main_~i~0 < main_~num~0); 122#L15-4 main_~i~0 := 0; 114#L22-3 [2018-11-28 13:03:06,546 INFO L796 eck$LassoCheckResult]: Loop: 114#L22-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 115#L24 assume !(0 != (if main_#t~mem5 < 0 && 0 != main_#t~mem5 % 2 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2));havoc main_#t~mem5; 113#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 114#L22-3 [2018-11-28 13:03:06,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:06,546 INFO L82 PathProgramCache]: Analyzing trace with hash 925722, now seen corresponding path program 1 times [2018-11-28 13:03:06,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:06,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:06,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:06,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:06,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:06,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:06,555 INFO L82 PathProgramCache]: Analyzing trace with hash 69000, now seen corresponding path program 1 times [2018-11-28 13:03:06,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:06,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:06,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:06,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:06,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:06,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:06,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1808419535, now seen corresponding path program 1 times [2018-11-28 13:03:06,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:06,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:06,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:06,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:06,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:06,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:03:06,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:03:06,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:03:06,669 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-28 13:03:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:06,707 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-28 13:03:06,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:03:06,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-28 13:03:06,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:03:06,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 28 transitions. [2018-11-28 13:03:06,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 13:03:06,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 13:03:06,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-11-28 13:03:06,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:03:06,710 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-28 13:03:06,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-11-28 13:03:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2018-11-28 13:03:06,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 13:03:06,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-28 13:03:06,711 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 13:03:06,712 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 13:03:06,712 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:03:06,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-28 13:03:06,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:03:06,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:03:06,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:03:06,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:06,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:03:06,713 INFO L794 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(400000);havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 169#L15-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 161#L17 assume !(0 == (if main_#t~mem2 < 0 && 0 != main_#t~mem2 % 2 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2));havoc main_#t~mem2; 162#L15-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 174#L15-3 assume !(main_~i~0 < main_~num~0); 173#L15-4 main_~i~0 := 0; 166#L22-3 [2018-11-28 13:03:06,713 INFO L796 eck$LassoCheckResult]: Loop: 166#L22-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 167#L24 assume !(0 != (if main_#t~mem5 < 0 && 0 != main_#t~mem5 % 2 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2));havoc main_#t~mem5; 165#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 166#L22-3 [2018-11-28 13:03:06,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:06,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1810074848, now seen corresponding path program 1 times [2018-11-28 13:03:06,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:06,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:06,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:06,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:06,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:06,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:06,732 INFO L82 PathProgramCache]: Analyzing trace with hash 69000, now seen corresponding path program 2 times [2018-11-28 13:03:06,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:06,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:06,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:06,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:06,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:06,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:06,742 INFO L82 PathProgramCache]: Analyzing trace with hash 625434697, now seen corresponding path program 1 times [2018-11-28 13:03:06,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:06,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:06,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:06,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:06,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:06,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:03:06,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b895ffd-8390-4378-9df6-93151d5e8507/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:03:06,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:06,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:06,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-28 13:03:06,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2018-11-28 13:03:06,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:06,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:06,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:06,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:11 [2018-11-28 13:03:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:07,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:07,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 13:03:07,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:03:07,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:03:07,063 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-28 13:03:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:07,156 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-28 13:03:07,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:03:07,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2018-11-28 13:03:07,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 13:03:07,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 42 transitions. [2018-11-28 13:03:07,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 13:03:07,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 13:03:07,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-11-28 13:03:07,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:03:07,159 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-28 13:03:07,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-11-28 13:03:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-11-28 13:03:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 13:03:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-11-28 13:03:07,162 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-28 13:03:07,162 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-28 13:03:07,162 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:03:07,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-11-28 13:03:07,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:03:07,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:03:07,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:03:07,165 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:07,166 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:03:07,166 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 260#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(400000);havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 261#L15-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 252#L17 assume !(0 == (if main_#t~mem2 < 0 && 0 != main_#t~mem2 % 2 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2));havoc main_#t~mem2; 253#L15-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 266#L15-3 assume !(main_~i~0 < main_~num~0); 265#L15-4 main_~i~0 := 0; 257#L22-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 258#L24 assume 0 != (if main_#t~mem5 < 0 && 0 != main_#t~mem5 % 2 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4);printOdd_#in~i := main_#t~mem6;havoc printOdd_~i;printOdd_~i := printOdd_#in~i;__VERIFIER_assert_#in~cond := (if 0 != (if printOdd_~i < 0 && 0 != printOdd_~i % 2 then printOdd_~i % 2 - 2 else printOdd_~i % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 262#L3-4 [2018-11-28 13:03:07,166 INFO L796 eck$LassoCheckResult]: Loop: 262#L3-4 assume !(0 == __VERIFIER_assert_~cond); 255#L3-7 havoc main_#t~mem6; 256#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 259#L22-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 269#L24 assume 0 != (if main_#t~mem5 < 0 && 0 != main_#t~mem5 % 2 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4);printOdd_#in~i := main_#t~mem6;havoc printOdd_~i;printOdd_~i := printOdd_#in~i;__VERIFIER_assert_#in~cond := (if 0 != (if printOdd_~i < 0 && 0 != printOdd_~i % 2 then printOdd_~i % 2 - 2 else printOdd_~i % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 262#L3-4 [2018-11-28 13:03:07,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:07,166 INFO L82 PathProgramCache]: Analyzing trace with hash 20175299, now seen corresponding path program 1 times [2018-11-28 13:03:07,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:07,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:07,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:07,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:07,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:07,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:07,192 INFO L82 PathProgramCache]: Analyzing trace with hash 75485879, now seen corresponding path program 1 times [2018-11-28 13:03:07,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:07,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:07,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:07,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:07,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:07,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:07,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1641529909, now seen corresponding path program 1 times [2018-11-28 13:03:07,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:07,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:07,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:07,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:07,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:07,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:07,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:03:07,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b895ffd-8390-4378-9df6-93151d5e8507/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:03:07,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:07,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:07,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:07,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-28 13:03:07,525 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 42 [2018-11-28 13:03:07,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:03:07,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:03:07,526 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-11-28 13:03:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:07,614 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-28 13:03:07,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:03:07,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 69 transitions. [2018-11-28 13:03:07,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:03:07,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 47 states and 57 transitions. [2018-11-28 13:03:07,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-28 13:03:07,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-28 13:03:07,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2018-11-28 13:03:07,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:03:07,617 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-28 13:03:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2018-11-28 13:03:07,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2018-11-28 13:03:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 13:03:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-11-28 13:03:07,620 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-28 13:03:07,620 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-28 13:03:07,620 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 13:03:07,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2018-11-28 13:03:07,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:03:07,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:03:07,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:03:07,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:07,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:03:07,621 INFO L794 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 399#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(400000);havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 400#L15-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 404#L17 assume !(0 == (if main_#t~mem2 < 0 && 0 != main_#t~mem2 % 2 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2));havoc main_#t~mem2; 406#L15-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 407#L15-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 413#L17 assume !(0 == (if main_#t~mem2 < 0 && 0 != main_#t~mem2 % 2 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2));havoc main_#t~mem2; 411#L15-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 412#L15-3 assume !(main_~i~0 < main_~num~0); 403#L15-4 main_~i~0 := 0; 395#L22-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 396#L24 assume 0 != (if main_#t~mem5 < 0 && 0 != main_#t~mem5 % 2 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4);printOdd_#in~i := main_#t~mem6;havoc printOdd_~i;printOdd_~i := printOdd_#in~i;__VERIFIER_assert_#in~cond := (if 0 != (if printOdd_~i < 0 && 0 != printOdd_~i % 2 then printOdd_~i % 2 - 2 else printOdd_~i % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 398#L3-4 [2018-11-28 13:03:07,621 INFO L796 eck$LassoCheckResult]: Loop: 398#L3-4 assume !(0 == __VERIFIER_assert_~cond); 393#L3-7 havoc main_#t~mem6; 394#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 397#L22-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 410#L24 assume 0 != (if main_#t~mem5 < 0 && 0 != main_#t~mem5 % 2 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4);printOdd_#in~i := main_#t~mem6;havoc printOdd_~i;printOdd_~i := printOdd_#in~i;__VERIFIER_assert_#in~cond := (if 0 != (if printOdd_~i < 0 && 0 != printOdd_~i % 2 then printOdd_~i % 2 - 2 else printOdd_~i % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 398#L3-4 [2018-11-28 13:03:07,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:07,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1338079421, now seen corresponding path program 2 times [2018-11-28 13:03:07,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:07,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:07,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:07,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:07,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:07,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:07,654 INFO L82 PathProgramCache]: Analyzing trace with hash 75485879, now seen corresponding path program 2 times [2018-11-28 13:03:07,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:07,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:07,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:07,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:07,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:07,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:07,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1807249275, now seen corresponding path program 2 times [2018-11-28 13:03:07,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:07,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:07,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:07,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:07,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:07,863 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 42 [2018-11-28 13:03:08,034 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2018-11-28 13:03:08,332 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 55 [2018-11-28 13:03:08,333 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:03:08,333 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:03:08,333 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:03:08,333 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:03:08,333 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:03:08,333 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:03:08,333 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:03:08,333 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:03:08,333 INFO L131 ssoRankerPreferences]: Filename of dumped script: sanfoundry_24_true-unreach-call_true-termination.i_Iteration5_Lasso [2018-11-28 13:03:08,333 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:03:08,333 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:03:08,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:08,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:08,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:08,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:08,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:08,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:08,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:08,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:08,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:08,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:08,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:08,609 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:03:08,609 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:03:08,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:08,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:08,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:08,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:08,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:08,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:08,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:08,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:08,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:08,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:08,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:08,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:08,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:08,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:08,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:08,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:08,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:08,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:08,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:08,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:08,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:08,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:08,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:08,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:08,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:08,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:08,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:08,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:08,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:08,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:08,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:08,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:08,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:08,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:08,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:08,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:08,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:08,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:08,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:08,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:08,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:08,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:08,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:08,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:08,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:08,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:08,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:08,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:08,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:08,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:08,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:08,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:08,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:08,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:08,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:08,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:08,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:08,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:08,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:08,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:08,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:08,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:08,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:08,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:08,624 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:03:08,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:08,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:08,625 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:03:08,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:08,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:08,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:08,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:08,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:08,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:08,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:08,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:08,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:08,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:08,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:08,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:08,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:08,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:08,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:08,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:08,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:08,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:08,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:08,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:08,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:08,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:08,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:08,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:08,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:08,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:08,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:08,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:08,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:08,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:08,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:08,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:08,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:08,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:08,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:08,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:08,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:08,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:08,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:08,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:08,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:08,662 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:03:08,673 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 13:03:08,674 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 13:03:08,674 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:03:08,675 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:03:08,675 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:03:08,675 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~num~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~num~0 Supporting invariants [] [2018-11-28 13:03:08,686 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 13:03:08,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:08,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:08,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:08,721 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 13:03:08,722 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-28 13:03:08,734 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 39 states and 48 transitions. Complement of second has 6 states. [2018-11-28 13:03:08,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 13:03:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:03:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-28 13:03:08,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-28 13:03:08,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:08,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-28 13:03:08,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:08,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-28 13:03:08,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:08,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2018-11-28 13:03:08,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:03:08,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 17 states and 19 transitions. [2018-11-28 13:03:08,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 13:03:08,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 13:03:08,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2018-11-28 13:03:08,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:03:08,738 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 13:03:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2018-11-28 13:03:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-28 13:03:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 13:03:08,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-28 13:03:08,739 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 13:03:08,739 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 13:03:08,739 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 13:03:08,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-28 13:03:08,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:03:08,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:03:08,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:03:08,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:08,740 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:03:08,740 INFO L794 eck$LassoCheckResult]: Stem: 545#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 541#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(400000);havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 542#L15-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 548#L17 assume 0 == (if main_#t~mem2 < 0 && 0 != main_#t~mem2 % 2 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2);havoc main_#t~mem2;call main_#t~mem3 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4);printEven_#in~i := main_#t~mem3;havoc printEven_~i;printEven_~i := printEven_#in~i;__VERIFIER_assert_#in~cond := (if 0 == (if printEven_~i < 0 && 0 != printEven_~i % 2 then printEven_~i % 2 - 2 else printEven_~i % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 549#L3 assume !(0 == __VERIFIER_assert_~cond); 543#L3-3 havoc main_#t~mem3; 544#L15-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 550#L15-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 551#L17 assume !(0 == (if main_#t~mem2 < 0 && 0 != main_#t~mem2 % 2 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2));havoc main_#t~mem2; 555#L15-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 554#L15-3 assume !(main_~i~0 < main_~num~0); 546#L15-4 main_~i~0 := 0; 547#L22-3 [2018-11-28 13:03:08,740 INFO L796 eck$LassoCheckResult]: Loop: 547#L22-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 552#L24 assume !(0 != (if main_#t~mem5 < 0 && 0 != main_#t~mem5 % 2 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2));havoc main_#t~mem5; 553#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 547#L22-3 [2018-11-28 13:03:08,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:08,740 INFO L82 PathProgramCache]: Analyzing trace with hash 932632081, now seen corresponding path program 1 times [2018-11-28 13:03:08,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:08,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:08,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:08,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:08,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:08,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:08,754 INFO L82 PathProgramCache]: Analyzing trace with hash 69000, now seen corresponding path program 3 times [2018-11-28 13:03:08,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:08,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:08,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:08,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:08,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:08,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash -101073544, now seen corresponding path program 1 times [2018-11-28 13:03:08,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:08,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:08,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:08,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:08,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:08,953 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2018-11-28 13:03:09,060 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:03:09,060 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:03:09,060 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:03:09,061 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:03:09,061 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:03:09,061 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:03:09,061 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:03:09,061 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:03:09,061 INFO L131 ssoRankerPreferences]: Filename of dumped script: sanfoundry_24_true-unreach-call_true-termination.i_Iteration6_Lasso [2018-11-28 13:03:09,061 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:03:09,061 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:03:09,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:09,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:09,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:09,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:09,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:09,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:09,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:09,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:09,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:09,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:09,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:09,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:03:09,295 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:03:09,295 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:03:09,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:09,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:09,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:09,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:09,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:09,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:09,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:09,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:09,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:09,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:09,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:09,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:09,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:09,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:09,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:09,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:09,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:09,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:09,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:09,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:09,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:09,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:09,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:09,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:09,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:09,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:09,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:09,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:09,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:09,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:09,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:09,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:09,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:09,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:09,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:09,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:09,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:09,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:09,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:09,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:09,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:09,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:09,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:09,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:09,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:09,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:03:09,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:09,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:09,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:09,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:03:09,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:03:09,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:09,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:09,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:09,312 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:03:09,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:09,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:09,318 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:03:09,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:09,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:03:09,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:03:09,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:03:09,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:03:09,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:03:09,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:03:09,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:03:09,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:03:09,335 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:03:09,351 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 13:03:09,351 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 13:03:09,351 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:03:09,352 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:03:09,352 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:03:09,352 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~num~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~num~0 Supporting invariants [] [2018-11-28 13:03:09,385 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 13:03:09,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:09,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:09,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:09,429 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:03:09,430 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-28 13:03:09,437 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 20 states and 23 transitions. Complement of second has 4 states. [2018-11-28 13:03:09,438 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 [2018-11-28 13:03:09,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:03:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-11-28 13:03:09,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-28 13:03:09,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:09,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 13:03:09,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:09,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-28 13:03:09,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:03:09,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-28 13:03:09,440 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:03:09,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2018-11-28 13:03:09,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:03:09,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:03:09,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:03:09,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:03:09,441 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:03:09,441 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:03:09,441 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:03:09,441 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 13:03:09,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:03:09,447 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:03:09,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 13:03:09,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:03:09 BoogieIcfgContainer [2018-11-28 13:03:09,454 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:03:09,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:03:09,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:03:09,454 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:03:09,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:03:05" (3/4) ... [2018-11-28 13:03:09,461 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:03:09,461 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:03:09,462 INFO L168 Benchmark]: Toolchain (without parser) took 4281.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 952.6 MB in the beginning and 792.1 MB in the end (delta: 160.6 MB). Peak memory consumption was 368.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:09,463 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:03:09,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.73 ms. Allocated memory is still 1.0 GB. Free memory was 952.6 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:09,464 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.63 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:09,465 INFO L168 Benchmark]: Boogie Preprocessor took 58.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:09,465 INFO L168 Benchmark]: RCFGBuilder took 203.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:09,466 INFO L168 Benchmark]: BuchiAutomizer took 3814.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.1 GB in the beginning and 792.1 MB in the end (delta: 307.3 MB). Peak memory consumption was 393.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:09,466 INFO L168 Benchmark]: Witness Printer took 6.67 ms. Allocated memory is still 1.2 GB. Free memory is still 792.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:03:09,470 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 161.73 ms. Allocated memory is still 1.0 GB. Free memory was 952.6 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.63 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 203.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3814.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.1 GB in the beginning and 792.1 MB in the end (delta: 307.3 MB). Peak memory consumption was 393.8 MB. Max. memory is 11.5 GB. * Witness Printer took 6.67 ms. Allocated memory is still 1.2 GB. Free memory is still 792.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function num + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + num and consists of 4 locations. One deterministic module has affine ranking function -1 * i + num and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 3.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 39 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 67 SDtfs, 116 SDslu, 110 SDs, 0 SdLazy, 142 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax100 hnf100 lsp89 ukn68 mio100 lsp53 div214 bol100 ite100 ukn100 eq151 hnf56 smp92 dnf100 smp100 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...