./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_73b9f973-365a-40cf-b97e-1a335501f96a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_73b9f973-365a-40cf-b97e-1a335501f96a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_73b9f973-365a-40cf-b97e-1a335501f96a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_73b9f973-365a-40cf-b97e-1a335501f96a/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_73b9f973-365a-40cf-b97e-1a335501f96a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_73b9f973-365a-40cf-b97e-1a335501f96a/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-635dfa2 [2018-12-09 10:02:01,256 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:02:01,257 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:02:01,263 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:02:01,263 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:02:01,264 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:02:01,265 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:02:01,266 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:02:01,267 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:02:01,268 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:02:01,269 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:02:01,269 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:02:01,269 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:02:01,270 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:02:01,271 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:02:01,272 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:02:01,272 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:02:01,273 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:02:01,275 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:02:01,276 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:02:01,277 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:02:01,278 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:02:01,279 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:02:01,279 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:02:01,280 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:02:01,280 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:02:01,281 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:02:01,282 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:02:01,282 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:02:01,283 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:02:01,283 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:02:01,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:02:01,284 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:02:01,284 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:02:01,285 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:02:01,285 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:02:01,286 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_73b9f973-365a-40cf-b97e-1a335501f96a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 10:02:01,295 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:02:01,295 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:02:01,296 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 10:02:01,296 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 10:02:01,297 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 10:02:01,297 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 10:02:01,297 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 10:02:01,297 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 10:02:01,297 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 10:02:01,297 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 10:02:01,297 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 10:02:01,298 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:02:01,298 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:02:01,298 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 10:02:01,298 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:02:01,298 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:02:01,298 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:02:01,299 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 10:02:01,299 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 10:02:01,299 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 10:02:01,299 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:02:01,299 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:02:01,299 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 10:02:01,299 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 10:02:01,300 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 10:02:01,300 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:02:01,300 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:02:01,300 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 10:02:01,300 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:02:01,300 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 10:02:01,300 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 10:02:01,301 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 10:02:01,301 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_73b9f973-365a-40cf-b97e-1a335501f96a/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-12-09 10:02:01,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:02:01,333 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:02:01,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:02:01,336 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:02:01,336 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:02:01,337 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_73b9f973-365a-40cf-b97e-1a335501f96a/bin-2019/uautomizer/../../sv-benchmarks/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i [2018-12-09 10:02:01,372 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73b9f973-365a-40cf-b97e-1a335501f96a/bin-2019/uautomizer/data/9a3f58f42/f9a8c25458444dd0a3a08f02c1365c7f/FLAG9d8da2d33 [2018-12-09 10:02:01,665 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:02:01,665 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_73b9f973-365a-40cf-b97e-1a335501f96a/sv-benchmarks/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i [2018-12-09 10:02:01,669 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73b9f973-365a-40cf-b97e-1a335501f96a/bin-2019/uautomizer/data/9a3f58f42/f9a8c25458444dd0a3a08f02c1365c7f/FLAG9d8da2d33 [2018-12-09 10:02:01,677 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_73b9f973-365a-40cf-b97e-1a335501f96a/bin-2019/uautomizer/data/9a3f58f42/f9a8c25458444dd0a3a08f02c1365c7f [2018-12-09 10:02:01,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:02:01,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:02:01,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:02:01,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:02:01,682 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:02:01,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:02:01" (1/1) ... [2018-12-09 10:02:01,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342d1c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:02:01, skipping insertion in model container [2018-12-09 10:02:01,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:02:01" (1/1) ... [2018-12-09 10:02:01,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:02:01,698 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:02:01,782 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:02:01,784 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:02:01,795 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:02:01,806 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:02:01,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:02:01 WrapperNode [2018-12-09 10:02:01,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:02:01,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:02:01,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:02:01,807 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:02:01,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:02:01" (1/1) ... [2018-12-09 10:02:01,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:02:01" (1/1) ... [2018-12-09 10:02:01,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:02:01,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:02:01,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:02:01,857 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:02:01,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:02:01" (1/1) ... [2018-12-09 10:02:01,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:02:01" (1/1) ... [2018-12-09 10:02:01,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:02:01" (1/1) ... [2018-12-09 10:02:01,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:02:01" (1/1) ... [2018-12-09 10:02:01,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:02:01" (1/1) ... [2018-12-09 10:02:01,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:02:01" (1/1) ... [2018-12-09 10:02:01,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:02:01" (1/1) ... [2018-12-09 10:02:01,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:02:01,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:02:01,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:02:01,873 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:02:01,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:02:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73b9f973-365a-40cf-b97e-1a335501f96a/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-12-09 10:02:01,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 10:02:01,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:02:01,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:02:01,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 10:02:01,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 10:02:02,013 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:02:02,013 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-12-09 10:02:02,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:02:02 BoogieIcfgContainer [2018-12-09 10:02:02,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:02:02,014 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 10:02:02,014 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 10:02:02,016 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 10:02:02,017 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:02:02,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 10:02:01" (1/3) ... [2018-12-09 10:02:02,017 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e90d92d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:02:02, skipping insertion in model container [2018-12-09 10:02:02,017 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:02:02,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:02:01" (2/3) ... [2018-12-09 10:02:02,018 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e90d92d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:02:02, skipping insertion in model container [2018-12-09 10:02:02,018 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:02:02,018 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:02:02" (3/3) ... [2018-12-09 10:02:02,019 INFO L375 chiAutomizerObserver]: Analyzing ICFG sanfoundry_24_true-unreach-call_true-termination.i [2018-12-09 10:02:02,049 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 10:02:02,050 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 10:02:02,050 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 10:02:02,050 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 10:02:02,050 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:02:02,050 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:02:02,050 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 10:02:02,050 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:02:02,050 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 10:02:02,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-12-09 10:02:02,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-09 10:02:02,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:02:02,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:02:02,079 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 10:02:02,079 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 10:02:02,079 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 10:02:02,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-12-09 10:02:02,082 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-09 10:02:02,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:02:02,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:02:02,082 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 10:02:02,083 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 10:02:02,088 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-12-09 10:02:02,088 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-12-09 10:02:02,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:02,092 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-09 10:02:02,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:02,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:02,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:02:02,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:02,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:02,154 INFO L82 PathProgramCache]: Analyzing trace with hash 40203, now seen corresponding path program 1 times [2018-12-09 10:02:02,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:02,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:02,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:02:02,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:02,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:02,173 INFO L82 PathProgramCache]: Analyzing trace with hash 28699145, now seen corresponding path program 1 times [2018-12-09 10:02:02,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:02,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:02,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:02:02,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:02,312 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:02:02,313 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:02:02,313 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:02:02,313 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:02:02,313 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:02:02,313 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:02:02,313 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:02:02,313 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:02:02,313 INFO L131 ssoRankerPreferences]: Filename of dumped script: sanfoundry_24_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-09 10:02:02,314 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:02:02,314 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:02:02,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:02,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:02,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:02,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:02,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-12-09 10:02:02,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-12-09 10:02:02,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:02,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:02,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:02,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:02,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:02,491 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:02:02,494 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:02:02,495 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-12-09 10:02:02,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:02,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:02:02,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:02,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:02,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:02,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:02:02,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:02:02,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:02,500 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-12-09 10:02:02,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:02,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:02:02,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:02,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:02,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:02,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:02:02,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:02:02,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:02,502 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-12-09 10:02:02,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:02,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:02:02,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:02,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:02,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:02,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:02:02,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:02:02,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:02,504 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-12-09 10:02:02,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:02,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:02:02,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:02,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:02,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:02,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:02:02,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:02:02,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:02,506 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-12-09 10:02:02,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:02,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:02,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:02,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:02,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:02:02,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:02:02,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:02,511 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-12-09 10:02:02,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:02,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:02,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:02,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:02,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:02:02,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:02:02,531 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:02:02,544 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 10:02:02,544 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 10:02:02,545 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:02:02,546 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:02:02,546 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:02:02,547 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-12-09 10:02:02,549 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-09 10:02:02,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:02:02,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:02:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:02:02,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:02:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:02:02,597 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-12-09 10:02:02,598 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2018-12-09 10:02:02,629 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-12-09 10:02:02,629 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-12-09 10:02:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 10:02:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-12-09 10:02:02,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 2 letters. Loop has 3 letters. [2018-12-09 10:02:02,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:02:02,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-09 10:02:02,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:02:02,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-09 10:02:02,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:02:02,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 62 transitions. [2018-12-09 10:02:02,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 10:02:02,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2018-12-09 10:02:02,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-09 10:02:02,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 10:02:02,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-12-09 10:02:02,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:02:02,640 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-09 10:02:02,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-12-09 10:02:02,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-09 10:02:02,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-09 10:02:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-12-09 10:02:02,656 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-09 10:02:02,656 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-09 10:02:02,656 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 10:02:02,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-12-09 10:02:02,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 10:02:02,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:02:02,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:02:02,657 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 10:02:02,657 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 10:02:02,658 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-12-09 10:02:02,658 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-12-09 10:02:02,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:02,658 INFO L82 PathProgramCache]: Analyzing trace with hash 925722, now seen corresponding path program 1 times [2018-12-09 10:02:02,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:02,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:02,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:02:02,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:02,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:02,665 INFO L82 PathProgramCache]: Analyzing trace with hash 69000, now seen corresponding path program 1 times [2018-12-09 10:02:02,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:02,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:02,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:02:02,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:02,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:02,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1808419535, now seen corresponding path program 1 times [2018-12-09 10:02:02,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:02,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:02,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:02:02,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:02:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:02:02,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:02:02,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:02:02,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:02:02,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:02:02,752 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-09 10:02:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:02:02,780 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-12-09 10:02:02,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:02:02,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-12-09 10:02:02,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:02:02,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 28 transitions. [2018-12-09 10:02:02,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 10:02:02,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 10:02:02,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-12-09 10:02:02,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:02:02,783 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-09 10:02:02,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-12-09 10:02:02,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2018-12-09 10:02:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-09 10:02:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-12-09 10:02:02,784 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-09 10:02:02,784 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-09 10:02:02,784 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 10:02:02,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-12-09 10:02:02,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:02:02,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:02:02,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:02:02,785 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:02:02,785 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 10:02:02,785 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-12-09 10:02:02,785 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-12-09 10:02:02,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:02,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1810074848, now seen corresponding path program 1 times [2018-12-09 10:02:02,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:02,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:02,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:02:02,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:02,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:02,798 INFO L82 PathProgramCache]: Analyzing trace with hash 69000, now seen corresponding path program 2 times [2018-12-09 10:02:02,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:02,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:02,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:02:02,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:02,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:02,805 INFO L82 PathProgramCache]: Analyzing trace with hash 625434697, now seen corresponding path program 1 times [2018-12-09 10:02:02,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:02,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:02,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:02:02,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:02:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:02:02,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:02:02,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73b9f973-365a-40cf-b97e-1a335501f96a/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-12-09 10:02:02,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:02:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:02:02,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:02:02,999 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-12-09 10:02:03,001 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-12-09 10:02:03,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:02:03,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:02:03,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:02:03,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:11 [2018-12-09 10:02:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:02:03,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:02:03,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-09 10:02:03,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:02:03,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:02:03,060 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-12-09 10:02:03,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:02:03,123 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-12-09 10:02:03,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:02:03,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2018-12-09 10:02:03,125 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:02:03,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 42 transitions. [2018-12-09 10:02:03,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-09 10:02:03,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-09 10:02:03,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-12-09 10:02:03,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:02:03,126 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-09 10:02:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-12-09 10:02:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-12-09 10:02:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-09 10:02:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-12-09 10:02:03,127 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-09 10:02:03,127 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-12-09 10:02:03,127 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 10:02:03,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-12-09 10:02:03,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:02:03,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:02:03,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:02:03,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:02:03,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:02:03,128 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-12-09 10:02:03,128 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-12-09 10:02:03,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:03,129 INFO L82 PathProgramCache]: Analyzing trace with hash 20175299, now seen corresponding path program 1 times [2018-12-09 10:02:03,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:03,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:03,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:03,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:02:03,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:03,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:03,153 INFO L82 PathProgramCache]: Analyzing trace with hash 75485879, now seen corresponding path program 1 times [2018-12-09 10:02:03,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:03,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:03,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:03,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:02:03,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:03,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:03,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1641529909, now seen corresponding path program 1 times [2018-12-09 10:02:03,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:03,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:03,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:03,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:02:03,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:02:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:02:03,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:02:03,197 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73b9f973-365a-40cf-b97e-1a335501f96a/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-12-09 10:02:03,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:02:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:02:03,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:02:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:02:03,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:02:03,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-09 10:02:03,429 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 42 [2018-12-09 10:02:03,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 10:02:03,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:02:03,430 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-12-09 10:02:03,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:02:03,484 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-12-09 10:02:03,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:02:03,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 69 transitions. [2018-12-09 10:02:03,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:02:03,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 47 states and 57 transitions. [2018-12-09 10:02:03,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-09 10:02:03,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-09 10:02:03,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2018-12-09 10:02:03,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:02:03,486 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-12-09 10:02:03,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2018-12-09 10:02:03,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2018-12-09 10:02:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 10:02:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-12-09 10:02:03,488 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-12-09 10:02:03,488 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-12-09 10:02:03,488 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 10:02:03,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2018-12-09 10:02:03,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:02:03,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:02:03,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:02:03,489 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-09 10:02:03,489 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:02:03,489 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-12-09 10:02:03,489 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-12-09 10:02:03,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:03,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1338079421, now seen corresponding path program 2 times [2018-12-09 10:02:03,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:03,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:03,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:03,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:02:03,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:03,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:03,515 INFO L82 PathProgramCache]: Analyzing trace with hash 75485879, now seen corresponding path program 2 times [2018-12-09 10:02:03,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:03,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:03,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:03,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:02:03,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:03,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:03,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1807249275, now seen corresponding path program 2 times [2018-12-09 10:02:03,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:03,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:03,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:03,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:02:03,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:03,675 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 42 [2018-12-09 10:02:03,802 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2018-12-09 10:02:04,031 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 55 [2018-12-09 10:02:04,032 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:02:04,032 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:02:04,032 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:02:04,032 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:02:04,033 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:02:04,033 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:02:04,033 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:02:04,033 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:02:04,033 INFO L131 ssoRankerPreferences]: Filename of dumped script: sanfoundry_24_true-unreach-call_true-termination.i_Iteration5_Lasso [2018-12-09 10:02:04,033 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:02:04,033 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:02:04,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,284 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:02:04,284 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:02:04,285 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-12-09 10:02:04,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:02:04,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:02:04,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:02:04,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,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-12-09 10:02:04,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:02:04,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:02:04,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:02:04,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,289 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-12-09 10:02:04,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:02:04,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:02:04,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:02:04,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,291 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-12-09 10:02:04,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:02:04,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:02:04,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:02:04,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,292 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-12-09 10:02:04,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:02:04,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:02:04,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:02:04,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,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-12-09 10:02:04,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:02:04,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:02:04,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,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-12-09 10:02:04,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:02:04,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:02:04,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:02:04,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,298 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-12-09 10:02:04,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,298 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:02:04,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,299 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:02:04,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:02:04,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,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-12-09 10:02:04,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:02:04,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:02:04,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,311 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-12-09 10:02:04,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:02:04,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:02:04,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,314 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-12-09 10:02:04,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:02:04,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:02:04,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,317 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-12-09 10:02:04,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:02:04,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:02:04,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,320 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-12-09 10:02:04,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:02:04,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:02:04,330 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:02:04,343 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-09 10:02:04,343 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-09 10:02:04,343 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:02:04,344 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:02:04,344 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:02:04,344 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-12-09 10:02:04,347 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-12-09 10:02:04,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:02:04,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:02:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:02:04,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:02:04,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:02:04,394 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-12-09 10:02:04,394 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-09 10:02:04,408 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-12-09 10:02:04,408 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-12-09 10:02:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 10:02:04,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-12-09 10:02:04,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 12 letters. Loop has 5 letters. [2018-12-09 10:02:04,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:02:04,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 17 letters. Loop has 5 letters. [2018-12-09 10:02:04,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:02:04,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 12 letters. Loop has 10 letters. [2018-12-09 10:02:04,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:02:04,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2018-12-09 10:02:04,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 10:02:04,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 17 states and 19 transitions. [2018-12-09 10:02:04,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-09 10:02:04,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-09 10:02:04,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2018-12-09 10:02:04,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:02:04,410 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-09 10:02:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2018-12-09 10:02:04,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-09 10:02:04,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 10:02:04,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-09 10:02:04,411 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-09 10:02:04,411 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-09 10:02:04,411 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 10:02:04,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-12-09 10:02:04,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 10:02:04,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:02:04,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:02:04,412 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:02:04,412 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 10:02:04,412 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-12-09 10:02:04,412 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-12-09 10:02:04,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:04,413 INFO L82 PathProgramCache]: Analyzing trace with hash 932632081, now seen corresponding path program 1 times [2018-12-09 10:02:04,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:04,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:04,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:04,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:02:04,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:04,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:04,425 INFO L82 PathProgramCache]: Analyzing trace with hash 69000, now seen corresponding path program 3 times [2018-12-09 10:02:04,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:04,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:04,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:04,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:02:04,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:04,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:04,430 INFO L82 PathProgramCache]: Analyzing trace with hash -101073544, now seen corresponding path program 1 times [2018-12-09 10:02:04,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:02:04,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:02:04,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:04,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:02:04,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:02:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:02:04,698 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2018-12-09 10:02:04,699 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:02:04,699 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:02:04,699 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:02:04,699 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:02:04,699 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:02:04,699 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:02:04,699 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:02:04,699 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:02:04,699 INFO L131 ssoRankerPreferences]: Filename of dumped script: sanfoundry_24_true-unreach-call_true-termination.i_Iteration6_Lasso [2018-12-09 10:02:04,699 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:02:04,699 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:02:04,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:02:04,873 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:02:04,873 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:02:04,873 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-12-09 10:02:04,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:02:04,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:02:04,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,877 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-12-09 10:02:04,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:02:04,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:02:04,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:02:04,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,879 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-12-09 10:02:04,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:02:04,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:02:04,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:02:04,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,881 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-12-09 10:02:04,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:02:04,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:02:04,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,884 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-12-09 10:02:04,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:02:04,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:02:04,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:02:04,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,885 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-12-09 10:02:04,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:02:04,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:02:04,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:02:04,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,887 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-12-09 10:02:04,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,888 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:02:04,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,888 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:02:04,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:02:04,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:02:04,890 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-12-09 10:02:04,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:02:04,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:02:04,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:02:04,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:02:04,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:02:04,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:02:04,899 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:02:04,911 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 10:02:04,912 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-09 10:02:04,912 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:02:04,912 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:02:04,912 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:02:04,913 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-12-09 10:02:04,915 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-12-09 10:02:04,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:02:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:02:04,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:02:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:02:04,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:02:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:02:04,948 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-12-09 10:02:04,948 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-09 10:02:04,953 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-12-09 10:02:04,953 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-12-09 10:02:04,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 10:02:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-12-09 10:02:04,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2018-12-09 10:02:04,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:02:04,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-09 10:02:04,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:02:04,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 12 letters. Loop has 6 letters. [2018-12-09 10:02:04,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:02:04,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-12-09 10:02:04,955 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 10:02:04,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2018-12-09 10:02:04,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 10:02:04,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 10:02:04,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 10:02:04,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:02:04,956 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:02:04,956 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:02:04,956 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:02:04,956 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 10:02:04,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 10:02:04,956 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 10:02:04,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 10:02:04,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 10:02:04 BoogieIcfgContainer [2018-12-09 10:02:04,962 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 10:02:04,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:02:04,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:02:04,962 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:02:04,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:02:02" (3/4) ... [2018-12-09 10:02:04,965 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 10:02:04,966 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:02:04,966 INFO L168 Benchmark]: Toolchain (without parser) took 3287.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 960.3 MB in the beginning and 934.7 MB in the end (delta: 25.6 MB). Peak memory consumption was 168.7 MB. Max. memory is 11.5 GB. [2018-12-09 10:02:04,967 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:02:04,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 126.79 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 10:02:04,968 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -139.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-09 10:02:04,968 INFO L168 Benchmark]: Boogie Preprocessor took 14.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:02:04,969 INFO L168 Benchmark]: RCFGBuilder took 141.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-09 10:02:04,969 INFO L168 Benchmark]: BuchiAutomizer took 2947.68 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 44.0 MB). Free memory was 1.1 GB in the beginning and 934.7 MB in the end (delta: 140.0 MB). Peak memory consumption was 184.1 MB. Max. memory is 11.5 GB. [2018-12-09 10:02:04,970 INFO L168 Benchmark]: Witness Printer took 3.56 ms. Allocated memory is still 1.2 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:02:04,972 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 126.79 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 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 50.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -139.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 141.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2947.68 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 44.0 MB). Free memory was 1.1 GB in the beginning and 934.7 MB in the end (delta: 140.0 MB). Peak memory consumption was 184.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.56 ms. Allocated memory is still 1.2 GB. Free memory is still 934.7 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 2.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. 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...