./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/nec11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/nec11.c -s /tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/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 32bit --witnessprinter.graph.data.programhash 956956519a5dd5945389347ef99ef2322ddc4acd ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-cad4683 [2019-11-15 21:44:57,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:44:57,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:44:57,277 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:44:57,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:44:57,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:44:57,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:44:57,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:44:57,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:44:57,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:44:57,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:44:57,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:44:57,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:44:57,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:44:57,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:44:57,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:44:57,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:44:57,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:44:57,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:44:57,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:44:57,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:44:57,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:44:57,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:44:57,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:44:57,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:44:57,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:44:57,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:44:57,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:44:57,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:44:57,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:44:57,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:44:57,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:44:57,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:44:57,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:44:57,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:44:57,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:44:57,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:44:57,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:44:57,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:44:57,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:44:57,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:44:57,338 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 21:44:57,367 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:44:57,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:44:57,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:44:57,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:44:57,369 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:44:57,370 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:44:57,370 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:44:57,370 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:44:57,370 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:44:57,371 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:44:57,371 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:44:57,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:44:57,371 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:44:57,371 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:44:57,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:44:57,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:44:57,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:44:57,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:44:57,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:44:57,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:44:57,373 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:44:57,373 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:44:57,373 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:44:57,374 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:44:57,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:44:57,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:44:57,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:44:57,374 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:44:57,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:44:57,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:44:57,375 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:44:57,376 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:44:57,376 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_62961f9a-a200-443c-a0e2-5f66816431e9/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 956956519a5dd5945389347ef99ef2322ddc4acd [2019-11-15 21:44:57,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:44:57,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:44:57,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:44:57,449 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:44:57,449 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:44:57,450 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/bin/uautomizer/../../sv-benchmarks/c/loops/nec11.c [2019-11-15 21:44:57,517 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/bin/uautomizer/data/fb74f73cc/8078dda3dcbb435da55fbacdf3f37abf/FLAG2f3379a9a [2019-11-15 21:44:57,888 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:44:57,889 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/sv-benchmarks/c/loops/nec11.c [2019-11-15 21:44:57,895 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/bin/uautomizer/data/fb74f73cc/8078dda3dcbb435da55fbacdf3f37abf/FLAG2f3379a9a [2019-11-15 21:44:58,307 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/bin/uautomizer/data/fb74f73cc/8078dda3dcbb435da55fbacdf3f37abf [2019-11-15 21:44:58,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:44:58,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:44:58,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:44:58,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:44:58,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:44:58,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:44:58" (1/1) ... [2019-11-15 21:44:58,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f2d2514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:58, skipping insertion in model container [2019-11-15 21:44:58,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:44:58" (1/1) ... [2019-11-15 21:44:58,325 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:44:58,340 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:44:58,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:44:58,613 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:44:58,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:44:58,649 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:44:58,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:58 WrapperNode [2019-11-15 21:44:58,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:44:58,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:44:58,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:44:58,653 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:44:58,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:58" (1/1) ... [2019-11-15 21:44:58,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:58" (1/1) ... [2019-11-15 21:44:58,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:44:58,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:44:58,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:44:58,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:44:58,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:58" (1/1) ... [2019-11-15 21:44:58,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:58" (1/1) ... [2019-11-15 21:44:58,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:58" (1/1) ... [2019-11-15 21:44:58,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:58" (1/1) ... [2019-11-15 21:44:58,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:58" (1/1) ... [2019-11-15 21:44:58,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:58" (1/1) ... [2019-11-15 21:44:58,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:58" (1/1) ... [2019-11-15 21:44:58,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:44:58,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:44:58,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:44:58,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:44:58,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/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-15 21:44:58,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:44:58,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:44:58,974 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:44:58,974 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:44:58,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:44:58 BoogieIcfgContainer [2019-11-15 21:44:58,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:44:58,976 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:44:58,976 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:44:58,980 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:44:58,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:44:58,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:44:58" (1/3) ... [2019-11-15 21:44:58,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3247e4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:44:58, skipping insertion in model container [2019-11-15 21:44:58,985 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:44:58,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:58" (2/3) ... [2019-11-15 21:44:58,986 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3247e4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:44:58, skipping insertion in model container [2019-11-15 21:44:58,986 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:44:58,986 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:44:58" (3/3) ... [2019-11-15 21:44:58,988 INFO L371 chiAutomizerObserver]: Analyzing ICFG nec11.c [2019-11-15 21:44:59,060 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:44:59,060 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:44:59,061 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:44:59,061 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:44:59,061 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:44:59,062 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:44:59,062 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:44:59,062 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:44:59,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 21:44:59,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:44:59,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:44:59,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:44:59,109 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:44:59,109 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:44:59,109 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:44:59,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 21:44:59,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:44:59,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:44:59,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:44:59,115 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:44:59,115 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:44:59,123 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 7#L19-2true [2019-11-15 21:44:59,124 INFO L793 eck$LassoCheckResult]: Loop: 7#L19-2true assume !!(0 != main_~c~0 % 256); 3#L21true assume 4 == main_~len~0;main_~len~0 := 0; 11#L21-2true assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 7#L19-2true [2019-11-15 21:44:59,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:59,130 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-15 21:44:59,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:59,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913659301] [2019-11-15 21:44:59,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:44:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:44:59,223 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:44:59,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:59,225 INFO L82 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2019-11-15 21:44:59,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:59,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487828151] [2019-11-15 21:44:59,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:44:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:44:59,250 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:44:59,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:59,252 INFO L82 PathProgramCache]: Analyzing trace with hash 963342, now seen corresponding path program 1 times [2019-11-15 21:44:59,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:59,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550710784] [2019-11-15 21:44:59,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:59,311 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-15 21:44:59,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550710784] [2019-11-15 21:44:59,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:59,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:44:59,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056143909] [2019-11-15 21:44:59,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:59,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:44:59,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:59,423 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-11-15 21:44:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:59,450 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-15 21:44:59,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:44:59,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2019-11-15 21:44:59,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:44:59,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 7 states and 8 transitions. [2019-11-15 21:44:59,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 21:44:59,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 21:44:59,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-11-15 21:44:59,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:44:59,461 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-15 21:44:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-11-15 21:44:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-11-15 21:44:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 21:44:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-11-15 21:44:59,504 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-15 21:44:59,504 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-15 21:44:59,504 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:44:59,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-11-15 21:44:59,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:44:59,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:44:59,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:44:59,505 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 21:44:59,506 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:44:59,506 INFO L791 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 46#L19-2 assume !!(0 != main_~c~0 % 256); 43#L21 assume !(4 == main_~len~0); 44#L21-2 [2019-11-15 21:44:59,506 INFO L793 eck$LassoCheckResult]: Loop: 44#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 47#L19-2 assume !!(0 != main_~c~0 % 256); 48#L21 assume 4 == main_~len~0;main_~len~0 := 0; 44#L21-2 [2019-11-15 21:44:59,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:59,507 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-11-15 21:44:59,507 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:59,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746695387] [2019-11-15 21:44:59,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:44:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:44:59,517 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:44:59,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:59,518 INFO L82 PathProgramCache]: Analyzing trace with hash 46451, now seen corresponding path program 2 times [2019-11-15 21:44:59,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:59,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791672172] [2019-11-15 21:44:59,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:44:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:44:59,531 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:44:59,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:59,531 INFO L82 PathProgramCache]: Analyzing trace with hash 925831567, now seen corresponding path program 1 times [2019-11-15 21:44:59,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:59,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51843370] [2019-11-15 21:44:59,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:44:59,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51843370] [2019-11-15 21:44:59,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455915426] [2019-11-15 21:44:59,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:44:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:59,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:44:59,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:44:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:44:59,637 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:44:59,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-11-15 21:44:59,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437896827] [2019-11-15 21:44:59,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:59,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:44:59,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:44:59,685 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-11-15 21:44:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:59,704 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-11-15 21:44:59,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:44:59,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-11-15 21:44:59,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 21:44:59,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-11-15 21:44:59,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 21:44:59,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 21:44:59,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-11-15 21:44:59,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:44:59,708 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-15 21:44:59,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-11-15 21:44:59,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-11-15 21:44:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 21:44:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-15 21:44:59,710 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-15 21:44:59,710 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-15 21:44:59,710 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:44:59,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-15 21:44:59,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 21:44:59,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:44:59,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:44:59,711 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 21:44:59,712 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2019-11-15 21:44:59,712 INFO L791 eck$LassoCheckResult]: Stem: 85#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 86#L19-2 assume !!(0 != main_~c~0 % 256); 91#L21 assume !(4 == main_~len~0); 88#L21-2 [2019-11-15 21:44:59,712 INFO L793 eck$LassoCheckResult]: Loop: 88#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 87#L19-2 assume !!(0 != main_~c~0 % 256); 83#L21 assume !(4 == main_~len~0); 84#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 90#L19-2 assume !!(0 != main_~c~0 % 256); 89#L21 assume 4 == main_~len~0;main_~len~0 := 0; 88#L21-2 [2019-11-15 21:44:59,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:59,712 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 2 times [2019-11-15 21:44:59,713 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:59,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292215428] [2019-11-15 21:44:59,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:44:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:44:59,726 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:44:59,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:59,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1383897983, now seen corresponding path program 1 times [2019-11-15 21:44:59,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:59,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892887793] [2019-11-15 21:44:59,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:44:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:44:59,745 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:44:59,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:59,746 INFO L82 PathProgramCache]: Analyzing trace with hash -831686173, now seen corresponding path program 2 times [2019-11-15 21:44:59,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:59,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885569934] [2019-11-15 21:44:59,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:59,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:44:59,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885569934] [2019-11-15 21:44:59,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599635668] [2019-11-15 21:44:59,800 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:44:59,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:44:59,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:44:59,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:44:59,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:44:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:44:59,847 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:44:59,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-15 21:44:59,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825319642] [2019-11-15 21:44:59,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:59,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:44:59,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:44:59,962 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-11-15 21:44:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:59,984 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-11-15 21:44:59,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:44:59,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-11-15 21:44:59,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 21:44:59,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-11-15 21:44:59,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 21:44:59,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 21:44:59,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-11-15 21:44:59,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:44:59,987 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-15 21:44:59,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-11-15 21:44:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-15 21:44:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 21:44:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-11-15 21:44:59,989 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-15 21:44:59,989 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-15 21:44:59,989 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:44:59,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-11-15 21:44:59,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 21:44:59,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:44:59,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:44:59,991 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 21:44:59,991 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2019-11-15 21:44:59,991 INFO L791 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 142#L19-2 assume !!(0 != main_~c~0 % 256); 150#L21 assume !(4 == main_~len~0); 145#L21-2 [2019-11-15 21:44:59,992 INFO L793 eck$LassoCheckResult]: Loop: 145#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 143#L19-2 assume !!(0 != main_~c~0 % 256); 144#L21 assume !(4 == main_~len~0); 148#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 149#L19-2 assume !!(0 != main_~c~0 % 256); 139#L21 assume !(4 == main_~len~0); 140#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 147#L19-2 assume !!(0 != main_~c~0 % 256); 146#L21 assume 4 == main_~len~0;main_~len~0 := 0; 145#L21-2 [2019-11-15 21:44:59,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:59,992 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-11-15 21:44:59,992 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:59,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284342810] [2019-11-15 21:44:59,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:59,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:45:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:45:00,006 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:45:00,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:00,007 INFO L82 PathProgramCache]: Analyzing trace with hash 313813491, now seen corresponding path program 2 times [2019-11-15 21:45:00,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:00,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079920428] [2019-11-15 21:45:00,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:00,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:00,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:45:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:45:00,049 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:45:00,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:00,057 INFO L82 PathProgramCache]: Analyzing trace with hash 903627023, now seen corresponding path program 3 times [2019-11-15 21:45:00,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:00,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053171028] [2019-11-15 21:45:00,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:00,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:00,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:45:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:00,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053171028] [2019-11-15 21:45:00,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887502912] [2019-11-15 21:45:00,123 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:45:00,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 21:45:00,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:45:00,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:45:00,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:45:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:45:00,185 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:45:00,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 21:45:00,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511834522] [2019-11-15 21:45:00,289 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-11-15 21:45:00,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:45:00,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:45:00,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:45:00,303 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-11-15 21:45:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:45:00,338 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-11-15 21:45:00,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:45:00,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2019-11-15 21:45:00,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-15 21:45:00,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2019-11-15 21:45:00,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 21:45:00,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 21:45:00,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2019-11-15 21:45:00,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:45:00,342 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-11-15 21:45:00,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2019-11-15 21:45:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-15 21:45:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 21:45:00,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-15 21:45:00,344 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-15 21:45:00,344 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-15 21:45:00,344 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:45:00,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-15 21:45:00,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-15 21:45:00,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:45:00,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:45:00,346 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 21:45:00,346 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2019-11-15 21:45:00,346 INFO L791 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 214#L19-2 assume !!(0 != main_~c~0 % 256); 211#L21 assume !(4 == main_~len~0); 212#L21-2 [2019-11-15 21:45:00,346 INFO L793 eck$LassoCheckResult]: Loop: 212#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 215#L19-2 assume !!(0 != main_~c~0 % 256); 225#L21 assume !(4 == main_~len~0); 224#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 223#L19-2 assume !!(0 != main_~c~0 % 256); 222#L21 assume !(4 == main_~len~0); 221#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 220#L19-2 assume !!(0 != main_~c~0 % 256); 219#L21 assume !(4 == main_~len~0); 217#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 218#L19-2 assume !!(0 != main_~c~0 % 256); 216#L21 assume 4 == main_~len~0;main_~len~0 := 0; 212#L21-2 [2019-11-15 21:45:00,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:00,346 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 4 times [2019-11-15 21:45:00,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:00,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475341631] [2019-11-15 21:45:00,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:00,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:00,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:45:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:45:00,377 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:45:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:00,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1326016769, now seen corresponding path program 3 times [2019-11-15 21:45:00,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:00,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003565258] [2019-11-15 21:45:00,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:00,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:00,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:45:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:45:00,406 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:45:00,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:45:00,409 INFO L82 PathProgramCache]: Analyzing trace with hash -902292893, now seen corresponding path program 4 times [2019-11-15 21:45:00,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:45:00,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140041585] [2019-11-15 21:45:00,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:00,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:45:00,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:45:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:45:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:45:00,450 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:45:00,602 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-11-15 21:45:00,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:45:00 BoogieIcfgContainer [2019-11-15 21:45:00,709 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:45:00,709 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:45:00,709 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:45:00,710 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:45:00,710 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:44:58" (3/4) ... [2019-11-15 21:45:00,714 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 21:45:00,791 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_62961f9a-a200-443c-a0e2-5f66816431e9/bin/uautomizer/witness.graphml [2019-11-15 21:45:00,791 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:45:00,793 INFO L168 Benchmark]: Toolchain (without parser) took 2481.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 946.1 MB in the beginning and 974.7 MB in the end (delta: -28.6 MB). Peak memory consumption was 97.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:45:00,794 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-15 21:45:00,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:45:00,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.39 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-15 21:45:00,800 INFO L168 Benchmark]: Boogie Preprocessor took 22.92 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-15 21:45:00,800 INFO L168 Benchmark]: RCFGBuilder took 263.61 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:45:00,801 INFO L168 Benchmark]: BuchiAutomizer took 1732.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 974.7 MB in the end (delta: 128.1 MB). Peak memory consumption was 128.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:45:00,801 INFO L168 Benchmark]: Witness Printer took 82.02 ms. Allocated memory is still 1.2 GB. Free memory is still 974.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:45:00,803 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 340.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.39 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. * Boogie Preprocessor took 22.92 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 263.61 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1732.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 974.7 MB in the end (delta: 128.1 MB). Peak memory consumption was 128.1 MB. Max. memory is 11.5 GB. * Witness Printer took 82.02 ms. Allocated memory is still 1.2 GB. Free memory is still 974.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 5 iterations. TraceHistogramMax:4. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 18 SDtfs, 17 SDslu, 16 SDs, 0 SdLazy, 30 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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: 19]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {len=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ded61dd=0, \result=0, c=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@1825b36c=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L13] int a[5]; [L14] int len=0; [L15] _Bool c=__VERIFIER_nondet_bool(); [L16] int i; [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) Loop: [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND TRUE len==4 [L22] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...