./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/NonTermination3-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NonTermination3-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/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 b10c0555613e3e1e99ee574b69e31152fe0aa7f9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:45:23,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:45:23,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:45:23,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:45:23,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:45:23,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:45:23,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:45:23,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:45:23,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:45:23,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:45:23,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:45:23,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:45:23,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:45:23,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:45:23,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:45:23,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:45:23,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:45:23,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:45:23,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:45:23,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:45:23,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:45:23,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:45:23,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:45:23,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:45:23,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:45:23,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:45:23,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:45:23,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:45:23,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:45:23,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:45:23,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:45:23,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:45:23,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:45:23,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:45:23,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:45:23,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:45:23,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:45:23,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:45:23,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:45:23,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:45:23,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:45:23,532 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-25 08:45:23,559 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:45:23,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:45:23,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:45:23,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:45:23,572 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:45:23,572 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:45:23,572 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:45:23,572 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:45:23,572 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:45:23,573 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:45:23,573 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:45:23,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:45:23,573 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:45:23,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:45:23,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:45:23,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:45:23,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:45:23,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:45:23,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:45:23,575 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:45:23,575 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:45:23,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:45:23,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:45:23,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:45:23,577 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:45:23,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:45:23,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:45:23,577 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:45:23,578 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:45:23,579 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/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/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 -> b10c0555613e3e1e99ee574b69e31152fe0aa7f9 [2019-11-25 08:45:23,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:45:23,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:45:23,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:45:23,755 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:45:23,756 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:45:23,756 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2019-11-25 08:45:23,817 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/data/dc189ad9b/dd2580aa6fe34ee181b8889f06a69238/FLAG6b77e86b1 [2019-11-25 08:45:24,166 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:45:24,167 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2019-11-25 08:45:24,172 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/data/dc189ad9b/dd2580aa6fe34ee181b8889f06a69238/FLAG6b77e86b1 [2019-11-25 08:45:24,583 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/data/dc189ad9b/dd2580aa6fe34ee181b8889f06a69238 [2019-11-25 08:45:24,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:45:24,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:45:24,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:24,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:45:24,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:45:24,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b14df31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24, skipping insertion in model container [2019-11-25 08:45:24,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:45:24,614 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:45:24,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:45:24,764 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:45:24,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:45:24,862 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:45:24,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24 WrapperNode [2019-11-25 08:45:24,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:24,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:45:24,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:45:24,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:45:24,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:45:24,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:45:24,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:45:24,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:45:24,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:45:24,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:45:24,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:45:24,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:45:24,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/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-11-25 08:45:25,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:45:25,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:45:25,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:45:25,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:45:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:45:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:45:25,294 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:45:25,295 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-25 08:45:25,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25 BoogieIcfgContainer [2019-11-25 08:45:25,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:45:25,296 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:45:25,296 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:45:25,299 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:45:25,302 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:45:25,303 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:45:24" (1/3) ... [2019-11-25 08:45:25,304 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c4d6f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:45:25, skipping insertion in model container [2019-11-25 08:45:25,304 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:45:25,304 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (2/3) ... [2019-11-25 08:45:25,305 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c4d6f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:45:25, skipping insertion in model container [2019-11-25 08:45:25,305 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:45:25,305 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25" (3/3) ... [2019-11-25 08:45:25,308 INFO L371 chiAutomizerObserver]: Analyzing ICFG NonTermination3-2.c [2019-11-25 08:45:25,365 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:45:25,365 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:45:25,366 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:45:25,366 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:45:25,366 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:45:25,366 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:45:25,366 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:45:25,367 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:45:25,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-25 08:45:25,409 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-25 08:45:25,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:25,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:25,413 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:45:25,413 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:45:25,414 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:45:25,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-25 08:45:25,415 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-25 08:45:25,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:25,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:25,416 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:45:25,416 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:45:25,424 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 5#L13-3true [2019-11-25 08:45:25,425 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-3true assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 8#L13-2true main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 5#L13-3true [2019-11-25 08:45:25,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,431 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-25 08:45:25,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876595478] [2019-11-25 08:45:25,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:25,540 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:25,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-25 08:45:25,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439304586] [2019-11-25 08:45:25,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:25,559 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:25,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,560 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-25 08:45:25,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980690935] [2019-11-25 08:45:25,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:25,597 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:25,789 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-11-25 08:45:25,832 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:45:25,833 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:45:25,833 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:45:25,833 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:45:25,833 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:45:25,833 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:25,833 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:45:25,833 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:45:25,834 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-2.c_Iteration1_Lasso [2019-11-25 08:45:25,834 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:45:25,834 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:45:25,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-11-25 08:45:25,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:25,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:25,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:25,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:25,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:25,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:25,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:25,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:25,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:45:26,186 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:45:26,191 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:26,202 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-11-25 08:45:26,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:26,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:26,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:26,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:26,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:26,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:26,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:26,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:26,221 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-11-25 08:45:26,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:26,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:26,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:26,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:26,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:26,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:26,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:45:26,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:26,249 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-11-25 08:45:26,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:26,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:26,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:26,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:26,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:26,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:26,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:45:26,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:26,272 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-11-25 08:45:26,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:26,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:26,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:26,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:26,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:45:26,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:45:26,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:26,301 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-11-25 08:45:26,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:26,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:26,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:26,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:26,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:45:26,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:45:26,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:26,331 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-11-25 08:45:26,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:26,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:26,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:26,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:26,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:45:26,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:45:26,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:26,353 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-11-25 08:45:26,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:26,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:26,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:26,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:26,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:26,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:26,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:45:26,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:26,373 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-11-25 08:45:26,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:26,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:45:26,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:26,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:26,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:26,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:45:26,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:26,378 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:45:26,397 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-11-25 08:45:26,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:45:26,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:45:26,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:45:26,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:45:26,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:45:26,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:26,425 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:45:26,461 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-25 08:45:26,461 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:45:26,473 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:45:26,476 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:45:26,476 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:45:26,477 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 19 Supporting invariants [] [2019-11-25 08:45:26,488 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-25 08:45:26,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:26,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:26,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:26,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:45:26,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:26,579 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-11-25 08:45:26,580 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2019-11-25 08:45:26,623 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 28 states and 40 transitions. Complement of second has 7 states. [2019-11-25 08:45:26,624 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-11-25 08:45:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-25 08:45:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-11-25 08:45:26,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-25 08:45:26,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:26,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-25 08:45:26,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:26,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-25 08:45:26,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:45:26,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2019-11-25 08:45:26,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:26,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 12 transitions. [2019-11-25 08:45:26,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-25 08:45:26,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-25 08:45:26,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-11-25 08:45:26,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:45:26,648 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-25 08:45:26,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-11-25 08:45:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-25 08:45:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-25 08:45:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-11-25 08:45:26,676 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-11-25 08:45:26,676 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-11-25 08:45:26,677 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:45:26,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2019-11-25 08:45:26,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:26,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:26,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:26,679 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-25 08:45:26,679 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:45:26,680 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 84#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 85#L13-3 assume !(main_~n~0 < 10); 83#L17-4 [2019-11-25 08:45:26,680 INFO L796 eck$LassoCheckResult]: Loop: 83#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 89#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 82#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 83#L17-4 [2019-11-25 08:45:26,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,681 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2019-11-25 08:45:26,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666283976] [2019-11-25 08:45:26,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:26,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666283976] [2019-11-25 08:45:26,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:26,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:26,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409422989] [2019-11-25 08:45:26,745 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:45:26,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,746 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2019-11-25 08:45:26,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634809420] [2019-11-25 08:45:26,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:26,766 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:26,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:26,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:26,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,903 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-25 08:45:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:26,916 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-11-25 08:45:26,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:26,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-11-25 08:45:26,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:26,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2019-11-25 08:45:26,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-25 08:45:26,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-25 08:45:26,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-11-25 08:45:26,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:45:26,919 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-25 08:45:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-11-25 08:45:26,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-25 08:45:26,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-25 08:45:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-11-25 08:45:26,921 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-25 08:45:26,921 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-25 08:45:26,921 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:45:26,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-11-25 08:45:26,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:26,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:26,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:26,923 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:45:26,923 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:45:26,923 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 105#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 106#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 109#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 110#L13-3 assume !(main_~n~0 < 10); 108#L17-4 [2019-11-25 08:45:26,923 INFO L796 eck$LassoCheckResult]: Loop: 108#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 112#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 107#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 108#L17-4 [2019-11-25 08:45:26,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,923 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2019-11-25 08:45:26,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228323520] [2019-11-25 08:45:26,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:26,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228323520] [2019-11-25 08:45:26,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591165443] [2019-11-25 08:45:26,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:45:27,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:27,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:45:27,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-11-25 08:45:27,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263679334] [2019-11-25 08:45:27,021 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:45:27,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,022 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2019-11-25 08:45:27,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732794129] [2019-11-25 08:45:27,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:27,043 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:27,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:45:27,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:27,172 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-11-25 08:45:27,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,194 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-11-25 08:45:27,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:27,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-11-25 08:45:27,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:27,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-11-25 08:45:27,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-25 08:45:27,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-25 08:45:27,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-11-25 08:45:27,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:45:27,198 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-11-25 08:45:27,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-11-25 08:45:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-25 08:45:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-25 08:45:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-11-25 08:45:27,199 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-25 08:45:27,200 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-25 08:45:27,200 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:45:27,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-11-25 08:45:27,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:27,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:27,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:27,201 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2019-11-25 08:45:27,201 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:45:27,201 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 144#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 145#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 148#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 149#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 150#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 153#L13-3 assume !(main_~n~0 < 10); 147#L17-4 [2019-11-25 08:45:27,201 INFO L796 eck$LassoCheckResult]: Loop: 147#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 152#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 146#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 147#L17-4 [2019-11-25 08:45:27,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2019-11-25 08:45:27,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579478482] [2019-11-25 08:45:27,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:27,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579478482] [2019-11-25 08:45:27,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568760088] [2019-11-25 08:45:27,274 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:27,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:45:27,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:45:27,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:45:27,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:27,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:45:27,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-25 08:45:27,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312982547] [2019-11-25 08:45:27,329 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:45:27,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,329 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2019-11-25 08:45:27,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993873706] [2019-11-25 08:45:27,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:27,353 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:27,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:45:27,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:45:27,472 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-11-25 08:45:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,494 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-11-25 08:45:27,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:45:27,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-11-25 08:45:27,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:27,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2019-11-25 08:45:27,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-25 08:45:27,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-25 08:45:27,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2019-11-25 08:45:27,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:45:27,497 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-25 08:45:27,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2019-11-25 08:45:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-25 08:45:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-25 08:45:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-11-25 08:45:27,499 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-25 08:45:27,499 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-25 08:45:27,499 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:45:27,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2019-11-25 08:45:27,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:27,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:27,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:27,502 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2019-11-25 08:45:27,502 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:45:27,503 INFO L794 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 196#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 197#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 198#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 199#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 200#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 205#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 204#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 203#L13-3 assume !(main_~n~0 < 10); 195#L17-4 [2019-11-25 08:45:27,503 INFO L796 eck$LassoCheckResult]: Loop: 195#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 202#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 194#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 195#L17-4 [2019-11-25 08:45:27,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,503 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2019-11-25 08:45:27,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295221938] [2019-11-25 08:45:27,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:27,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295221938] [2019-11-25 08:45:27,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876282869] [2019-11-25 08:45:27,564 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:27,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-25 08:45:27,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:45:27,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:45:27,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:27,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:45:27,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-25 08:45:27,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577782394] [2019-11-25 08:45:27,618 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:45:27,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,618 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2019-11-25 08:45:27,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777336039] [2019-11-25 08:45:27,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:27,638 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:27,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:45:27,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:45:27,760 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-11-25 08:45:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,782 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-11-25 08:45:27,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:45:27,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-11-25 08:45:27,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:27,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2019-11-25 08:45:27,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-25 08:45:27,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-25 08:45:27,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2019-11-25 08:45:27,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:45:27,784 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-25 08:45:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2019-11-25 08:45:27,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-25 08:45:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-25 08:45:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-25 08:45:27,786 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-25 08:45:27,787 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-25 08:45:27,787 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:45:27,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-11-25 08:45:27,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:27,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:27,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:27,788 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2019-11-25 08:45:27,788 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:45:27,788 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 255#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 256#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 259#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 260#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 261#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 263#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 268#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 267#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 266#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 265#L13-3 assume !(main_~n~0 < 10); 258#L17-4 [2019-11-25 08:45:27,789 INFO L796 eck$LassoCheckResult]: Loop: 258#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 264#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 257#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 258#L17-4 [2019-11-25 08:45:27,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2019-11-25 08:45:27,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468415817] [2019-11-25 08:45:27,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:27,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468415817] [2019-11-25 08:45:27,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478160038] [2019-11-25 08:45:27,850 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:27,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-25 08:45:27,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:45:27,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:45:27,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:27,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:45:27,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-25 08:45:27,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694486143] [2019-11-25 08:45:27,913 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:45:27,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,913 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2019-11-25 08:45:27,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674108103] [2019-11-25 08:45:27,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:27,940 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:28,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:45:28,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:45:28,048 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 8 states. [2019-11-25 08:45:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,113 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-11-25 08:45:28,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:45:28,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-11-25 08:45:28,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:28,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2019-11-25 08:45:28,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-25 08:45:28,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-25 08:45:28,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-11-25 08:45:28,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:45:28,116 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-25 08:45:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-11-25 08:45:28,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-25 08:45:28,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-25 08:45:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-11-25 08:45:28,118 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-25 08:45:28,118 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-25 08:45:28,118 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-25 08:45:28,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2019-11-25 08:45:28,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:28,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:28,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:28,119 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2019-11-25 08:45:28,120 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:45:28,120 INFO L794 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 329#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 330#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 331#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 332#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 333#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 335#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 342#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 341#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 340#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 339#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 338#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 337#L13-3 assume !(main_~n~0 < 10); 328#L17-4 [2019-11-25 08:45:28,120 INFO L796 eck$LassoCheckResult]: Loop: 328#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 336#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 327#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 328#L17-4 [2019-11-25 08:45:28,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,120 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2019-11-25 08:45:28,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194637623] [2019-11-25 08:45:28,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:28,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194637623] [2019-11-25 08:45:28,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157827964] [2019-11-25 08:45:28,187 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:28,232 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-25 08:45:28,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:45:28,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:45:28,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:28,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:45:28,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-25 08:45:28,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150451514] [2019-11-25 08:45:28,253 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:45:28,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,255 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2019-11-25 08:45:28,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459100896] [2019-11-25 08:45:28,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:28,274 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:28,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:45:28,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:45:28,370 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. [2019-11-25 08:45:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,404 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-11-25 08:45:28,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:45:28,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2019-11-25 08:45:28,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:28,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2019-11-25 08:45:28,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-25 08:45:28,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-25 08:45:28,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2019-11-25 08:45:28,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:45:28,407 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-25 08:45:28,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2019-11-25 08:45:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-25 08:45:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-25 08:45:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-25 08:45:28,409 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-25 08:45:28,409 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-25 08:45:28,409 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-25 08:45:28,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-11-25 08:45:28,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:28,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:28,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:28,410 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2019-11-25 08:45:28,410 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:45:28,410 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 410#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 411#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 414#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 415#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 416#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 418#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 427#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 426#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 425#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 424#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 423#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 422#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 421#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 420#L13-3 assume !(main_~n~0 < 10); 413#L17-4 [2019-11-25 08:45:28,411 INFO L796 eck$LassoCheckResult]: Loop: 413#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 419#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 412#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 413#L17-4 [2019-11-25 08:45:28,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2019-11-25 08:45:28,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040200601] [2019-11-25 08:45:28,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:28,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040200601] [2019-11-25 08:45:28,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230931670] [2019-11-25 08:45:28,481 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:28,528 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-25 08:45:28,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:45:28,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:45:28,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:28,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:45:28,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-25 08:45:28,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851542026] [2019-11-25 08:45:28,545 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:45:28,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,546 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2019-11-25 08:45:28,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495526772] [2019-11-25 08:45:28,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:28,554 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:28,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:45:28,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:45:28,646 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 10 states. [2019-11-25 08:45:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,681 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-11-25 08:45:28,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:45:28,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2019-11-25 08:45:28,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:28,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2019-11-25 08:45:28,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-25 08:45:28,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-25 08:45:28,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2019-11-25 08:45:28,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:45:28,684 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-25 08:45:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2019-11-25 08:45:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-25 08:45:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-25 08:45:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-11-25 08:45:28,686 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-25 08:45:28,686 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-25 08:45:28,686 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-25 08:45:28,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2019-11-25 08:45:28,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:28,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:28,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:28,687 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2019-11-25 08:45:28,687 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:45:28,688 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 504#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 505#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 508#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 509#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 510#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 512#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 523#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 522#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 521#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 520#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 519#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 518#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 517#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 516#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 515#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 514#L13-3 assume !(main_~n~0 < 10); 507#L17-4 [2019-11-25 08:45:28,688 INFO L796 eck$LassoCheckResult]: Loop: 507#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 513#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 506#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 507#L17-4 [2019-11-25 08:45:28,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2019-11-25 08:45:28,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950013355] [2019-11-25 08:45:28,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:28,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950013355] [2019-11-25 08:45:28,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543962249] [2019-11-25 08:45:28,797 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:45:28,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:28,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:45:28,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-25 08:45:28,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625794886] [2019-11-25 08:45:28,850 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:45:28,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,850 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2019-11-25 08:45:28,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098289618] [2019-11-25 08:45:28,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:28,868 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:28,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 08:45:28,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:45:28,969 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 11 states. [2019-11-25 08:45:29,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,007 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-11-25 08:45:29,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:45:29,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2019-11-25 08:45:29,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:29,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2019-11-25 08:45:29,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-25 08:45:29,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-25 08:45:29,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2019-11-25 08:45:29,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:45:29,010 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-25 08:45:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2019-11-25 08:45:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-25 08:45:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-25 08:45:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-25 08:45:29,012 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-25 08:45:29,012 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-25 08:45:29,012 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-25 08:45:29,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2019-11-25 08:45:29,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:29,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:29,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:29,013 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2019-11-25 08:45:29,014 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:45:29,014 INFO L794 eck$LassoCheckResult]: Stem: 616#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 611#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 612#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 613#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 614#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 615#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 617#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 630#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 629#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 628#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 627#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 626#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 625#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 624#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 623#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 622#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 621#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 620#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 619#L13-3 assume !(main_~n~0 < 10); 610#L17-4 [2019-11-25 08:45:29,014 INFO L796 eck$LassoCheckResult]: Loop: 610#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 618#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 609#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 610#L17-4 [2019-11-25 08:45:29,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,014 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2019-11-25 08:45:29,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168154392] [2019-11-25 08:45:29,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:29,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168154392] [2019-11-25 08:45:29,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941603128] [2019-11-25 08:45:29,131 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:29,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:45:29,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:45:29,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:45:29,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:29,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:45:29,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-25 08:45:29,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026357963] [2019-11-25 08:45:29,194 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:45:29,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,195 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2019-11-25 08:45:29,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787649036] [2019-11-25 08:45:29,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:29,204 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:29,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:45:29,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:45:29,309 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 12 states. [2019-11-25 08:45:29,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,339 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-11-25 08:45:29,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:45:29,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2019-11-25 08:45:29,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:29,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2019-11-25 08:45:29,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-25 08:45:29,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-25 08:45:29,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2019-11-25 08:45:29,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:45:29,342 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-11-25 08:45:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2019-11-25 08:45:29,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-25 08:45:29,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-25 08:45:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-25 08:45:29,346 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-25 08:45:29,346 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-25 08:45:29,346 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-25 08:45:29,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2019-11-25 08:45:29,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:29,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:29,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:29,348 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2019-11-25 08:45:29,348 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:45:29,348 INFO L794 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 727#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 728#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 729#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 730#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 731#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 733#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 748#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 747#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 746#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 745#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 744#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 743#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 742#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 741#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 740#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 739#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 738#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 737#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 736#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 735#L13-3 assume !(main_~n~0 < 10); 726#L17-4 [2019-11-25 08:45:29,348 INFO L796 eck$LassoCheckResult]: Loop: 726#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 734#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 725#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 726#L17-4 [2019-11-25 08:45:29,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,348 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2019-11-25 08:45:29,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554702647] [2019-11-25 08:45:29,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,445 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:29,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554702647] [2019-11-25 08:45:29,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604388873] [2019-11-25 08:45:29,446 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:29,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-25 08:45:29,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:45:29,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:45:29,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:29,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:45:29,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-25 08:45:29,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737581721] [2019-11-25 08:45:29,562 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:45:29,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,563 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2019-11-25 08:45:29,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233993502] [2019-11-25 08:45:29,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:29,571 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:29,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:45:29,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:45:29,663 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2019-11-25 08:45:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,711 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-11-25 08:45:29,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:45:29,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-11-25 08:45:29,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:29,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2019-11-25 08:45:29,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-25 08:45:29,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-25 08:45:29,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2019-11-25 08:45:29,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:45:29,714 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-25 08:45:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2019-11-25 08:45:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-25 08:45:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-25 08:45:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-25 08:45:29,716 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-25 08:45:29,716 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-25 08:45:29,716 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-25 08:45:29,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2019-11-25 08:45:29,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:45:29,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:45:29,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:45:29,717 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2019-11-25 08:45:29,717 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:45:29,718 INFO L794 eck$LassoCheckResult]: Stem: 858#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 853#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 854#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 855#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 856#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 857#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 859#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 876#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 875#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 874#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 873#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 872#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 871#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 870#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 869#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 868#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 867#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 866#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 865#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 864#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 863#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 862#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 861#L13-3 assume !(main_~n~0 < 10); 852#L17-4 [2019-11-25 08:45:29,718 INFO L796 eck$LassoCheckResult]: Loop: 852#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 860#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 851#L17-2 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 852#L17-4 [2019-11-25 08:45:29,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,718 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2019-11-25 08:45:29,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840704117] [2019-11-25 08:45:29,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:29,743 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:29,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,743 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2019-11-25 08:45:29,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568923688] [2019-11-25 08:45:29,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:29,750 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:29,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,750 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2019-11-25 08:45:29,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694534122] [2019-11-25 08:45:29,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:29,786 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:32,294 WARN L192 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 212 DAG size of output: 148 [2019-11-25 08:45:32,498 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-25 08:45:32,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 08:45:32 BoogieIcfgContainer [2019-11-25 08:45:32,539 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-25 08:45:32,539 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:45:32,539 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:45:32,540 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:45:32,540 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25" (3/4) ... [2019-11-25 08:45:32,543 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-25 08:45:32,606 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ffd8e90d-e4d8-416f-a2e4-1e103c1f3194/bin/uautomizer/witness.graphml [2019-11-25 08:45:32,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:45:32,611 INFO L168 Benchmark]: Toolchain (without parser) took 8024.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 944.8 MB in the beginning and 845.4 MB in the end (delta: 99.4 MB). Peak memory consumption was 305.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:32,611 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:45:32,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:32,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:32,612 INFO L168 Benchmark]: Boogie Preprocessor took 30.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:45:32,613 INFO L168 Benchmark]: RCFGBuilder took 351.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:32,613 INFO L168 Benchmark]: BuchiAutomizer took 7242.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.7 MB). Free memory was 1.1 GB in the beginning and 848.1 MB in the end (delta: 244.0 MB). Peak memory consumption was 323.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:32,614 INFO L168 Benchmark]: Witness Printer took 69.95 ms. Allocated memory is still 1.2 GB. Free memory was 848.1 MB in the beginning and 845.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:32,617 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 351.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7242.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.7 MB). Free memory was 1.1 GB in the beginning and 848.1 MB in the end (delta: 244.0 MB). Peak memory consumption was 323.7 MB. Max. memory is 11.5 GB. * Witness Printer took 69.95 ms. Allocated memory is still 1.2 GB. Free memory was 848.1 MB in the beginning and 845.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (10 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * n + 19 and consists of 5 locations. 10 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 12 iterations. TraceHistogramMax:10. Analysis of lassos took 6.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 65 SDslu, 251 SDs, 0 SdLazy, 188 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital88 mio100 ax100 hnf100 lsp93 ukn59 mio100 lsp69 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@341ed57c=0, NULL=0, \result=0, NULL=1, n=10, i=4, a=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7bdf4b7e=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@55c9746b=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@782bc7ec=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b1afc70=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@77238f3e=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] a[i] = 0 [L19] i = __VERIFIER_nondet_int() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...