./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/bin/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 64bit --witnessprinter.graph.data.programhash 0233d496bfaf5cb1311bfa260a57f41458184795 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:55:03,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:03,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:03,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:03,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:03,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:03,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:03,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:03,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:03,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:03,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:03,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:03,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:03,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:03,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:03,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:03,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:03,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:03,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:03,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:03,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:03,452 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:03,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:03,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:03,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:03,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:03,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:03,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:03,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:03,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:03,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:03,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:03,460 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:03,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:03,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:03,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:03,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:03,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:03,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:03,463 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:03,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:03,465 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:55:03,477 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:03,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:03,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:03,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:03,479 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:03,479 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:55:03,479 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:55:03,479 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:55:03,479 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:55:03,480 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:55:03,480 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:55:03,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:03,480 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:55:03,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:03,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:03,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:55:03,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:55:03,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:55:03,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:03,481 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:55:03,481 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:03,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:55:03,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:03,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:03,482 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:55:03,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:03,482 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:03,482 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:55:03,483 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:55:03,483 INFO L138 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_266612e6-1dde-47cf-a414-0899d7285d2f/bin/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2019-10-22 08:55:03,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:03,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:03,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:03,520 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:03,520 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:03,521 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-10-22 08:55:03,568 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/bin/uautomizer/data/8e3f2913a/908f775d95d140f588ce946fc6e24d55/FLAG1c80c8bce [2019-10-22 08:55:03,961 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:03,962 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-10-22 08:55:03,968 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/bin/uautomizer/data/8e3f2913a/908f775d95d140f588ce946fc6e24d55/FLAG1c80c8bce [2019-10-22 08:55:04,360 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/bin/uautomizer/data/8e3f2913a/908f775d95d140f588ce946fc6e24d55 [2019-10-22 08:55:04,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:04,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:04,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:04,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:04,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:04,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64da7789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04, skipping insertion in model container [2019-10-22 08:55:04,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,377 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:04,388 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:04,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:04,528 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:04,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:04,621 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:04,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04 WrapperNode [2019-10-22 08:55:04,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:04,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:04,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:04,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:04,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,637 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:04,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:04,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:04,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:04,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... [2019-10-22 08:55:04,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:04,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:04,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:04,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:04,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/bin/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 [2019-10-22 08:55:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:55:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:04,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:55:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:55:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:55:04,934 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:04,934 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 08:55:04,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:04 BoogieIcfgContainer [2019-10-22 08:55:04,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:04,936 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:55:04,936 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:55:04,940 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:55:04,940 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:04,940 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:55:04" (1/3) ... [2019-10-22 08:55:04,941 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24ab19d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:04, skipping insertion in model container [2019-10-22 08:55:04,941 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:04,942 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:04" (2/3) ... [2019-10-22 08:55:04,942 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24ab19d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:04, skipping insertion in model container [2019-10-22 08:55:04,942 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:04,942 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:04" (3/3) ... [2019-10-22 08:55:04,944 INFO L371 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2019-10-22 08:55:04,982 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:55:04,982 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:55:04,983 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:55:04,983 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:04,983 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:04,983 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:55:04,983 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:04,983 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:55:04,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 08:55:05,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:55:05,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:05,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:05,022 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:55:05,022 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:55:05,022 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:55:05,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 08:55:05,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:55:05,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:05,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:05,025 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:55:05,025 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:55:05,031 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 6#L24-2true [2019-10-22 08:55:05,032 INFO L793 eck$LassoCheckResult]: Loop: 6#L24-2true call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 12#L15-1true assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 5#L16true assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 6#L24-2true [2019-10-22 08:55:05,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:55:05,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:05,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932583195] [2019-10-22 08:55:05,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:05,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:05,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:05,196 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:05,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:05,197 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2019-10-22 08:55:05,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:05,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956533788] [2019-10-22 08:55:05,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:05,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:05,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:05,212 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:05,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2019-10-22 08:55:05,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:05,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130875586] [2019-10-22 08:55:05,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:05,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:05,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:05,304 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:05,992 WARN L191 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 98 [2019-10-22 08:55:06,249 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-10-22 08:55:06,261 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:06,262 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:06,263 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:06,263 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:06,263 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:06,263 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:06,263 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:06,264 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:06,264 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2019-10-22 08:55:06,264 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:06,264 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:06,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:06,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:06,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:06,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:06,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:06,819 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2019-10-22 08:55:06,960 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-10-22 08:55:06,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:06,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:06,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:06,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:08,124 WARN L191 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-22 08:55:08,221 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:08,226 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:08,228 INFO L120 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 [2019-10-22 08:55:08,229 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,230 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:08,230 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:08,230 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,231 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,232 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:08,233 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:08,234 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:08,235 INFO L120 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 [2019-10-22 08:55:08,236 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,236 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:08,236 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,236 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,238 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:08,239 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:08,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:08,242 INFO L120 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 [2019-10-22 08:55:08,243 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,243 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:08,243 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:08,244 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,244 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,244 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:08,244 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:08,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:08,246 INFO L120 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 [2019-10-22 08:55:08,247 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,247 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:08,247 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,247 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,249 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:08,249 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:08,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:08,252 INFO L120 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 [2019-10-22 08:55:08,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,253 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:08,253 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,254 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,260 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:08,260 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:08,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:08,300 INFO L120 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 [2019-10-22 08:55:08,301 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,302 INFO L202 nArgumentSynthesizer]: 16 stem disjuncts [2019-10-22 08:55:08,302 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,302 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,316 INFO L400 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-10-22 08:55:08,317 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:08,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:08,440 INFO L120 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 [2019-10-22 08:55:08,441 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,441 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:08,441 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,442 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,443 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:08,443 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:08,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:08,455 INFO L120 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 [2019-10-22 08:55:08,456 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,457 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:08,457 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,457 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,458 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:08,458 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:08,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:08,462 INFO L120 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 [2019-10-22 08:55:08,463 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,464 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:08,465 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,465 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,466 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:08,466 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:08,468 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:08,469 INFO L120 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 [2019-10-22 08:55:08,479 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,479 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:08,479 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,479 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,480 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:08,480 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:08,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:08,483 INFO L120 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 [2019-10-22 08:55:08,483 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,484 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:08,484 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,484 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,485 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:08,485 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:08,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:08,489 INFO L120 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 [2019-10-22 08:55:08,490 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,490 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:08,490 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,490 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,491 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:08,491 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:08,493 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:08,494 INFO L120 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 [2019-10-22 08:55:08,494 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:08,495 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,495 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,496 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:08,496 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:08,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:08,502 INFO L120 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 [2019-10-22 08:55:08,503 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,503 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:08,503 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,503 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,504 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:08,504 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:08,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:08,512 INFO L120 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 [2019-10-22 08:55:08,512 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,512 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:08,512 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,512 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,513 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:08,515 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:08,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:08,519 INFO L120 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 [2019-10-22 08:55:08,519 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:08,520 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,520 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,520 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:08,521 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:08,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:08,526 INFO L120 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 [2019-10-22 08:55:08,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:08,526 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:08,526 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:08,526 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:08,527 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:08,527 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:08,534 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:08,542 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:55:08,542 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:08,544 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:08,545 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:08,545 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:08,547 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1 + 1 Supporting invariants [] [2019-10-22 08:55:08,674 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2019-10-22 08:55:08,683 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:55:08,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:08,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:08,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:08,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:55:08,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:08,774 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 [2019-10-22 08:55:08,776 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2019-10-22 08:55:08,821 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 29 states and 36 transitions. Complement of second has 8 states. [2019-10-22 08:55:08,822 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 [2019-10-22 08:55:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:55:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-10-22 08:55:08,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2019-10-22 08:55:08,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:08,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2019-10-22 08:55:08,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:08,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2019-10-22 08:55:08,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:08,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2019-10-22 08:55:08,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:55:08,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2019-10-22 08:55:08,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:55:08,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:55:08,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-10-22 08:55:08,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:08,835 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-10-22 08:55:08,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-10-22 08:55:08,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 08:55:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:55:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-10-22 08:55:08,865 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-10-22 08:55:08,865 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-10-22 08:55:08,865 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:55:08,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-10-22 08:55:08,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:55:08,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:08,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:08,866 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:55:08,866 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:55:08,867 INFO L791 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 243#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 244#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 253#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 246#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 247#L20 [2019-10-22 08:55:08,867 INFO L793 eck$LassoCheckResult]: Loop: 247#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 250#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 251#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 255#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 247#L20 [2019-10-22 08:55:08,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:08,867 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-10-22 08:55:08,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:08,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420113847] [2019-10-22 08:55:08,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:08,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420113847] [2019-10-22 08:55:08,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:08,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:08,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748049249] [2019-10-22 08:55:08,990 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:08,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:08,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2019-10-22 08:55:08,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:08,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281502029] [2019-10-22 08:55:08,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,002 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:09,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:09,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:09,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:09,100 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-10-22 08:55:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:09,188 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-10-22 08:55:09,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:09,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-10-22 08:55:09,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:55:09,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 19 transitions. [2019-10-22 08:55:09,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:55:09,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:55:09,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-10-22 08:55:09,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:09,192 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 08:55:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-10-22 08:55:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-10-22 08:55:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:55:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-10-22 08:55:09,195 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:55:09,195 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:55:09,195 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:55:09,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-10-22 08:55:09,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:55:09,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:09,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:09,196 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-10-22 08:55:09,196 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:55:09,196 INFO L791 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 285#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 286#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 292#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 290#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 291#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 293#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 288#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 289#L20 [2019-10-22 08:55:09,196 INFO L793 eck$LassoCheckResult]: Loop: 289#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 295#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 296#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 297#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 289#L20 [2019-10-22 08:55:09,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,197 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2019-10-22 08:55:09,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135703799] [2019-10-22 08:55:09,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,243 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:09,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2019-10-22 08:55:09,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597263554] [2019-10-22 08:55:09,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,257 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:09,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2019-10-22 08:55:09,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040803556] [2019-10-22 08:55:09,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:09,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040803556] [2019-10-22 08:55:09,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540664258] [2019-10-22 08:55:09,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:09,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:55:09,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:09,429 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:09,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-10-22 08:55:09,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:09,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:09,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:09,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2019-10-22 08:55:09,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 08:55:09,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:09,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:09,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:09,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-10-22 08:55:09,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-22 08:55:09,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:09,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:09,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:09,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-10-22 08:55:09,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:55:09,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-22 08:55:09,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:09,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:09,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 08:55:09,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:19 [2019-10-22 08:55:09,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-22 08:55:09,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:09,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:09,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:09,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-10-22 08:55:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:09,577 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:09,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-10-22 08:55:09,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497197187] [2019-10-22 08:55:09,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:09,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:55:09,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:55:09,671 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 11 states. [2019-10-22 08:55:09,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:09,844 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-10-22 08:55:09,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:55:09,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2019-10-22 08:55:09,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-10-22 08:55:09,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2019-10-22 08:55:09,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 08:55:09,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-10-22 08:55:09,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2019-10-22 08:55:09,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:09,848 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-10-22 08:55:09,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2019-10-22 08:55:09,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2019-10-22 08:55:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:55:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-10-22 08:55:09,850 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-10-22 08:55:09,850 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-10-22 08:55:09,850 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:55:09,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-10-22 08:55:09,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-10-22 08:55:09,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:09,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:09,851 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:55:09,851 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2019-10-22 08:55:09,851 INFO L791 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 374#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 375#L24-2 [2019-10-22 08:55:09,852 INFO L793 eck$LassoCheckResult]: Loop: 375#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 384#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 376#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 377#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 379#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 382#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 383#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 375#L24-2 [2019-10-22 08:55:09,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,852 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 08:55:09,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137015081] [2019-10-22 08:55:09,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,879 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:09,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,880 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 1 times [2019-10-22 08:55:09,880 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288652357] [2019-10-22 08:55:09,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,898 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:09,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 2 times [2019-10-22 08:55:09,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681689001] [2019-10-22 08:55:09,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,948 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:10,115 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-10-22 08:55:10,660 WARN L191 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 98 [2019-10-22 08:55:10,828 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-10-22 08:55:10,830 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:10,830 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:10,830 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:10,830 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:10,830 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:10,831 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:10,831 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:10,831 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:10,831 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration4_Lasso [2019-10-22 08:55:10,831 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:10,831 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:10,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:10,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,341 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-10-22 08:55:11,466 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-10-22 08:55:11,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:11,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,493 WARN L191 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-22 08:55:12,526 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:12,526 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:12,526 INFO L120 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 [2019-10-22 08:55:12,527 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:12,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:12,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:12,527 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:12,528 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:12,528 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:12,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:12,530 INFO L120 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 [2019-10-22 08:55:12,531 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:12,531 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:12,531 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:12,531 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:12,531 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:12,531 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:12,532 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:12,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:12,532 INFO L120 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 [2019-10-22 08:55:12,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:12,533 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:12,533 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:12,533 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:12,534 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:12,534 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:12,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:12,536 INFO L120 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 [2019-10-22 08:55:12,536 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:12,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:12,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:12,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:12,537 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:12,537 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:12,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:12,541 INFO L120 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 [2019-10-22 08:55:12,542 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:12,542 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:12,542 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:12,542 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:12,543 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:12,543 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:12,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:12,547 INFO L120 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 [2019-10-22 08:55:12,547 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:12,547 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:12,547 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:12,547 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:12,548 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:12,548 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:12,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:12,550 INFO L120 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 [2019-10-22 08:55:12,551 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:12,551 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:12,551 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:12,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:12,552 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:12,552 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:12,556 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:12,561 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:55:12,562 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:12,562 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:12,563 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:12,563 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:12,563 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2 + 1 Supporting invariants [] [2019-10-22 08:55:12,678 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-10-22 08:55:12,679 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:55:12,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:12,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:12,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:12,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 08:55:12,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:12,751 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:12,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 61 [2019-10-22 08:55:12,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:12,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:12,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:12,800 INFO L567 ElimStorePlain]: treesize reduction 33, result has 54.2 percent of original size [2019-10-22 08:55:12,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:12,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:39 [2019-10-22 08:55:12,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:12,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:12,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-10-22 08:55:12,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:12,864 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:12,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-10-22 08:55:12,865 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:12,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-10-22 08:55:12,874 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:12,907 INFO L567 ElimStorePlain]: treesize reduction 34, result has 57.0 percent of original size [2019-10-22 08:55:12,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-22 08:55:12,908 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:112, output treesize:45 [2019-10-22 08:55:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:12,932 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-10-22 08:55:12,932 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-10-22 08:55:13,015 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 27 states and 32 transitions. Complement of second has 13 states. [2019-10-22 08:55:13,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:55:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-10-22 08:55:13,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2019-10-22 08:55:13,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:13,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2019-10-22 08:55:13,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:13,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2019-10-22 08:55:13,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:13,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-10-22 08:55:13,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-10-22 08:55:13,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2019-10-22 08:55:13,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-10-22 08:55:13,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 08:55:13,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2019-10-22 08:55:13,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:13,019 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-10-22 08:55:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2019-10-22 08:55:13,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-22 08:55:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 08:55:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-10-22 08:55:13,021 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-10-22 08:55:13,021 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-10-22 08:55:13,021 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:55:13,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-10-22 08:55:13,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-10-22 08:55:13,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:13,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:13,022 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-10-22 08:55:13,023 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:55:13,023 INFO L791 eck$LassoCheckResult]: Stem: 647#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 641#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 642#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 652#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 653#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 666#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 665#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 664#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 655#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 651#L24 [2019-10-22 08:55:13,023 INFO L793 eck$LassoCheckResult]: Loop: 651#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 648#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 649#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 661#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 660#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 651#L24 [2019-10-22 08:55:13,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:13,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2019-10-22 08:55:13,023 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:13,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464920995] [2019-10-22 08:55:13,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:13,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464920995] [2019-10-22 08:55:13,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957723920] [2019-10-22 08:55:13,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:13,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-22 08:55:13,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:13,261 INFO L341 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2019-10-22 08:55:13,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 29 [2019-10-22 08:55:13,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:13,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:13,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:55:13,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:133, output treesize:38 [2019-10-22 08:55:13,337 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:13,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-10-22 08:55:13,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:13,369 INFO L567 ElimStorePlain]: treesize reduction 24, result has 61.9 percent of original size [2019-10-22 08:55:13,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:13,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:39 [2019-10-22 08:55:13,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:13,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:13,543 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:13,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2019-10-22 08:55:13,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:13,551 INFO L567 ElimStorePlain]: treesize reduction 22, result has 12.0 percent of original size [2019-10-22 08:55:13,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:13,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2019-10-22 08:55:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:13,552 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:13,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-10-22 08:55:13,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621685350] [2019-10-22 08:55:13,553 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:13,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:13,553 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 1 times [2019-10-22 08:55:13,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:13,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672226495] [2019-10-22 08:55:13,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:13,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:13,563 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:13,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:13,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:55:13,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:55:13,704 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 7 Second operand 11 states. [2019-10-22 08:55:13,972 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-10-22 08:55:14,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:14,122 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-10-22 08:55:14,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:14,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2019-10-22 08:55:14,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-10-22 08:55:14,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2019-10-22 08:55:14,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-10-22 08:55:14,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 08:55:14,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2019-10-22 08:55:14,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:14,125 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-10-22 08:55:14,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2019-10-22 08:55:14,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-10-22 08:55:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 08:55:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-22 08:55:14,126 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-22 08:55:14,127 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-22 08:55:14,127 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:55:14,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2019-10-22 08:55:14,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-10-22 08:55:14,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:14,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:14,128 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-10-22 08:55:14,128 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:55:14,128 INFO L791 eck$LassoCheckResult]: Stem: 762#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 760#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 761#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 771#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 765#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 766#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 779#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 776#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 775#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 769#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 770#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 773#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 785#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 784#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 783#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 774#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 772#L24 [2019-10-22 08:55:14,128 INFO L793 eck$LassoCheckResult]: Loop: 772#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 767#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 768#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 780#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 778#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 772#L24 [2019-10-22 08:55:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:14,129 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 1 times [2019-10-22 08:55:14,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:14,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465147267] [2019-10-22 08:55:14,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:14,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:14,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:14,175 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:14,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:14,176 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 2 times [2019-10-22 08:55:14,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:14,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547928265] [2019-10-22 08:55:14,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:14,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:14,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:14,186 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:14,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:14,190 INFO L82 PathProgramCache]: Analyzing trace with hash 16810558, now seen corresponding path program 1 times [2019-10-22 08:55:14,190 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:14,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145827020] [2019-10-22 08:55:14,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:14,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:14,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-22 08:55:14,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145827020] [2019-10-22 08:55:14,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086481797] [2019-10-22 08:55:14,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:14,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-22 08:55:14,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:14,366 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:14,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-10-22 08:55:14,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:14,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:14,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:14,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2019-10-22 08:55:14,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 08:55:14,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:14,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:14,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:14,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-10-22 08:55:14,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 08:55:14,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:14,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:14,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:14,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:8 [2019-10-22 08:55:14,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 08:55:14,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:14,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:14,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:14,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-10-22 08:55:14,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-22 08:55:14,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:14,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:14,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:14,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-22 08:55:14,496 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:14,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 76 [2019-10-22 08:55:14,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:14,523 INFO L567 ElimStorePlain]: treesize reduction 32, result has 56.8 percent of original size [2019-10-22 08:55:14,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:14,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:14,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 08:55:14,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:42 [2019-10-22 08:55:14,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:14,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:14,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:14,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:14,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:14,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:14,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 08:55:14,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:55:14,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-10-22 08:55:14,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:14,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:14,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:14,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:3 [2019-10-22 08:55:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-22 08:55:14,635 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:14,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2019-10-22 08:55:14,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211695174] [2019-10-22 08:55:14,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:14,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 08:55:14,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:55:14,776 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 15 states. [2019-10-22 08:55:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:15,149 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-10-22 08:55:15,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:55:15,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2019-10-22 08:55:15,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-10-22 08:55:15,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2019-10-22 08:55:15,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-10-22 08:55:15,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-10-22 08:55:15,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2019-10-22 08:55:15,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:15,152 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-22 08:55:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2019-10-22 08:55:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2019-10-22 08:55:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 08:55:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-22 08:55:15,154 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-22 08:55:15,154 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-22 08:55:15,154 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:55:15,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2019-10-22 08:55:15,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-10-22 08:55:15,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:15,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:15,156 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-10-22 08:55:15,156 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-10-22 08:55:15,156 INFO L791 eck$LassoCheckResult]: Stem: 932#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 926#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 927#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 933#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 930#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 931#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 948#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 943#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 941#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 934#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 935#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 953#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 952#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 951#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 950#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 942#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 936#L24 [2019-10-22 08:55:15,156 INFO L793 eck$LassoCheckResult]: Loop: 936#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 937#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 939#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 928#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 929#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 949#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 946#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 947#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 936#L24 [2019-10-22 08:55:15,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:15,156 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 2 times [2019-10-22 08:55:15,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:15,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859479750] [2019-10-22 08:55:15,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:15,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:15,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:15,189 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:15,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:15,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1088312668, now seen corresponding path program 1 times [2019-10-22 08:55:15,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:15,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920912513] [2019-10-22 08:55:15,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:15,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:15,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:15,202 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:15,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:15,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122080, now seen corresponding path program 2 times [2019-10-22 08:55:15,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:15,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378050922] [2019-10-22 08:55:15,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:15,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:15,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 08:55:15,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378050922] [2019-10-22 08:55:15,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479078313] [2019-10-22 08:55:15,310 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_266612e6-1dde-47cf-a414-0899d7285d2f/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:15,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:55:15,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:55:15,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-22 08:55:15,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:15,388 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:15,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-10-22 08:55:15,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:15,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:15,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:15,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-10-22 08:55:15,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 08:55:15,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:15,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:15,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:15,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-22 08:55:15,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-22 08:55:15,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:15,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:15,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 08:55:15,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2019-10-22 08:55:15,505 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:15,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-10-22 08:55:15,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:15,538 INFO L567 ElimStorePlain]: treesize reduction 36, result has 50.0 percent of original size [2019-10-22 08:55:15,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 08:55:15,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:36 [2019-10-22 08:55:15,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:15,616 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:15,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 50 [2019-10-22 08:55:15,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:15,623 INFO L567 ElimStorePlain]: treesize reduction 26, result has 10.3 percent of original size [2019-10-22 08:55:15,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:15,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:3 [2019-10-22 08:55:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-22 08:55:15,636 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:15,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-10-22 08:55:15,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162311531] [2019-10-22 08:55:15,859 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-10-22 08:55:15,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:15,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:55:15,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:55:15,941 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 6 Second operand 12 states. [2019-10-22 08:55:16,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:16,152 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-10-22 08:55:16,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:55:16,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2019-10-22 08:55:16,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-10-22 08:55:16,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 45 transitions. [2019-10-22 08:55:16,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-10-22 08:55:16,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-10-22 08:55:16,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 45 transitions. [2019-10-22 08:55:16,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:16,155 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-10-22 08:55:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 45 transitions. [2019-10-22 08:55:16,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2019-10-22 08:55:16,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 08:55:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-22 08:55:16,158 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-22 08:55:16,158 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-22 08:55:16,158 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:55:16,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 38 transitions. [2019-10-22 08:55:16,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-10-22 08:55:16,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:16,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:16,159 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-10-22 08:55:16,159 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-10-22 08:55:16,160 INFO L791 eck$LassoCheckResult]: Stem: 1097#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1091#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1092#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1098#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1095#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1096#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1114#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1110#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1108#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1099#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1100#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1124#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1123#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1122#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1121#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1109#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1101#L24 [2019-10-22 08:55:16,160 INFO L793 eck$LassoCheckResult]: Loop: 1101#L24 assume !(0 == main_#t~mem7);havoc main_#t~mem7;call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(1, main_~x3~0.base, main_~x3~0.offset, 4); 1103#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1119#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1117#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1116#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1115#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1111#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1112#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1101#L24 [2019-10-22 08:55:16,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:16,160 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 3 times [2019-10-22 08:55:16,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:16,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133652799] [2019-10-22 08:55:16,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:16,203 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:16,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:16,206 INFO L82 PathProgramCache]: Analyzing trace with hash 278966042, now seen corresponding path program 1 times [2019-10-22 08:55:16,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:16,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790299364] [2019-10-22 08:55:16,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:55:16,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790299364] [2019-10-22 08:55:16,227 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:16,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:16,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940004388] [2019-10-22 08:55:16,228 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:16,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:16,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:16,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:16,229 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-10-22 08:55:16,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:16,260 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-10-22 08:55:16,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:16,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2019-10-22 08:55:16,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-10-22 08:55:16,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 33 transitions. [2019-10-22 08:55:16,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-10-22 08:55:16,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-10-22 08:55:16,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2019-10-22 08:55:16,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:16,262 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-10-22 08:55:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2019-10-22 08:55:16,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-22 08:55:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:55:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-10-22 08:55:16,264 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-10-22 08:55:16,264 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-10-22 08:55:16,264 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:55:16,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2019-10-22 08:55:16,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-10-22 08:55:16,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:16,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:16,265 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-10-22 08:55:16,265 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2019-10-22 08:55:16,267 INFO L791 eck$LassoCheckResult]: Stem: 1173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1167#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1168#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1179#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1171#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1172#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1176#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1183#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1181#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1182#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1185#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1197#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1196#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1195#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1194#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1184#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1177#L24 [2019-10-22 08:55:16,268 INFO L793 eck$LassoCheckResult]: Loop: 1177#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1178#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1190#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1189#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1188#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1187#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1186#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1180#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1174#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1175#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1169#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1170#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1193#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1191#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1192#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1177#L24 [2019-10-22 08:55:16,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:16,268 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 4 times [2019-10-22 08:55:16,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:16,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325113971] [2019-10-22 08:55:16,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:16,317 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:16,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:16,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2047759866, now seen corresponding path program 1 times [2019-10-22 08:55:16,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:16,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493139750] [2019-10-22 08:55:16,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:16,338 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:16,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:16,343 INFO L82 PathProgramCache]: Analyzing trace with hash 462437174, now seen corresponding path program 3 times [2019-10-22 08:55:16,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:16,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250744936] [2019-10-22 08:55:16,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:16,393 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:16,932 WARN L191 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 115 [2019-10-22 08:55:17,064 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-22 08:55:19,421 WARN L191 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 194 DAG size of output: 158 [2019-10-22 08:55:19,846 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-10-22 08:55:19,850 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:19,850 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:19,850 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:19,850 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:19,850 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:19,850 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:19,851 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:19,851 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:19,851 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration9_Lasso [2019-10-22 08:55:19,851 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:19,851 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:19,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:19,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:19,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:19,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:19,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:20,444 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-10-22 08:55:20,604 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-10-22 08:55:20,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:20,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:20,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:20,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:21,527 WARN L191 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-22 08:55:21,627 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:21,627 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:21,628 INFO L120 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 [2019-10-22 08:55:21,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:21,628 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:21,628 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:21,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:21,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:21,629 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:21,629 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:21,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:21,630 INFO L120 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 [2019-10-22 08:55:21,630 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:21,630 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:21,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:21,630 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:21,631 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:21,631 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:21,631 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:21,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:21,632 INFO L120 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 [2019-10-22 08:55:21,632 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:21,632 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:21,632 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:21,632 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:21,633 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:21,633 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:21,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:21,635 INFO L120 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 [2019-10-22 08:55:21,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:21,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:21,635 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:21,635 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:21,636 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:21,636 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:21,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:21,637 INFO L120 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 [2019-10-22 08:55:21,637 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:21,637 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:21,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:21,638 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:21,639 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:21,639 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:21,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:21,640 INFO L120 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 [2019-10-22 08:55:21,641 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:21,641 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:21,641 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:21,641 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:21,642 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:21,642 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:21,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:21,644 INFO L120 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 [2019-10-22 08:55:21,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:21,644 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:21,644 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:21,644 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:21,645 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:21,645 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:21,649 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:21,653 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:55:21,654 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:55:21,654 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:21,655 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:21,655 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:21,655 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem7) = -2*ULTIMATE.start_main_#t~mem7 + 1 Supporting invariants [] [2019-10-22 08:55:21,807 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2019-10-22 08:55:21,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:21,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:21,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:21,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-22 08:55:21,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:21,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 08:55:21,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:21,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:21,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:21,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-22 08:55:21,913 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:21,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 57 [2019-10-22 08:55:21,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:21,933 INFO L567 ElimStorePlain]: treesize reduction 24, result has 55.6 percent of original size [2019-10-22 08:55:21,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:21,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:30 [2019-10-22 08:55:21,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-10-22 08:55:21,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:21,982 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:21,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2019-10-22 08:55:21,983 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:22,019 INFO L567 ElimStorePlain]: treesize reduction 38, result has 43.3 percent of original size [2019-10-22 08:55:22,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:22,019 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:29 [2019-10-22 08:55:22,096 INFO L341 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2019-10-22 08:55:22,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 103 [2019-10-22 08:55:22,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:22,126 INFO L567 ElimStorePlain]: treesize reduction 40, result has 52.9 percent of original size [2019-10-22 08:55:22,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:22,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:45 [2019-10-22 08:55:22,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:22,230 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:22,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 114 [2019-10-22 08:55:22,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:22,292 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:22,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 114 [2019-10-22 08:55:22,293 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:22,381 INFO L567 ElimStorePlain]: treesize reduction 96, result has 50.8 percent of original size [2019-10-22 08:55:22,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 08:55:22,382 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:99 [2019-10-22 08:55:22,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:22,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:22,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:22,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:22,494 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:22,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 50 [2019-10-22 08:55:22,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:22,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:22,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 50 [2019-10-22 08:55:22,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:22,534 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:22,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 50 [2019-10-22 08:55:22,535 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:22,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-10-22 08:55:22,553 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:22,582 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:22,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 50 [2019-10-22 08:55:22,583 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:22,604 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:22,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 50 [2019-10-22 08:55:22,605 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:22,625 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:22,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 50 [2019-10-22 08:55:22,626 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:22,636 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:22,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 50 [2019-10-22 08:55:22,637 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:22,707 INFO L567 ElimStorePlain]: treesize reduction 262, result has 20.4 percent of original size [2019-10-22 08:55:22,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-10-22 08:55:22,708 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:417, output treesize:67 [2019-10-22 08:55:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:22,751 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-10-22 08:55:22,751 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4 Second operand 10 states. [2019-10-22 08:55:23,050 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-10-22 08:55:23,133 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4. Second operand 10 states. Result 61 states and 65 transitions. Complement of second has 23 states. [2019-10-22 08:55:23,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 08:55:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-10-22 08:55:23,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 31 transitions. Stem has 16 letters. Loop has 15 letters. [2019-10-22 08:55:23,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:23,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 31 transitions. Stem has 31 letters. Loop has 15 letters. [2019-10-22 08:55:23,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:23,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 31 transitions. Stem has 16 letters. Loop has 30 letters. [2019-10-22 08:55:23,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:23,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 65 transitions. [2019-10-22 08:55:23,138 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:23,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 0 states and 0 transitions. [2019-10-22 08:55:23,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:55:23,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:55:23,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:55:23,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:23,139 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:23,139 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:23,139 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:23,139 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:55:23,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:23,140 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:23,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:55:23,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:55:23 BoogieIcfgContainer [2019-10-22 08:55:23,146 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:55:23,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:23,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:23,147 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:23,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:04" (3/4) ... [2019-10-22 08:55:23,151 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:55:23,151 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:23,152 INFO L168 Benchmark]: Toolchain (without parser) took 18789.13 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 459.8 MB). Free memory was 943.4 MB in the beginning and 1.4 GB in the end (delta: -476.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:23,153 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:23,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:23,153 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:23,154 INFO L168 Benchmark]: Boogie Preprocessor took 20.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:23,154 INFO L168 Benchmark]: RCFGBuilder took 263.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:23,154 INFO L168 Benchmark]: BuchiAutomizer took 18210.05 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 348.1 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -340.0 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:23,154 INFO L168 Benchmark]: Witness Printer took 4.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:23,156 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 263.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18210.05 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 348.1 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -340.0 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (6 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x0][x0] + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. One deterministic module has affine ranking function -2 * aux-x2-aux + 1 and consists of 13 locations. 6 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.1s and 10 iterations. TraceHistogramMax:4. Analysis of lassos took 14.9s. Construction of modules took 0.5s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 35 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/22 HoareTripleCheckerStatistics: 37 SDtfs, 79 SDslu, 41 SDs, 0 SdLazy, 489 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1203 mio100 ax100 hnf100 lsp98 ukn40 mio100 lsp36 div100 bol100 ite100 ukn100 eq186 hnf88 smp93 dnf719 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 136ms VariablesStem: 9 VariablesLoop: 8 DisjunctsStem: 16 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 36 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...