./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sep05_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sep05_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/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 d0de1e24b39a951a670bac9cdad830e10aacf376 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:36:52,813 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:36:52,814 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:36:52,820 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:36:52,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:36:52,821 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:36:52,822 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:36:52,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:36:52,824 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:36:52,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:36:52,825 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:36:52,825 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:36:52,826 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:36:52,826 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:36:52,827 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:36:52,827 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:36:52,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:36:52,829 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:36:52,830 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:36:52,831 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:36:52,832 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:36:52,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:36:52,835 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:36:52,835 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:36:52,835 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:36:52,836 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:36:52,836 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:36:52,837 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:36:52,837 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:36:52,838 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:36:52,838 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:36:52,839 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:36:52,839 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:36:52,839 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:36:52,840 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:36:52,840 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:36:52,840 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 15:36:52,851 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:36:52,851 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:36:52,852 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:36:52,852 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:36:52,853 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:36:52,853 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:36:52,853 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:36:52,853 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:36:52,853 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:36:52,853 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:36:52,853 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:36:52,853 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:36:52,854 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:36:52,854 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:36:52,854 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:36:52,854 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:36:52,854 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:36:52,854 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:36:52,854 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:36:52,854 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:36:52,855 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:36:52,855 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:36:52,855 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:36:52,855 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:36:52,855 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:36:52,855 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:36:52,855 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:36:52,855 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:36:52,856 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:36:52,856 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:36:52,856 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:36:52,856 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:36:52,857 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_fb149f76-8b0b-4097-ba09-ec2124fa20af/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 -> d0de1e24b39a951a670bac9cdad830e10aacf376 [2018-11-23 15:36:52,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:36:52,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:36:52,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:36:52,889 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:36:52,889 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:36:52,890 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/sep05_true-unreach-call_true-termination.i [2018-11-23 15:36:52,926 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/data/344f05283/a1d76054f4cc4fabbd85d54bb70fd492/FLAG91ae9efa0 [2018-11-23 15:36:53,264 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:36:53,265 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/sv-benchmarks/c/reducercommutativity/sep05_true-unreach-call_true-termination.i [2018-11-23 15:36:53,269 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/data/344f05283/a1d76054f4cc4fabbd85d54bb70fd492/FLAG91ae9efa0 [2018-11-23 15:36:53,690 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/data/344f05283/a1d76054f4cc4fabbd85d54bb70fd492 [2018-11-23 15:36:53,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:36:53,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:36:53,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:36:53,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:36:53,697 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:36:53,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:36:53" (1/1) ... [2018-11-23 15:36:53,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a31ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:53, skipping insertion in model container [2018-11-23 15:36:53,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:36:53" (1/1) ... [2018-11-23 15:36:53,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:36:53,717 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:36:53,827 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:36:53,832 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:36:53,846 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:36:53,855 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:36:53,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:53 WrapperNode [2018-11-23 15:36:53,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:36:53,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:36:53,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:36:53,856 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:36:53,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:53" (1/1) ... [2018-11-23 15:36:53,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:53" (1/1) ... [2018-11-23 15:36:53,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:36:53,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:36:53,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:36:53,881 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:36:53,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:53" (1/1) ... [2018-11-23 15:36:53,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:53" (1/1) ... [2018-11-23 15:36:53,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:53" (1/1) ... [2018-11-23 15:36:53,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:53" (1/1) ... [2018-11-23 15:36:53,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:53" (1/1) ... [2018-11-23 15:36:53,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:53" (1/1) ... [2018-11-23 15:36:53,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:53" (1/1) ... [2018-11-23 15:36:53,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:36:53,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:36:53,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:36:53,938 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:36:53,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:36:53,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:36:53,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:36:53,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:36:53,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:36:53,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:36:53,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:36:54,164 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:36:54,165 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-11-23 15:36:54,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:54 BoogieIcfgContainer [2018-11-23 15:36:54,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:36:54,166 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:36:54,166 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:36:54,169 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:36:54,169 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:36:54,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:36:53" (1/3) ... [2018-11-23 15:36:54,170 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68bc42ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:36:54, skipping insertion in model container [2018-11-23 15:36:54,171 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:36:54,171 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:53" (2/3) ... [2018-11-23 15:36:54,171 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68bc42ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:36:54, skipping insertion in model container [2018-11-23 15:36:54,171 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:36:54,171 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:54" (3/3) ... [2018-11-23 15:36:54,173 INFO L375 chiAutomizerObserver]: Analyzing ICFG sep05_true-unreach-call_true-termination.i [2018-11-23 15:36:54,211 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:36:54,212 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:36:54,212 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:36:54,212 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:36:54,212 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:36:54,212 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:36:54,212 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:36:54,212 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:36:54,212 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:36:54,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-23 15:36:54,237 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-11-23 15:36:54,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:36:54,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:36:54,241 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 15:36:54,241 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:36:54,241 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:36:54,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-23 15:36:54,243 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-11-23 15:36:54,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:36:54,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:36:54,244 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 15:36:54,244 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:36:54,248 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 28#L26-3true [2018-11-23 15:36:54,249 INFO L796 eck$LassoCheckResult]: Loop: 28#L26-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 29#L26-2true main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 28#L26-3true [2018-11-23 15:36:54,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:54,253 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 15:36:54,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:54,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:54,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:54,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:54,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:54,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:54,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-23 15:36:54,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:54,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:54,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:54,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:54,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:54,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:54,337 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-23 15:36:54,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:54,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:54,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:54,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:54,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:54,482 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:36:54,483 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:36:54,483 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:36:54,483 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:36:54,483 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:36:54,483 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:36:54,484 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:36:54,484 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:36:54,484 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep05_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-23 15:36:54,484 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:36:54,484 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:36:54,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:54,733 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:36:54,737 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:36:54,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:36:54,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:36:54,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:36:54,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:36:54,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:36:54,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:36:54,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:36:54,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:36:54,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:36:54,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:36:54,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:36:54,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:36:54,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:36:54,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:36:54,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:36:54,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:36:54,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:36:54,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:36:54,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:36:54,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:36:54,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:36:54,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:36:54,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:36:54,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:36:54,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:36:54,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:36:54,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:36:54,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:36:54,756 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:36:54,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:36:54,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:36:54,758 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:36:54,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:36:54,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:36:54,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:36:54,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:36:54,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:36:54,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:36:54,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:36:54,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:36:54,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:36:54,800 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:36:54,836 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-11-23 15:36:54,836 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 15:36:54,838 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:36:54,840 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:36:54,840 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:36:54,841 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_main_~i~1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-23 15:36:54,844 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 15:36:54,853 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:36:54,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:54,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:54,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:54,930 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:36:54,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2018-11-23 15:36:54,999 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 3 states. Result 75 states and 110 transitions. Complement of second has 8 states. [2018-11-23 15:36:55,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:36:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:36:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2018-11-23 15:36:55,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-23 15:36:55,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:36:55,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 15:36:55,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:36:55,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 15:36:55,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:36:55,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 110 transitions. [2018-11-23 15:36:55,006 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 15:36:55,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 22 states and 30 transitions. [2018-11-23 15:36:55,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 15:36:55,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 15:36:55,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2018-11-23 15:36:55,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:36:55,012 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-23 15:36:55,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2018-11-23 15:36:55,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 15:36:55,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 15:36:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2018-11-23 15:36:55,029 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-23 15:36:55,029 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-23 15:36:55,029 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:36:55,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2018-11-23 15:36:55,029 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 15:36:55,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:36:55,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:36:55,030 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:36:55,030 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:36:55,030 INFO L794 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 160#L26-3 assume !(main_~i~1 < 5); 164#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 150#L7-3 [2018-11-23 15:36:55,030 INFO L796 eck$LassoCheckResult]: Loop: 150#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 156#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 149#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 150#L7-3 [2018-11-23 15:36:55,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:55,031 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-11-23 15:36:55,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:55,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:55,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:55,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:55,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:36:55,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:36:55,063 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:36:55,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:55,063 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2018-11-23 15:36:55,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:55,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:55,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:55,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:55,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:36:55,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:36:55,140 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 15:36:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:55,149 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2018-11-23 15:36:55,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:36:55,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-23 15:36:55,151 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 15:36:55,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2018-11-23 15:36:55,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 15:36:55,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 15:36:55,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2018-11-23 15:36:55,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:36:55,152 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-23 15:36:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2018-11-23 15:36:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-23 15:36:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 15:36:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2018-11-23 15:36:55,154 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-11-23 15:36:55,154 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-11-23 15:36:55,154 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:36:55,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2018-11-23 15:36:55,155 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 15:36:55,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:36:55,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:36:55,155 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 15:36:55,156 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:36:55,156 INFO L794 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 209#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 210#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 216#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 217#L26-3 assume !(main_~i~1 < 5); 215#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 202#L7-3 [2018-11-23 15:36:55,156 INFO L796 eck$LassoCheckResult]: Loop: 202#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 207#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 201#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 202#L7-3 [2018-11-23 15:36:55,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:55,156 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-11-23 15:36:55,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:55,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:55,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:55,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:55,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:36:55,175 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:36:55,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:55,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:55,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:36:55,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 15:36:55,210 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:36:55,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:55,210 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2018-11-23 15:36:55,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:55,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:55,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:55,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:55,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:36:55,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:36:55,298 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-23 15:36:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:55,311 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2018-11-23 15:36:55,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:36:55,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2018-11-23 15:36:55,312 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 15:36:55,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2018-11-23 15:36:55,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 15:36:55,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 15:36:55,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2018-11-23 15:36:55,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:36:55,313 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-23 15:36:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2018-11-23 15:36:55,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 15:36:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 15:36:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2018-11-23 15:36:55,315 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-11-23 15:36:55,315 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-11-23 15:36:55,315 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:36:55,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2018-11-23 15:36:55,315 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 15:36:55,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:36:55,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:36:55,316 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-11-23 15:36:55,316 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:36:55,316 INFO L794 eck$LassoCheckResult]: Stem: 284#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 280#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 281#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 286#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 287#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 288#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 291#L26-3 assume !(main_~i~1 < 5); 285#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 271#L7-3 [2018-11-23 15:36:55,316 INFO L796 eck$LassoCheckResult]: Loop: 271#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 277#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 270#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 271#L7-3 [2018-11-23 15:36:55,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:55,317 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-11-23 15:36:55,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:55,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:55,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:55,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:55,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:36:55,353 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:36:55,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:36:55,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:36:55,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:36:55,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:55,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:36:55,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 15:36:55,419 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:36:55,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:55,419 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2018-11-23 15:36:55,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:55,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:55,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:55,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:55,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:36:55,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:36:55,475 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-23 15:36:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:55,492 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-11-23 15:36:55,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:36:55,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-11-23 15:36:55,494 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 15:36:55,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2018-11-23 15:36:55,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 15:36:55,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 15:36:55,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2018-11-23 15:36:55,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:36:55,496 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-23 15:36:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2018-11-23 15:36:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 15:36:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 15:36:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-11-23 15:36:55,498 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-23 15:36:55,498 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-23 15:36:55,498 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 15:36:55,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-11-23 15:36:55,498 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 15:36:55,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:36:55,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:36:55,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-11-23 15:36:55,499 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:36:55,499 INFO L794 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 360#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 367#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 368#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 369#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 374#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 373#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 372#L26-3 assume !(main_~i~1 < 5); 366#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 352#L7-3 [2018-11-23 15:36:55,499 INFO L796 eck$LassoCheckResult]: Loop: 352#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 358#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 351#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 352#L7-3 [2018-11-23 15:36:55,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:55,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-11-23 15:36:55,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:55,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:55,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:55,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:55,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:36:55,541 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:36:55,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:36:55,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 15:36:55,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:36:55,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:55,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:36:55,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 15:36:55,578 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:36:55,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:55,578 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2018-11-23 15:36:55,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:55,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:55,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:55,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:55,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:36:55,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:36:55,642 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-23 15:36:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:55,660 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-11-23 15:36:55,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:36:55,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2018-11-23 15:36:55,662 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 15:36:55,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 36 transitions. [2018-11-23 15:36:55,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 15:36:55,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 15:36:55,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2018-11-23 15:36:55,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:36:55,663 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-23 15:36:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2018-11-23 15:36:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 15:36:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 15:36:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-11-23 15:36:55,665 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-23 15:36:55,665 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-23 15:36:55,665 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 15:36:55,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2018-11-23 15:36:55,666 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 15:36:55,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:36:55,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:36:55,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-11-23 15:36:55,667 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:36:55,667 INFO L794 eck$LassoCheckResult]: Stem: 455#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 451#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 452#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 459#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 460#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 461#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 462#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 468#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 467#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 466#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 465#L26-3 assume !(main_~i~1 < 5); 458#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 444#L7-3 [2018-11-23 15:36:55,667 INFO L796 eck$LassoCheckResult]: Loop: 444#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 450#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 443#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 444#L7-3 [2018-11-23 15:36:55,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:55,667 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-11-23 15:36:55,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:55,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:55,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:55,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:55,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:36:55,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:36:55,726 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 15:36:55,748 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 15:36:55,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:36:55,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:55,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:36:55,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 15:36:55,795 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:36:55,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:55,796 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 5 times [2018-11-23 15:36:55,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:55,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:55,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:55,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:55,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:36:55,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:36:55,839 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-23 15:36:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:55,852 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 15:36:55,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:36:55,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2018-11-23 15:36:55,853 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 15:36:55,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 15:36:55,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 15:36:55,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 15:36:55,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2018-11-23 15:36:55,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:36:55,854 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 15:36:55,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2018-11-23 15:36:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 15:36:55,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 15:36:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 15:36:55,855 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 15:36:55,855 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 15:36:55,855 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 15:36:55,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2018-11-23 15:36:55,856 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 15:36:55,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:36:55,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:36:55,856 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-11-23 15:36:55,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:36:55,857 INFO L794 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 553#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 554#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 561#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 562#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 563#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 572#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 571#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 570#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 569#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 568#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 567#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 566#L26-3 assume !(main_~i~1 < 5); 560#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 546#L7-3 [2018-11-23 15:36:55,857 INFO L796 eck$LassoCheckResult]: Loop: 546#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 552#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 545#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 546#L7-3 [2018-11-23 15:36:55,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:55,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-11-23 15:36:55,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:55,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:55,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:55,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:55,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:55,874 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 6 times [2018-11-23 15:36:55,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:55,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:55,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:55,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:55,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:55,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2018-11-23 15:36:55,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:55,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:55,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:55,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:56,275 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2018-11-23 15:36:56,327 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:36:56,327 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:36:56,327 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:36:56,327 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:36:56,327 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:36:56,327 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:36:56,327 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:36:56,327 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:36:56,327 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep05_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-23 15:36:56,327 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:36:56,327 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:36:56,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,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-11-23 15:36:56,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,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-11-23 15:36:56,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,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-11-23 15:36:56,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,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-11-23 15:36:56,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:36:56,568 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:36:56,568 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:36:56,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:36:56,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:36:56,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:36:56,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:36:56,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:36:56,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:36:56,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:36:56,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:36:56,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:36:56,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:36:56,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:36:56,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:36:56,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:36:56,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:36:56,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:36:56,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:36:56,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:36:56,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:36:56,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:36:56,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:36:56,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:36:56,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:36:56,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:36:56,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:36:56,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:36:56,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:36:56,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:36:56,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:36:56,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:36:56,579 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:36:56,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:36:56,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:36:56,581 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:36:56,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:36:56,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:36:56,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:36:56,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:36:56,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:36:56,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:36:56,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:36:56,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:36:56,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:36:56,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:36:56,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:36:56,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:36:56,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:36:56,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:36:56,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:36:56,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:36:56,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:36:56,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:36:56,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:36:56,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:36:56,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:36:56,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:36:56,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:36:56,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:36:56,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:36:56,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:36:56,606 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:36:56,615 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 15:36:56,615 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 15:36:56,616 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:36:56,617 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:36:56,617 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:36:56,617 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sep_~i~0) = -2*ULTIMATE.start_sep_~i~0 + 9 Supporting invariants [] [2018-11-23 15:36:56,634 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 15:36:56,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:56,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:56,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:56,669 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:36:56,669 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-23 15:36:56,678 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 46 transitions. Complement of second has 7 states. [2018-11-23 15:36:56,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:36:56,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:36:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-23 15:36:56,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 15:36:56,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:36:56,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-23 15:36:56,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:36:56,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-23 15:36:56,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:36:56,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2018-11-23 15:36:56,681 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 15:36:56,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 31 states and 39 transitions. [2018-11-23 15:36:56,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 15:36:56,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-23 15:36:56,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2018-11-23 15:36:56,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:36:56,682 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-23 15:36:56,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2018-11-23 15:36:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 15:36:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 15:36:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-23 15:36:56,684 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-23 15:36:56,684 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-23 15:36:56,684 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 15:36:56,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2018-11-23 15:36:56,684 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 15:36:56,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:36:56,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:36:56,685 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:36:56,685 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:36:56,685 INFO L794 eck$LassoCheckResult]: Stem: 709#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 705#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 706#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 714#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 715#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 716#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 725#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 724#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 723#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 722#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 721#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 720#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 719#L26-3 assume !(main_~i~1 < 5); 712#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 713#L7-3 assume !(sep_~i~0 < 5); 717#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 718#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 707#L7-8 [2018-11-23 15:36:56,685 INFO L796 eck$LassoCheckResult]: Loop: 707#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 700#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 701#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 707#L7-8 [2018-11-23 15:36:56,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:56,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581187, now seen corresponding path program 1 times [2018-11-23 15:36:56,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:56,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:56,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:56,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:56,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:56,712 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 15:36:56,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:36:56,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:36:56,713 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:36:56,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:56,713 INFO L82 PathProgramCache]: Analyzing trace with hash 74576, now seen corresponding path program 1 times [2018-11-23 15:36:56,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:56,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:56,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:56,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:56,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:56,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:36:56,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:36:56,764 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 15:36:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:56,781 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2018-11-23 15:36:56,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:36:56,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2018-11-23 15:36:56,782 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 15:36:56,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2018-11-23 15:36:56,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 15:36:56,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 15:36:56,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2018-11-23 15:36:56,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:36:56,783 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2018-11-23 15:36:56,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2018-11-23 15:36:56,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-11-23 15:36:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 15:36:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-23 15:36:56,785 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-23 15:36:56,785 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-23 15:36:56,785 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 15:36:56,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2018-11-23 15:36:56,786 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 15:36:56,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:36:56,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:36:56,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:36:56,787 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:36:56,787 INFO L794 eck$LassoCheckResult]: Stem: 785#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 781#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 782#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 791#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 792#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 793#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 802#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 801#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 800#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 799#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 798#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 797#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 796#L26-3 assume !(main_~i~1 < 5); 789#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 790#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 780#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 774#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 775#L7-3 assume !(sep_~i~0 < 5); 794#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 795#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 783#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 776#L9-2 [2018-11-23 15:36:56,787 INFO L796 eck$LassoCheckResult]: Loop: 776#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 777#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 786#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 776#L9-2 [2018-11-23 15:36:56,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:56,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1567455174, now seen corresponding path program 1 times [2018-11-23 15:36:56,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:56,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:56,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:56,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:56,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 15:36:56,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:36:56,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:36:56,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:56,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 15:36:56,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:36:56,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 15:36:56,877 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:36:56,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:56,877 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 2 times [2018-11-23 15:36:56,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:56,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:56,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:56,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:56,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:56,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:36:56,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:36:56,924 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-23 15:36:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:56,951 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2018-11-23 15:36:56,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:36:56,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2018-11-23 15:36:56,951 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 15:36:56,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 61 transitions. [2018-11-23 15:36:56,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-23 15:36:56,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-23 15:36:56,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 61 transitions. [2018-11-23 15:36:56,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:36:56,952 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2018-11-23 15:36:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 61 transitions. [2018-11-23 15:36:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2018-11-23 15:36:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 15:36:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2018-11-23 15:36:56,954 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2018-11-23 15:36:56,954 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2018-11-23 15:36:56,954 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 15:36:56,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2018-11-23 15:36:56,954 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 15:36:56,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:36:56,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:36:56,955 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:36:56,955 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:36:56,955 INFO L794 eck$LassoCheckResult]: Stem: 937#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 932#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 933#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 940#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 941#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 942#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 956#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 955#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 954#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 953#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 952#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 951#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 950#L26-3 assume !(main_~i~1 < 5); 938#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 939#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 946#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 922#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 923#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 928#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 929#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 948#L7-3 assume !(sep_~i~0 < 5); 943#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 944#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 945#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 949#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 934#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 930#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 924#L9-2 [2018-11-23 15:36:56,955 INFO L796 eck$LassoCheckResult]: Loop: 924#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 925#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 947#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 924#L9-2 [2018-11-23 15:36:56,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:56,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1248848095, now seen corresponding path program 1 times [2018-11-23 15:36:56,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:56,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:56,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:56,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:56,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:56,986 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 15:36:56,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:36:56,987 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:36:57,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:57,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:57,048 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 15:36:57,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:36:57,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 15:36:57,064 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:36:57,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:57,064 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 3 times [2018-11-23 15:36:57,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:57,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:57,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:57,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:57,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:36:57,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:36:57,094 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-11-23 15:36:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:57,129 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2018-11-23 15:36:57,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:36:57,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 73 transitions. [2018-11-23 15:36:57,131 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 15:36:57,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 73 transitions. [2018-11-23 15:36:57,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-23 15:36:57,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-23 15:36:57,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 73 transitions. [2018-11-23 15:36:57,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:36:57,132 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 73 transitions. [2018-11-23 15:36:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 73 transitions. [2018-11-23 15:36:57,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-11-23 15:36:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 15:36:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-11-23 15:36:57,134 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-11-23 15:36:57,134 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-11-23 15:36:57,134 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 15:36:57,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2018-11-23 15:36:57,135 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 15:36:57,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:36:57,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:36:57,135 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:36:57,135 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:36:57,136 INFO L794 eck$LassoCheckResult]: Stem: 1116#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1112#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1113#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1123#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1124#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1125#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1138#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1137#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1136#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1135#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1134#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1133#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1132#L26-3 assume !(main_~i~1 < 5); 1121#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1122#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1129#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1139#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1142#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1143#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1103#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1104#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1110#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1111#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1131#L7-3 assume !(sep_~i~0 < 5); 1126#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1127#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1128#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1144#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1117#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1118#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1140#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1141#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1114#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1106#L9-2 [2018-11-23 15:36:57,136 INFO L796 eck$LassoCheckResult]: Loop: 1106#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1107#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1130#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1106#L9-2 [2018-11-23 15:36:57,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:57,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1685621030, now seen corresponding path program 2 times [2018-11-23 15:36:57,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:57,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:57,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:57,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 15:36:57,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:36:57,175 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:36:57,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:36:57,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:36:57,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:36:57,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 15:36:57,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:36:57,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 15:36:57,223 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:36:57,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 4 times [2018-11-23 15:36:57,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:57,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:57,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:57,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:57,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:36:57,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:36:57,261 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-11-23 15:36:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:57,326 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-11-23 15:36:57,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:36:57,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 85 transitions. [2018-11-23 15:36:57,327 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 15:36:57,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 85 transitions. [2018-11-23 15:36:57,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-23 15:36:57,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-23 15:36:57,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 85 transitions. [2018-11-23 15:36:57,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:36:57,328 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 85 transitions. [2018-11-23 15:36:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 85 transitions. [2018-11-23 15:36:57,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2018-11-23 15:36:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 15:36:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2018-11-23 15:36:57,330 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2018-11-23 15:36:57,331 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2018-11-23 15:36:57,331 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 15:36:57,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2018-11-23 15:36:57,331 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 15:36:57,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:36:57,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:36:57,332 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:36:57,332 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:36:57,332 INFO L794 eck$LassoCheckResult]: Stem: 1334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1329#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1330#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1337#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1338#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1339#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1357#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1356#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1355#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1354#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1353#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1352#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1351#L26-3 assume !(main_~i~1 < 5); 1335#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1336#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1343#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1366#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1344#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1326#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1319#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1320#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1365#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1364#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1363#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1349#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1350#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1348#L7-3 assume !(sep_~i~0 < 5); 1340#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1341#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1342#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1362#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1331#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1327#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1322#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1323#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1361#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1360#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1359#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1358#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1346#L9-2 [2018-11-23 15:36:57,332 INFO L796 eck$LassoCheckResult]: Loop: 1346#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1347#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1345#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1346#L9-2 [2018-11-23 15:36:57,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:57,333 INFO L82 PathProgramCache]: Analyzing trace with hash -534676351, now seen corresponding path program 3 times [2018-11-23 15:36:57,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:57,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:57,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:57,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 15:36:57,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:36:57,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb149f76-8b0b-4097-ba09-ec2124fa20af/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:36:57,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:36:57,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 15:36:57,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:36:57,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 15:36:57,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:36:57,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 15:36:57,456 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:36:57,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:57,456 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 5 times [2018-11-23 15:36:57,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:57,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:57,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:57,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:57,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:36:57,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:36:57,492 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-11-23 15:36:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:57,535 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2018-11-23 15:36:57,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:36:57,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 88 transitions. [2018-11-23 15:36:57,537 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 15:36:57,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 88 transitions. [2018-11-23 15:36:57,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-23 15:36:57,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-23 15:36:57,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 88 transitions. [2018-11-23 15:36:57,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:36:57,538 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 88 transitions. [2018-11-23 15:36:57,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 88 transitions. [2018-11-23 15:36:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2018-11-23 15:36:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 15:36:57,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2018-11-23 15:36:57,540 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2018-11-23 15:36:57,540 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2018-11-23 15:36:57,540 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 15:36:57,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 71 transitions. [2018-11-23 15:36:57,541 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 15:36:57,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:36:57,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:36:57,541 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:36:57,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:36:57,542 INFO L794 eck$LassoCheckResult]: Stem: 1578#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1573#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1574#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1581#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1582#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1583#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1616#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1615#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1614#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1612#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1611#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1609#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1608#L26-3 assume !(main_~i~1 < 5); 1579#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1580#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1587#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1610#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1588#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1570#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1564#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1565#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1607#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1606#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1605#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1603#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1601#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1599#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1594#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1596#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1593#L7-3 assume !(sep_~i~0 < 5); 1584#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1585#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1586#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1613#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1575#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1571#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1566#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1567#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1604#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1602#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1600#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1598#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1597#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1595#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1592#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1590#L9-2 [2018-11-23 15:36:57,542 INFO L796 eck$LassoCheckResult]: Loop: 1590#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1591#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1589#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1590#L9-2 [2018-11-23 15:36:57,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:57,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1616244090, now seen corresponding path program 4 times [2018-11-23 15:36:57,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:57,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:57,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:57,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:57,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:57,639 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 6 times [2018-11-23 15:36:57,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:57,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:57,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:57,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:57,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:57,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1350622481, now seen corresponding path program 1 times [2018-11-23 15:36:57,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:57,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:57,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:57,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:57,737 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 15:36:57,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:36:57,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 15:36:57,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 15:36:57,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:36:57,760 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. cyclomatic complexity: 20 Second operand 10 states. [2018-11-23 15:36:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:57,867 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-23 15:36:57,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:36:57,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2018-11-23 15:36:57,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 15:36:57,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 52 states and 63 transitions. [2018-11-23 15:36:57,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 15:36:57,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-23 15:36:57,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2018-11-23 15:36:57,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:36:57,870 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-11-23 15:36:57,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2018-11-23 15:36:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 15:36:57,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 15:36:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2018-11-23 15:36:57,873 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-11-23 15:36:57,873 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-11-23 15:36:57,873 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 15:36:57,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 63 transitions. [2018-11-23 15:36:57,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 15:36:57,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:36:57,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:36:57,874 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:36:57,874 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:36:57,874 INFO L794 eck$LassoCheckResult]: Stem: 1726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1721#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1722#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1729#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1730#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1731#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1764#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1763#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1762#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1761#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1760#L26-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1759#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1758#L26-3 assume !(main_~i~1 < 5); 1727#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1728#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1719#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1713#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1714#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1757#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1755#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1753#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1751#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1749#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1747#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1745#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1743#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1741#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1739#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1737#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1735#L7-3 assume !(sep_~i~0 < 5); 1732#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1733#L14 main_#t~ret6 := sep_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1720#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1715#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1716#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1723#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1756#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1754#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1752#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1750#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1748#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1746#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1744#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1742#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1740#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1738#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1736#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1734#L7-8 assume !(sep_~i~0 < 5); 1717#L7-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1718#L14-1 main_#t~ret9 := sep_#res;main_~ret2~0 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;main_~i~2 := 0; 1724#L35-3 [2018-11-23 15:36:57,874 INFO L796 eck$LassoCheckResult]: Loop: 1724#L35-3 assume !!(main_~i~2 < 4);call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem12, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem12; 1725#L35-2 main_#t~post11 := main_~i~2;main_~i~2 := 1 + main_#t~post11;havoc main_#t~post11; 1724#L35-3 [2018-11-23 15:36:57,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:57,875 INFO L82 PathProgramCache]: Analyzing trace with hash -866233935, now seen corresponding path program 1 times [2018-11-23 15:36:57,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:57,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:57,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:57,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:57,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:57,974 INFO L82 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2018-11-23 15:36:57,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:57,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:57,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:57,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:57,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:57,977 INFO L82 PathProgramCache]: Analyzing trace with hash 772846003, now seen corresponding path program 1 times [2018-11-23 15:36:57,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:57,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:57,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:57,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:57,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:37:01,347 WARN L180 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 431 DAG size of output: 307 [2018-11-23 15:37:01,349 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-23 15:37:11,918 WARN L180 SmtUtils]: Spent 6.70 s on a formula simplification. DAG size of input: 629 DAG size of output: 119 [2018-11-23 15:37:11,920 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:37:11,920 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:37:11,920 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:37:11,920 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:37:11,920 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:37:11,920 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:37:11,920 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:37:11,920 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:37:11,920 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep05_true-unreach-call_true-termination.i_Iteration14_Lasso [2018-11-23 15:37:11,920 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:37:11,921 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:37:11,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:11,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:11,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:11,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:11,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:11,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:11,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:11,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:11,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:11,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:11,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:11,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:11,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:12,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:12,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:12,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:12,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:12,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:12,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:12,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:12,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:12,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:37:12,344 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:37:12,344 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:37:12,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:37:12,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:37:12,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:37:12,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:37:12,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:37:12,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:37:12,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:37:12,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:37:12,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:37:12,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:37:12,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:37:12,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:37:12,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:37:12,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:37:12,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:37:12,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:37:12,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:37:12,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:37:12,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:37:12,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:37:12,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:37:12,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:37:12,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:37:12,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:37:12,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:37:12,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:37:12,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:37:12,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:37:12,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:37:12,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:37:12,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:37:12,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:37:12,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:37:12,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:37:12,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:37:12,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:37:12,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:37:12,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:37:12,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:37:12,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:37:12,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:37:12,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:37:12,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:37:12,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:37:12,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:37:12,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:37:12,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:37:12,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:37:12,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:37:12,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:37:12,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,414 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:37:12,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,415 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:37:12,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:37:12,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:37:12,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:37:12,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:37:12,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:37:12,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:37:12,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:37:12,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:37:12,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:37:12,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:37:12,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:37:12,432 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:37:12,439 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 15:37:12,439 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 15:37:12,439 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:37:12,440 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:37:12,440 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:37:12,440 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 7 Supporting invariants [] [2018-11-23 15:37:12,521 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-23 15:37:12,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:37:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:37:12,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:37:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:37:12,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:37:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:37:12,572 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:37:12,572 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 15:37:12,579 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 54 states and 66 transitions. Complement of second has 4 states. [2018-11-23 15:37:12,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 15:37:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:37:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 15:37:12,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 50 letters. Loop has 2 letters. [2018-11-23 15:37:12,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:37:12,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 52 letters. Loop has 2 letters. [2018-11-23 15:37:12,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:37:12,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 50 letters. Loop has 4 letters. [2018-11-23 15:37:12,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:37:12,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 66 transitions. [2018-11-23 15:37:12,582 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:37:12,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2018-11-23 15:37:12,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 15:37:12,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 15:37:12,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 15:37:12,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:37:12,583 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:37:12,583 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:37:12,583 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:37:12,583 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 15:37:12,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:37:12,583 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:37:12,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 15:37:12,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:37:12 BoogieIcfgContainer [2018-11-23 15:37:12,594 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:37:12,594 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:37:12,594 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:37:12,594 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:37:12,595 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:54" (3/4) ... [2018-11-23 15:37:12,598 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:37:12,598 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:37:12,599 INFO L168 Benchmark]: Toolchain (without parser) took 18905.69 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 676.9 MB). Free memory was 959.2 MB in the beginning and 858.3 MB in the end (delta: 100.9 MB). Peak memory consumption was 777.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:37:12,599 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:37:12,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.88 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:37:12,600 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.51 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:37:12,600 INFO L168 Benchmark]: Boogie Preprocessor took 56.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:37:12,601 INFO L168 Benchmark]: RCFGBuilder took 227.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:37:12,601 INFO L168 Benchmark]: BuchiAutomizer took 18428.13 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 545.8 MB). Free memory was 1.1 GB in the beginning and 858.3 MB in the end (delta: 249.0 MB). Peak memory consumption was 794.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:37:12,601 INFO L168 Benchmark]: Witness Printer took 3.91 ms. Allocated memory is still 1.7 GB. Free memory is still 858.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:37:12,604 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 161.88 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.51 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 227.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18428.13 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 545.8 MB). Free memory was 1.1 GB in the beginning and 858.3 MB in the end (delta: 249.0 MB). Peak memory consumption was 794.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.91 ms. Allocated memory is still 1.7 GB. Free memory is still 858.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.3s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 17.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 63 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 329 SDtfs, 341 SDslu, 668 SDs, 0 SdLazy, 321 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital204 mio100 ax100 hnf99 lsp91 ukn53 mio100 lsp58 div101 bol100 ite100 ukn100 eq159 hnf88 smp98 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms 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...