./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_08741bed-5536-4eac-938e-1781641f8734/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_08741bed-5536-4eac-938e-1781641f8734/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_08741bed-5536-4eac-938e-1781641f8734/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_08741bed-5536-4eac-938e-1781641f8734/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_6.c -s /tmp/vcloud-vcloud-master/worker/run_dir_08741bed-5536-4eac-938e-1781641f8734/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_08741bed-5536-4eac-938e-1781641f8734/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 8a6bc1adbcafb13db44c5d4b4826990150e2f336 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.2.0-a4ecdab [2020-11-30 01:01:15,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:01:15,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:01:15,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:01:15,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:01:15,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:01:15,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:01:15,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:01:15,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:01:15,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:01:15,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:01:15,315 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:01:15,315 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:01:15,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:01:15,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:01:15,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:01:15,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:01:15,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:01:15,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:01:15,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:01:15,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:01:15,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:01:15,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:01:15,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:01:15,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:01:15,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:01:15,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:01:15,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:01:15,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:01:15,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:01:15,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:01:15,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:01:15,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:01:15,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:01:15,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:01:15,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:01:15,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:01:15,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:01:15,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:01:15,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:01:15,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:01:15,370 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_08741bed-5536-4eac-938e-1781641f8734/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-30 01:01:15,394 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:01:15,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:01:15,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:01:15,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:01:15,396 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:01:15,396 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-30 01:01:15,397 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-30 01:01:15,397 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-30 01:01:15,397 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-30 01:01:15,397 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-30 01:01:15,397 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-30 01:01:15,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:01:15,398 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:01:15,398 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 01:01:15,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:01:15,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:01:15,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:01:15,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-30 01:01:15,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-30 01:01:15,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-30 01:01:15,399 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:01:15,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:01:15,400 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-30 01:01:15,400 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:01:15,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-30 01:01:15,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:01:15,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:01:15,401 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-30 01:01:15,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:01:15,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:01:15,402 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:01:15,402 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-30 01:01:15,403 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-30 01:01:15,403 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_08741bed-5536-4eac-938e-1781641f8734/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_08741bed-5536-4eac-938e-1781641f8734/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 -> 8a6bc1adbcafb13db44c5d4b4826990150e2f336 [2020-11-30 01:01:15,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:01:15,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:01:15,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:01:15,749 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:01:15,750 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:01:15,751 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_08741bed-5536-4eac-938e-1781641f8734/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_6.c [2020-11-30 01:01:15,830 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_08741bed-5536-4eac-938e-1781641f8734/bin/uautomizer/data/3c47e78e0/23a3ec5ad7dd48d3afbc0dbbe6cc812f/FLAGae0a0fe46 [2020-11-30 01:01:16,398 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:01:16,399 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_08741bed-5536-4eac-938e-1781641f8734/sv-benchmarks/c/locks/test_locks_6.c [2020-11-30 01:01:16,409 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_08741bed-5536-4eac-938e-1781641f8734/bin/uautomizer/data/3c47e78e0/23a3ec5ad7dd48d3afbc0dbbe6cc812f/FLAGae0a0fe46 [2020-11-30 01:01:16,779 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_08741bed-5536-4eac-938e-1781641f8734/bin/uautomizer/data/3c47e78e0/23a3ec5ad7dd48d3afbc0dbbe6cc812f [2020-11-30 01:01:16,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:01:16,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:01:16,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:01:16,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:01:16,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:01:16,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:01:16" (1/1) ... [2020-11-30 01:01:16,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df7d1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:01:16, skipping insertion in model container [2020-11-30 01:01:16,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:01:16" (1/1) ... [2020-11-30 01:01:16,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:01:16,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:01:16,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:01:17,005 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:01:17,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:01:17,072 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:01:17,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:01:17 WrapperNode [2020-11-30 01:01:17,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:01:17,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:01:17,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:01:17,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:01:17,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:01:17" (1/1) ... [2020-11-30 01:01:17,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:01:17" (1/1) ... [2020-11-30 01:01:17,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:01:17,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:01:17,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:01:17,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:01:17,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:01:17" (1/1) ... [2020-11-30 01:01:17,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:01:17" (1/1) ... [2020-11-30 01:01:17,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:01:17" (1/1) ... [2020-11-30 01:01:17,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:01:17" (1/1) ... [2020-11-30 01:01:17,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:01:17" (1/1) ... [2020-11-30 01:01:17,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:01:17" (1/1) ... [2020-11-30 01:01:17,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:01:17" (1/1) ... [2020-11-30 01:01:17,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:01:17,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:01:17,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:01:17,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:01:17,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:01:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08741bed-5536-4eac-938e-1781641f8734/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 [2020-11-30 01:01:17,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:01:17,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:01:17,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:01:17,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:01:17,525 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:01:17,525 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-11-30 01:01:17,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:01:17 BoogieIcfgContainer [2020-11-30 01:01:17,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:01:17,535 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-30 01:01:17,535 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-30 01:01:17,539 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-30 01:01:17,540 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 01:01:17,541 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 30.11 01:01:16" (1/3) ... [2020-11-30 01:01:17,543 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3977e612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 01:01:17, skipping insertion in model container [2020-11-30 01:01:17,543 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 01:01:17,543 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:01:17" (2/3) ... [2020-11-30 01:01:17,544 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3977e612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 01:01:17, skipping insertion in model container [2020-11-30 01:01:17,544 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 01:01:17,544 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:01:17" (3/3) ... [2020-11-30 01:01:17,545 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_6.c [2020-11-30 01:01:17,638 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-30 01:01:17,639 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-30 01:01:17,639 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-30 01:01:17,639 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:01:17,639 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:01:17,639 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-30 01:01:17,639 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:01:17,639 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-30 01:01:17,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-11-30 01:01:17,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-11-30 01:01:17,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:01:17,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:01:17,679 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 01:01:17,679 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:01:17,679 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-30 01:01:17,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-11-30 01:01:17,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-11-30 01:01:17,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:01:17,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:01:17,683 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 01:01:17,684 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:01:17,690 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 6#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 27#L99-1true [2020-11-30 01:01:17,691 INFO L796 eck$LassoCheckResult]: Loop: 27#L99-1true assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 21#L31true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 16#L48true assume 0 != main_~p1~0;main_~lk1~0 := 1; 29#L48-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 18#L52-1true assume !(0 != main_~p3~0); 9#L56-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 4#L60-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 22#L64-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 28#L68-1true assume !(0 != main_~p1~0); 20#L74-1true assume !(0 != main_~p2~0); 30#L79-1true assume !(0 != main_~p3~0); 5#L84-1true assume !(0 != main_~p4~0); 10#L89-1true assume !(0 != main_~p5~0); 17#L94-1true assume !(0 != main_~p6~0); 27#L99-1true [2020-11-30 01:01:17,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:01:17,697 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-30 01:01:17,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:01:17,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497155373] [2020-11-30 01:01:17,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:01:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:01:17,810 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:01:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:01:17,830 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:01:17,852 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:01:17,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:01:17,854 INFO L82 PathProgramCache]: Analyzing trace with hash -11500681, now seen corresponding path program 1 times [2020-11-30 01:01:17,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:01:17,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92370887] [2020-11-30 01:01:17,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:01:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:17,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92370887] [2020-11-30 01:01:17,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:01:17,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:01:17,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074002612] [2020-11-30 01:01:17,964 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 01:01:17,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:01:17,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:01:17,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:01:17,991 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2020-11-30 01:01:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:01:18,090 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2020-11-30 01:01:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:01:18,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 82 transitions. [2020-11-30 01:01:18,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2020-11-30 01:01:18,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 41 states and 63 transitions. [2020-11-30 01:01:18,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-11-30 01:01:18,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-11-30 01:01:18,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 63 transitions. [2020-11-30 01:01:18,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:01:18,110 INFO L691 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2020-11-30 01:01:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 63 transitions. [2020-11-30 01:01:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-11-30 01:01:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-30 01:01:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2020-11-30 01:01:18,151 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2020-11-30 01:01:18,151 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2020-11-30 01:01:18,152 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-30 01:01:18,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 63 transitions. [2020-11-30 01:01:18,160 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2020-11-30 01:01:18,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:01:18,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:01:18,162 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 01:01:18,162 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:01:18,163 INFO L794 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 106#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 97#L99-1 [2020-11-30 01:01:18,163 INFO L796 eck$LassoCheckResult]: Loop: 97#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 104#L31 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 105#L48 assume !(0 != main_~p1~0); 115#L48-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 100#L52-1 assume !(0 != main_~p3~0); 101#L56-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 117#L60-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 107#L64-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 108#L68-1 assume !(0 != main_~p1~0); 116#L74-1 assume !(0 != main_~p2~0); 127#L79-1 assume !(0 != main_~p3~0); 125#L84-1 assume !(0 != main_~p4~0); 113#L89-1 assume !(0 != main_~p5~0); 96#L94-1 assume !(0 != main_~p6~0); 97#L99-1 [2020-11-30 01:01:18,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:01:18,166 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-11-30 01:01:18,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:01:18,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199727662] [2020-11-30 01:01:18,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:01:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:01:18,200 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:01:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:01:18,229 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:01:18,243 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:01:18,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:01:18,245 INFO L82 PathProgramCache]: Analyzing trace with hash 246664757, now seen corresponding path program 1 times [2020-11-30 01:01:18,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:01:18,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147166518] [2020-11-30 01:01:18,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:01:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:18,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147166518] [2020-11-30 01:01:18,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:01:18,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:01:18,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862389185] [2020-11-30 01:01:18,289 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 01:01:18,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:01:18,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:01:18,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:01:18,291 INFO L87 Difference]: Start difference. First operand 41 states and 63 transitions. cyclomatic complexity: 24 Second operand 3 states. [2020-11-30 01:01:18,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:01:18,324 INFO L93 Difference]: Finished difference Result 78 states and 118 transitions. [2020-11-30 01:01:18,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:01:18,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 118 transitions. [2020-11-30 01:01:18,327 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2020-11-30 01:01:18,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 118 transitions. [2020-11-30 01:01:18,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2020-11-30 01:01:18,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2020-11-30 01:01:18,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 118 transitions. [2020-11-30 01:01:18,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:01:18,331 INFO L691 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2020-11-30 01:01:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 118 transitions. [2020-11-30 01:01:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-11-30 01:01:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-30 01:01:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2020-11-30 01:01:18,368 INFO L714 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2020-11-30 01:01:18,368 INFO L594 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2020-11-30 01:01:18,369 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-30 01:01:18,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 118 transitions. [2020-11-30 01:01:18,371 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2020-11-30 01:01:18,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:01:18,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:01:18,376 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 01:01:18,376 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:01:18,377 INFO L794 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 229#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 230#L99-1 [2020-11-30 01:01:18,377 INFO L796 eck$LassoCheckResult]: Loop: 230#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 253#L31 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 250#L48 assume !(0 != main_~p1~0); 248#L48-2 assume !(0 != main_~p2~0); 249#L52-1 assume !(0 != main_~p3~0); 239#L56-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 240#L60-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 232#L64-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 233#L68-1 assume !(0 != main_~p1~0); 270#L74-1 assume !(0 != main_~p2~0); 267#L79-1 assume !(0 != main_~p3~0); 265#L84-1 assume !(0 != main_~p4~0); 261#L89-1 assume !(0 != main_~p5~0); 257#L94-1 assume !(0 != main_~p6~0); 230#L99-1 [2020-11-30 01:01:18,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:01:18,378 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-11-30 01:01:18,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:01:18,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011192217] [2020-11-30 01:01:18,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:01:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:01:18,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:01:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:01:18,429 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:01:18,433 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:01:18,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:01:18,436 INFO L82 PathProgramCache]: Analyzing trace with hash 947729335, now seen corresponding path program 1 times [2020-11-30 01:01:18,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:01:18,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281710628] [2020-11-30 01:01:18,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:01:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:18,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281710628] [2020-11-30 01:01:18,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:01:18,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:01:18,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894628528] [2020-11-30 01:01:18,484 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 01:01:18,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:01:18,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:01:18,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:01:18,485 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. cyclomatic complexity: 44 Second operand 3 states. [2020-11-30 01:01:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:01:18,520 INFO L93 Difference]: Finished difference Result 150 states and 222 transitions. [2020-11-30 01:01:18,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:01:18,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 222 transitions. [2020-11-30 01:01:18,525 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2020-11-30 01:01:18,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 222 transitions. [2020-11-30 01:01:18,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2020-11-30 01:01:18,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2020-11-30 01:01:18,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 222 transitions. [2020-11-30 01:01:18,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:01:18,540 INFO L691 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2020-11-30 01:01:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 222 transitions. [2020-11-30 01:01:18,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2020-11-30 01:01:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-11-30 01:01:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2020-11-30 01:01:18,566 INFO L714 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2020-11-30 01:01:18,567 INFO L594 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2020-11-30 01:01:18,567 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-30 01:01:18,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 222 transitions. [2020-11-30 01:01:18,571 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2020-11-30 01:01:18,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:01:18,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:01:18,574 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 01:01:18,575 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:01:18,577 INFO L794 eck$LassoCheckResult]: Stem: 471#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 463#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 464#L99-1 [2020-11-30 01:01:18,577 INFO L796 eck$LassoCheckResult]: Loop: 464#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 510#L31 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 508#L48 assume !(0 != main_~p1~0); 504#L48-2 assume !(0 != main_~p2~0); 502#L52-1 assume !(0 != main_~p3~0); 499#L56-1 assume !(0 != main_~p4~0); 497#L60-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 495#L64-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 492#L68-1 assume !(0 != main_~p1~0); 493#L74-1 assume !(0 != main_~p2~0); 526#L79-1 assume !(0 != main_~p3~0); 521#L84-1 assume !(0 != main_~p4~0); 518#L89-1 assume !(0 != main_~p5~0); 514#L94-1 assume !(0 != main_~p6~0); 464#L99-1 [2020-11-30 01:01:18,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:01:18,578 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-11-30 01:01:18,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:01:18,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642914403] [2020-11-30 01:01:18,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:01:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:01:18,595 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:01:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:01:18,617 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:01:18,624 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:01:18,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:01:18,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1627787705, now seen corresponding path program 1 times [2020-11-30 01:01:18,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:01:18,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910372245] [2020-11-30 01:01:18,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:01:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:18,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910372245] [2020-11-30 01:01:18,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:01:18,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:01:18,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281058814] [2020-11-30 01:01:18,663 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 01:01:18,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:01:18,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:01:18,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:01:18,665 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. cyclomatic complexity: 80 Second operand 3 states. [2020-11-30 01:01:18,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:01:18,702 INFO L93 Difference]: Finished difference Result 290 states and 418 transitions. [2020-11-30 01:01:18,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:01:18,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 418 transitions. [2020-11-30 01:01:18,706 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2020-11-30 01:01:18,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 290 states and 418 transitions. [2020-11-30 01:01:18,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2020-11-30 01:01:18,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2020-11-30 01:01:18,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 418 transitions. [2020-11-30 01:01:18,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:01:18,725 INFO L691 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2020-11-30 01:01:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 418 transitions. [2020-11-30 01:01:18,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2020-11-30 01:01:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-11-30 01:01:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 418 transitions. [2020-11-30 01:01:18,769 INFO L714 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2020-11-30 01:01:18,769 INFO L594 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2020-11-30 01:01:18,770 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-30 01:01:18,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 418 transitions. [2020-11-30 01:01:18,772 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2020-11-30 01:01:18,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:01:18,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:01:18,773 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 01:01:18,773 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:01:18,773 INFO L794 eck$LassoCheckResult]: Stem: 917#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 908#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 909#L99-1 [2020-11-30 01:01:18,773 INFO L796 eck$LassoCheckResult]: Loop: 909#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 1046#L31 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 1044#L48 assume !(0 != main_~p1~0); 1037#L48-2 assume !(0 != main_~p2~0); 1039#L52-1 assume !(0 != main_~p3~0); 1024#L56-1 assume !(0 != main_~p4~0); 1026#L60-1 assume !(0 != main_~p5~0); 1013#L64-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1014#L68-1 assume !(0 != main_~p1~0); 1058#L74-1 assume !(0 != main_~p2~0); 1057#L79-1 assume !(0 != main_~p3~0); 1054#L84-1 assume !(0 != main_~p4~0); 1052#L89-1 assume !(0 != main_~p5~0); 1051#L94-1 assume !(0 != main_~p6~0); 909#L99-1 [2020-11-30 01:01:18,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:01:18,774 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-11-30 01:01:18,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:01:18,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473557147] [2020-11-30 01:01:18,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:01:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:01:18,784 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:01:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:01:18,790 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:01:18,794 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:01:18,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:01:18,795 INFO L82 PathProgramCache]: Analyzing trace with hash 818441079, now seen corresponding path program 1 times [2020-11-30 01:01:18,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:01:18,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148347868] [2020-11-30 01:01:18,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:01:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:18,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148347868] [2020-11-30 01:01:18,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:01:18,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:01:18,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058023693] [2020-11-30 01:01:18,811 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 01:01:18,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:01:18,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:01:18,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:01:18,812 INFO L87 Difference]: Start difference. First operand 290 states and 418 transitions. cyclomatic complexity: 144 Second operand 3 states. [2020-11-30 01:01:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:01:18,832 INFO L93 Difference]: Finished difference Result 562 states and 786 transitions. [2020-11-30 01:01:18,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:01:18,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 562 states and 786 transitions. [2020-11-30 01:01:18,837 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2020-11-30 01:01:18,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 562 states to 562 states and 786 transitions. [2020-11-30 01:01:18,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 562 [2020-11-30 01:01:18,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 562 [2020-11-30 01:01:18,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 562 states and 786 transitions. [2020-11-30 01:01:18,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:01:18,852 INFO L691 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2020-11-30 01:01:18,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states and 786 transitions. [2020-11-30 01:01:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-11-30 01:01:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-11-30 01:01:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 786 transitions. [2020-11-30 01:01:18,903 INFO L714 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2020-11-30 01:01:18,903 INFO L594 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2020-11-30 01:01:18,904 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-30 01:01:18,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 562 states and 786 transitions. [2020-11-30 01:01:18,909 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2020-11-30 01:01:18,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:01:18,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:01:18,910 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-30 01:01:18,910 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:01:18,910 INFO L794 eck$LassoCheckResult]: Stem: 1773#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1766#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;havoc main_~cond~0; 1767#L99-1 [2020-11-30 01:01:18,910 INFO L796 eck$LassoCheckResult]: Loop: 1767#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 1923#L31 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 1919#L48 assume !(0 != main_~p1~0); 1917#L48-2 assume !(0 != main_~p2~0); 1913#L52-1 assume !(0 != main_~p3~0); 1908#L56-1 assume !(0 != main_~p4~0); 1909#L60-1 assume !(0 != main_~p5~0); 1939#L64-1 assume !(0 != main_~p6~0); 1936#L68-1 assume !(0 != main_~p1~0); 1934#L74-1 assume !(0 != main_~p2~0); 1933#L79-1 assume !(0 != main_~p3~0); 1840#L84-1 assume !(0 != main_~p4~0); 1842#L89-1 assume !(0 != main_~p5~0); 1927#L94-1 assume !(0 != main_~p6~0); 1767#L99-1 [2020-11-30 01:01:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:01:18,912 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-11-30 01:01:18,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:01:18,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134676156] [2020-11-30 01:01:18,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:01:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:01:18,944 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:01:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:01:18,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:01:18,956 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:01:18,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:01:18,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1701518855, now seen corresponding path program 1 times [2020-11-30 01:01:18,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:01:18,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245267749] [2020-11-30 01:01:18,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:01:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:01:18,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:01:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:01:18,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:01:18,986 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:01:18,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:01:18,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1159342651, now seen corresponding path program 1 times [2020-11-30 01:01:18,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:01:18,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50864944] [2020-11-30 01:01:18,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:01:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:01:19,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:01:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:01:19,033 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:01:19,038 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:01:19,488 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2020-11-30 01:01:19,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 30.11 01:01:19 BoogieIcfgContainer [2020-11-30 01:01:19,631 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-30 01:01:19,632 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:01:19,632 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:01:19,632 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:01:19,633 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:01:17" (3/4) ... [2020-11-30 01:01:19,636 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-30 01:01:19,696 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_08741bed-5536-4eac-938e-1781641f8734/bin/uautomizer/witness.graphml [2020-11-30 01:01:19,696 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:01:19,698 INFO L168 Benchmark]: Toolchain (without parser) took 2912.95 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 49.1 MB in the beginning and 56.8 MB in the end (delta: -7.7 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:01:19,698 INFO L168 Benchmark]: CDTParser took 0.88 ms. Allocated memory is still 83.9 MB. Free memory is still 65.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:01:19,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.10 ms. Allocated memory is still 83.9 MB. Free memory was 48.9 MB in the beginning and 62.0 MB in the end (delta: -13.1 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:01:19,704 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.71 ms. Allocated memory is still 83.9 MB. Free memory was 62.0 MB in the beginning and 60.3 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:01:19,708 INFO L168 Benchmark]: Boogie Preprocessor took 25.17 ms. Allocated memory is still 83.9 MB. Free memory was 60.3 MB in the beginning and 59.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:01:19,709 INFO L168 Benchmark]: RCFGBuilder took 392.31 ms. Allocated memory is still 83.9 MB. Free memory was 59.3 MB in the beginning and 44.1 MB in the end (delta: 15.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-30 01:01:19,710 INFO L168 Benchmark]: BuchiAutomizer took 2096.32 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 43.8 MB in the beginning and 58.9 MB in the end (delta: -15.0 MB). Peak memory consumption was 19.7 MB. Max. memory is 16.1 GB. [2020-11-30 01:01:19,711 INFO L168 Benchmark]: Witness Printer took 64.62 ms. Allocated memory is still 100.7 MB. Free memory was 58.9 MB in the beginning and 56.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:01:19,714 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.88 ms. Allocated memory is still 83.9 MB. Free memory is still 65.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 287.10 ms. Allocated memory is still 83.9 MB. Free memory was 48.9 MB in the beginning and 62.0 MB in the end (delta: -13.1 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 33.71 ms. Allocated memory is still 83.9 MB. Free memory was 62.0 MB in the beginning and 60.3 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.17 ms. Allocated memory is still 83.9 MB. Free memory was 60.3 MB in the beginning and 59.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 392.31 ms. Allocated memory is still 83.9 MB. Free memory was 59.3 MB in the beginning and 44.1 MB in the end (delta: 15.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2096.32 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 43.8 MB in the beginning and 58.9 MB in the end (delta: -15.0 MB). Peak memory consumption was 19.7 MB. Max. memory is 16.1 GB. * Witness Printer took 64.62 ms. Allocated memory is still 100.7 MB. Free memory was 58.9 MB in the beginning and 56.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 562 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 562 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 256 SDtfs, 130 SDslu, 149 SDs, 0 SdLazy, 25 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT0 conc0 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: 29]: 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 {NULL=2, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=1, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@329d173d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27ad412a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58d50f44=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5fef2b17=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@591eb28=0, cond=14, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48f84ea1=0, NULL=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3827c7d5=14, NULL=0, NULL=0, NULL=0, NULL=4, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L27] int cond; Loop: [L29] COND TRUE 1 [L30] cond = __VERIFIER_nondet_int() [L31] COND FALSE !(cond == 0) [L34] lk1 = 0 [L36] lk2 = 0 [L38] lk3 = 0 [L40] lk4 = 0 [L42] lk5 = 0 [L44] lk6 = 0 [L48] COND FALSE !(p1 != 0) [L52] COND FALSE !(p2 != 0) [L56] COND FALSE !(p3 != 0) [L60] COND FALSE !(p4 != 0) [L64] COND FALSE !(p5 != 0) [L68] COND FALSE !(p6 != 0) [L74] COND FALSE !(p1 != 0) [L79] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L89] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L99] COND FALSE !(p6 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...