./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_8.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_4053ec1a-8d2b-49a2-8538-584c0619568c/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_4053ec1a-8d2b-49a2-8538-584c0619568c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4053ec1a-8d2b-49a2-8538-584c0619568c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4053ec1a-8d2b-49a2-8538-584c0619568c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_8.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4053ec1a-8d2b-49a2-8538-584c0619568c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4053ec1a-8d2b-49a2-8538-584c0619568c/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 37d0ed05d77a0379c9ed98058bf2f327252773ce .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-28 03:16:51,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:16:51,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:16:51,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:16:51,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:16:51,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:16:51,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:16:51,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:16:51,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:16:51,228 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:16:51,229 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:16:51,231 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:16:51,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:16:51,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:16:51,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:16:51,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:16:51,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:16:51,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:16:51,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:16:51,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:16:51,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:16:51,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:16:51,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:16:51,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:16:51,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:16:51,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:16:51,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:16:51,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:16:51,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:16:51,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:16:51,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:16:51,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:16:51,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:16:51,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:16:51,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:16:51,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:16:51,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:16:51,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:16:51,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:16:51,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:16:51,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:16:51,277 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4053ec1a-8d2b-49a2-8538-584c0619568c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-28 03:16:51,307 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:16:51,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:16:51,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:16:51,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:16:51,311 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:16:51,311 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 03:16:51,312 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 03:16:51,312 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 03:16:51,313 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 03:16:51,313 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 03:16:51,314 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 03:16:51,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:16:51,315 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:16:51,315 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 03:16:51,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:16:51,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:16:51,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:16:51,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 03:16:51,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 03:16:51,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 03:16:51,319 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:16:51,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:16:51,320 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 03:16:51,320 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:16:51,321 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 03:16:51,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:16:51,322 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:16:51,322 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 03:16:51,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:16:51,323 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:16:51,323 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:16:51,323 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 03:16:51,325 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 03:16:51,325 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_4053ec1a-8d2b-49a2-8538-584c0619568c/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_4053ec1a-8d2b-49a2-8538-584c0619568c/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 -> 37d0ed05d77a0379c9ed98058bf2f327252773ce [2020-11-28 03:16:51,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:16:51,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:16:51,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:16:51,663 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:16:51,664 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:16:51,666 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4053ec1a-8d2b-49a2-8538-584c0619568c/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_8.c [2020-11-28 03:16:51,746 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4053ec1a-8d2b-49a2-8538-584c0619568c/bin/uautomizer/data/8c899cd5e/b8c19c3559e7482d9ecf6f27585d296a/FLAG1e31e98ad [2020-11-28 03:16:52,368 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:16:52,369 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4053ec1a-8d2b-49a2-8538-584c0619568c/sv-benchmarks/c/locks/test_locks_8.c [2020-11-28 03:16:52,384 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4053ec1a-8d2b-49a2-8538-584c0619568c/bin/uautomizer/data/8c899cd5e/b8c19c3559e7482d9ecf6f27585d296a/FLAG1e31e98ad [2020-11-28 03:16:52,708 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4053ec1a-8d2b-49a2-8538-584c0619568c/bin/uautomizer/data/8c899cd5e/b8c19c3559e7482d9ecf6f27585d296a [2020-11-28 03:16:52,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:16:52,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:16:52,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:16:52,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:16:52,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:16:52,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:16:52" (1/1) ... [2020-11-28 03:16:52,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da072e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:52, skipping insertion in model container [2020-11-28 03:16:52,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:16:52" (1/1) ... [2020-11-28 03:16:52,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:16:52,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:16:52,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:16:53,007 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:16:53,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:16:53,099 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:16:53,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:53 WrapperNode [2020-11-28 03:16:53,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:16:53,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:16:53,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:16:53,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:16:53,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:53" (1/1) ... [2020-11-28 03:16:53,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:53" (1/1) ... [2020-11-28 03:16:53,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:16:53,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:16:53,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:16:53,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:16:53,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:53" (1/1) ... [2020-11-28 03:16:53,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:53" (1/1) ... [2020-11-28 03:16:53,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:53" (1/1) ... [2020-11-28 03:16:53,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:53" (1/1) ... [2020-11-28 03:16:53,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:53" (1/1) ... [2020-11-28 03:16:53,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:53" (1/1) ... [2020-11-28 03:16:53,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:53" (1/1) ... [2020-11-28 03:16:53,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:16:53,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:16:53,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:16:53,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:16:53,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4053ec1a-8d2b-49a2-8538-584c0619568c/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-28 03:16:53,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:16:53,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:16:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:16:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:16:53,837 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:16:53,837 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-11-28 03:16:53,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:53 BoogieIcfgContainer [2020-11-28 03:16:53,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:16:53,841 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 03:16:53,841 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 03:16:53,845 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 03:16:53,846 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:16:53,846 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:16:52" (1/3) ... [2020-11-28 03:16:53,848 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16072d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:16:53, skipping insertion in model container [2020-11-28 03:16:53,848 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:16:53,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:53" (2/3) ... [2020-11-28 03:16:53,849 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16072d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:16:53, skipping insertion in model container [2020-11-28 03:16:53,849 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:16:53,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:53" (3/3) ... [2020-11-28 03:16:53,851 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2020-11-28 03:16:53,909 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 03:16:53,909 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 03:16:53,909 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 03:16:53,910 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:16:53,910 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:16:53,910 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 03:16:53,910 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:16:53,910 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 03:16:53,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2020-11-28 03:16:53,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-11-28 03:16:53,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:53,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:53,960 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:16:53,961 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:53,961 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 03:16:53,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2020-11-28 03:16:53,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-11-28 03:16:53,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:53,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:53,977 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:16:53,978 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:53,987 INFO L794 eck$LassoCheckResult]: Stem: 32#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); 11#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_#t~nondet14, main_#t~nondet15, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 28#L127-1true [2020-11-28 03:16:53,988 INFO L796 eck$LassoCheckResult]: Loop: 28#L127-1true assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 22#L37true 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 3#L58true assume 0 != main_~p1~0;main_~lk1~0 := 1; 17#L58-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 8#L62-1true assume !(0 != main_~p3~0); 35#L66-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 23#L70-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 29#L74-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 16#L78-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 6#L82-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 31#L86-1true assume !(0 != main_~p1~0); 24#L92-1true assume !(0 != main_~p2~0); 33#L97-1true assume !(0 != main_~p3~0); 5#L102-1true assume !(0 != main_~p4~0); 12#L107-1true assume !(0 != main_~p5~0); 21#L112-1true assume !(0 != main_~p6~0); 10#L117-1true assume !(0 != main_~p7~0); 20#L122-1true assume !(0 != main_~p8~0); 28#L127-1true [2020-11-28 03:16:53,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:53,998 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-28 03:16:54,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:54,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540538127] [2020-11-28 03:16:54,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:54,115 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:54,142 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:54,169 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:54,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:54,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1098697512, now seen corresponding path program 1 times [2020-11-28 03:16:54,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:54,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261393693] [2020-11-28 03:16:54,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:54,290 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-28 03:16:54,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261393693] [2020-11-28 03:16:54,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:54,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:16:54,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968794551] [2020-11-28 03:16:54,304 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:54,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:54,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:16:54,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:16:54,331 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-11-28 03:16:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:54,411 INFO L93 Difference]: Finished difference Result 63 states and 106 transitions. [2020-11-28 03:16:54,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:16:54,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 106 transitions. [2020-11-28 03:16:54,421 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2020-11-28 03:16:54,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 53 states and 83 transitions. [2020-11-28 03:16:54,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2020-11-28 03:16:54,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2020-11-28 03:16:54,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. [2020-11-28 03:16:54,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:54,439 INFO L691 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2020-11-28 03:16:54,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. [2020-11-28 03:16:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-11-28 03:16:54,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-28 03:16:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2020-11-28 03:16:54,495 INFO L714 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2020-11-28 03:16:54,495 INFO L594 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2020-11-28 03:16:54,495 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 03:16:54,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2020-11-28 03:16:54,504 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2020-11-28 03:16:54,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:54,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:54,507 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:16:54,508 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:54,508 INFO L794 eck$LassoCheckResult]: Stem: 141#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); 122#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_#t~nondet14, main_#t~nondet15, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 123#L127-1 [2020-11-28 03:16:54,508 INFO L796 eck$LassoCheckResult]: Loop: 123#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 148#L37 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 147#L58 assume !(0 != main_~p1~0); 129#L58-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 115#L62-1 assume !(0 != main_~p3~0); 116#L66-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 134#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 135#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 128#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 111#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 112#L86-1 assume !(0 != main_~p1~0); 142#L92-1 assume !(0 != main_~p2~0); 156#L97-1 assume !(0 != main_~p3~0); 155#L102-1 assume !(0 != main_~p4~0); 153#L107-1 assume !(0 != main_~p5~0); 132#L112-1 assume !(0 != main_~p6~0); 125#L117-1 assume !(0 != main_~p7~0); 130#L122-1 assume !(0 != main_~p8~0); 123#L127-1 [2020-11-28 03:16:54,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:54,513 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-11-28 03:16:54,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:54,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991242440] [2020-11-28 03:16:54,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:54,551 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:54,582 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:54,642 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:54,660 INFO L82 PathProgramCache]: Analyzing trace with hash 77629158, now seen corresponding path program 1 times [2020-11-28 03:16:54,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:54,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841240265] [2020-11-28 03:16:54,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:54,777 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-28 03:16:54,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841240265] [2020-11-28 03:16:54,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:54,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:16:54,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336883226] [2020-11-28 03:16:54,779 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:54,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:54,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:16:54,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:16:54,785 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand 3 states. [2020-11-28 03:16:54,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:54,835 INFO L93 Difference]: Finished difference Result 102 states and 158 transitions. [2020-11-28 03:16:54,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:16:54,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 158 transitions. [2020-11-28 03:16:54,842 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2020-11-28 03:16:54,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 158 transitions. [2020-11-28 03:16:54,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2020-11-28 03:16:54,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2020-11-28 03:16:54,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 158 transitions. [2020-11-28 03:16:54,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:54,846 INFO L691 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2020-11-28 03:16:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 158 transitions. [2020-11-28 03:16:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-11-28 03:16:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-11-28 03:16:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2020-11-28 03:16:54,868 INFO L714 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2020-11-28 03:16:54,868 INFO L594 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2020-11-28 03:16:54,869 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 03:16:54,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. [2020-11-28 03:16:54,874 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2020-11-28 03:16:54,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:54,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:54,876 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:16:54,877 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:54,877 INFO L794 eck$LassoCheckResult]: Stem: 305#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); 283#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_#t~nondet14, main_#t~nondet15, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 284#L127-1 [2020-11-28 03:16:54,877 INFO L796 eck$LassoCheckResult]: Loop: 284#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 324#L37 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 323#L58 assume !(0 != main_~p1~0); 322#L58-2 assume !(0 != main_~p2~0); 276#L62-1 assume !(0 != main_~p3~0); 277#L66-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 296#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 297#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 289#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 290#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 309#L86-1 assume !(0 != main_~p1~0); 310#L92-1 assume !(0 != main_~p2~0); 306#L97-1 assume !(0 != main_~p3~0); 269#L102-1 assume !(0 != main_~p4~0); 271#L107-1 assume !(0 != main_~p5~0); 275#L112-1 assume !(0 != main_~p6~0); 286#L117-1 assume !(0 != main_~p7~0); 360#L122-1 assume !(0 != main_~p8~0); 284#L127-1 [2020-11-28 03:16:54,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:54,880 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-11-28 03:16:54,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:54,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30646406] [2020-11-28 03:16:54,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:54,919 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:54,936 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:54,948 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:54,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:54,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1202234520, now seen corresponding path program 1 times [2020-11-28 03:16:54,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:54,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313121857] [2020-11-28 03:16:54,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:55,005 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-28 03:16:55,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313121857] [2020-11-28 03:16:55,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:55,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:16:55,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742834833] [2020-11-28 03:16:55,007 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:55,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:55,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:16:55,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:16:55,008 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. cyclomatic complexity: 60 Second operand 3 states. [2020-11-28 03:16:55,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:55,044 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2020-11-28 03:16:55,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:16:55,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 302 transitions. [2020-11-28 03:16:55,050 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2020-11-28 03:16:55,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 302 transitions. [2020-11-28 03:16:55,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2020-11-28 03:16:55,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2020-11-28 03:16:55,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 302 transitions. [2020-11-28 03:16:55,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:55,066 INFO L691 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2020-11-28 03:16:55,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 302 transitions. [2020-11-28 03:16:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2020-11-28 03:16:55,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-11-28 03:16:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 302 transitions. [2020-11-28 03:16:55,089 INFO L714 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2020-11-28 03:16:55,090 INFO L594 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2020-11-28 03:16:55,090 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 03:16:55,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 302 transitions. [2020-11-28 03:16:55,093 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2020-11-28 03:16:55,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:55,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:55,094 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:16:55,094 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:55,095 INFO L794 eck$LassoCheckResult]: Stem: 609#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); 588#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_#t~nondet14, main_#t~nondet15, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 589#L127-1 [2020-11-28 03:16:55,095 INFO L796 eck$LassoCheckResult]: Loop: 589#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 674#L37 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 648#L58 assume !(0 != main_~p1~0); 633#L58-2 assume !(0 != main_~p2~0); 624#L62-1 assume !(0 != main_~p3~0); 625#L66-1 assume !(0 != main_~p4~0); 719#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 746#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 744#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 742#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 738#L86-1 assume !(0 != main_~p1~0); 739#L92-1 assume !(0 != main_~p2~0); 694#L97-1 assume !(0 != main_~p3~0); 691#L102-1 assume !(0 != main_~p4~0); 688#L107-1 assume !(0 != main_~p5~0); 685#L112-1 assume !(0 != main_~p6~0); 684#L117-1 assume !(0 != main_~p7~0); 680#L122-1 assume !(0 != main_~p8~0); 589#L127-1 [2020-11-28 03:16:55,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:55,104 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-11-28 03:16:55,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:55,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59133892] [2020-11-28 03:16:55,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:55,131 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:55,146 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:55,155 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:55,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:55,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1789040534, now seen corresponding path program 1 times [2020-11-28 03:16:55,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:55,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077973351] [2020-11-28 03:16:55,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:55,212 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-28 03:16:55,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077973351] [2020-11-28 03:16:55,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:55,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:16:55,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633338977] [2020-11-28 03:16:55,214 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:55,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:55,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:16:55,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:16:55,215 INFO L87 Difference]: Start difference. First operand 198 states and 302 transitions. cyclomatic complexity: 112 Second operand 3 states. [2020-11-28 03:16:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:55,262 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2020-11-28 03:16:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:16:55,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 578 transitions. [2020-11-28 03:16:55,269 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2020-11-28 03:16:55,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 578 transitions. [2020-11-28 03:16:55,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2020-11-28 03:16:55,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2020-11-28 03:16:55,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 578 transitions. [2020-11-28 03:16:55,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:55,294 INFO L691 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2020-11-28 03:16:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 578 transitions. [2020-11-28 03:16:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2020-11-28 03:16:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-11-28 03:16:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2020-11-28 03:16:55,339 INFO L714 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2020-11-28 03:16:55,339 INFO L594 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2020-11-28 03:16:55,339 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-28 03:16:55,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 578 transitions. [2020-11-28 03:16:55,344 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2020-11-28 03:16:55,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:55,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:55,346 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:16:55,347 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:55,352 INFO L794 eck$LassoCheckResult]: Stem: 1199#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); 1178#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_#t~nondet14, main_#t~nondet15, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 1179#L127-1 [2020-11-28 03:16:55,352 INFO L796 eck$LassoCheckResult]: Loop: 1179#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 1254#L37 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 1249#L58 assume !(0 != main_~p1~0); 1250#L58-2 assume !(0 != main_~p2~0); 1309#L62-1 assume !(0 != main_~p3~0); 1306#L66-1 assume !(0 != main_~p4~0); 1301#L70-1 assume !(0 != main_~p5~0); 1296#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1292#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1288#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1283#L86-1 assume !(0 != main_~p1~0); 1282#L92-1 assume !(0 != main_~p2~0); 1278#L97-1 assume !(0 != main_~p3~0); 1274#L102-1 assume !(0 != main_~p4~0); 1270#L107-1 assume !(0 != main_~p5~0); 1266#L112-1 assume !(0 != main_~p6~0); 1263#L117-1 assume !(0 != main_~p7~0); 1259#L122-1 assume !(0 != main_~p8~0); 1179#L127-1 [2020-11-28 03:16:55,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:55,353 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-11-28 03:16:55,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:55,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13810762] [2020-11-28 03:16:55,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:55,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:55,375 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:55,380 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:55,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:55,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1530875096, now seen corresponding path program 1 times [2020-11-28 03:16:55,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:55,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370853500] [2020-11-28 03:16:55,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:55,404 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-28 03:16:55,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370853500] [2020-11-28 03:16:55,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:55,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:16:55,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556073018] [2020-11-28 03:16:55,405 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:55,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:55,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:16:55,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:16:55,407 INFO L87 Difference]: Start difference. First operand 386 states and 578 transitions. cyclomatic complexity: 208 Second operand 3 states. [2020-11-28 03:16:55,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:55,443 INFO L93 Difference]: Finished difference Result 754 states and 1106 transitions. [2020-11-28 03:16:55,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:16:55,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1106 transitions. [2020-11-28 03:16:55,457 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2020-11-28 03:16:55,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 754 states and 1106 transitions. [2020-11-28 03:16:55,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 754 [2020-11-28 03:16:55,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 754 [2020-11-28 03:16:55,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 754 states and 1106 transitions. [2020-11-28 03:16:55,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:55,470 INFO L691 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2020-11-28 03:16:55,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states and 1106 transitions. [2020-11-28 03:16:55,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2020-11-28 03:16:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2020-11-28 03:16:55,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1106 transitions. [2020-11-28 03:16:55,502 INFO L714 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2020-11-28 03:16:55,503 INFO L594 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2020-11-28 03:16:55,503 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-28 03:16:55,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 1106 transitions. [2020-11-28 03:16:55,512 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2020-11-28 03:16:55,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:55,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:55,514 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:16:55,515 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:55,515 INFO L794 eck$LassoCheckResult]: Stem: 2348#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); 2324#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_#t~nondet14, main_#t~nondet15, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 2325#L127-1 [2020-11-28 03:16:55,516 INFO L796 eck$LassoCheckResult]: Loop: 2325#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 2718#L37 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 2381#L58 assume !(0 != main_~p1~0); 2365#L58-2 assume !(0 != main_~p2~0); 2366#L62-1 assume !(0 != main_~p3~0); 2557#L66-1 assume !(0 != main_~p4~0); 2669#L70-1 assume !(0 != main_~p5~0); 2668#L74-1 assume !(0 != main_~p6~0); 2664#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2663#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2662#L86-1 assume !(0 != main_~p1~0); 2660#L92-1 assume !(0 != main_~p2~0); 2653#L97-1 assume !(0 != main_~p3~0); 2648#L102-1 assume !(0 != main_~p4~0); 2645#L107-1 assume !(0 != main_~p5~0); 2646#L112-1 assume !(0 != main_~p6~0); 2728#L117-1 assume !(0 != main_~p7~0); 2723#L122-1 assume !(0 != main_~p8~0); 2325#L127-1 [2020-11-28 03:16:55,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:55,517 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-11-28 03:16:55,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:55,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297739183] [2020-11-28 03:16:55,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:55,543 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:55,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:55,556 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:55,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:55,557 INFO L82 PathProgramCache]: Analyzing trace with hash -829810518, now seen corresponding path program 1 times [2020-11-28 03:16:55,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:55,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885741928] [2020-11-28 03:16:55,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:55,584 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-28 03:16:55,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885741928] [2020-11-28 03:16:55,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:55,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:16:55,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323658531] [2020-11-28 03:16:55,585 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:55,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:55,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:16:55,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:16:55,587 INFO L87 Difference]: Start difference. First operand 754 states and 1106 transitions. cyclomatic complexity: 384 Second operand 3 states. [2020-11-28 03:16:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:55,649 INFO L93 Difference]: Finished difference Result 1474 states and 2114 transitions. [2020-11-28 03:16:55,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:16:55,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 2114 transitions. [2020-11-28 03:16:55,671 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2020-11-28 03:16:55,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1474 states and 2114 transitions. [2020-11-28 03:16:55,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2020-11-28 03:16:55,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2020-11-28 03:16:55,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 2114 transitions. [2020-11-28 03:16:55,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:55,695 INFO L691 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2020-11-28 03:16:55,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 2114 transitions. [2020-11-28 03:16:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2020-11-28 03:16:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2020-11-28 03:16:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2114 transitions. [2020-11-28 03:16:55,739 INFO L714 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2020-11-28 03:16:55,739 INFO L594 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2020-11-28 03:16:55,739 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-28 03:16:55,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1474 states and 2114 transitions. [2020-11-28 03:16:55,753 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2020-11-28 03:16:55,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:55,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:55,754 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:16:55,754 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:55,754 INFO L794 eck$LassoCheckResult]: Stem: 4579#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); 4557#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_#t~nondet14, main_#t~nondet15, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 4558#L127-1 [2020-11-28 03:16:55,755 INFO L796 eck$LassoCheckResult]: Loop: 4558#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 4645#L37 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 4638#L58 assume !(0 != main_~p1~0); 4630#L58-2 assume !(0 != main_~p2~0); 4625#L62-1 assume !(0 != main_~p3~0); 4618#L66-1 assume !(0 != main_~p4~0); 4615#L70-1 assume !(0 != main_~p5~0); 4604#L74-1 assume !(0 != main_~p6~0); 4605#L78-1 assume !(0 != main_~p7~0); 4712#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4706#L86-1 assume !(0 != main_~p1~0); 4699#L92-1 assume !(0 != main_~p2~0); 4687#L97-1 assume !(0 != main_~p3~0); 4683#L102-1 assume !(0 != main_~p4~0); 4676#L107-1 assume !(0 != main_~p5~0); 4674#L112-1 assume !(0 != main_~p6~0); 4670#L117-1 assume !(0 != main_~p7~0); 4669#L122-1 assume !(0 != main_~p8~0); 4558#L127-1 [2020-11-28 03:16:55,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:55,755 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-11-28 03:16:55,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:55,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143306964] [2020-11-28 03:16:55,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:55,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:55,773 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:55,777 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:55,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:55,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1222837528, now seen corresponding path program 1 times [2020-11-28 03:16:55,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:55,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925511243] [2020-11-28 03:16:55,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:55,803 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-28 03:16:55,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925511243] [2020-11-28 03:16:55,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:55,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:16:55,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351327749] [2020-11-28 03:16:55,804 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:55,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:55,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:16:55,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:16:55,806 INFO L87 Difference]: Start difference. First operand 1474 states and 2114 transitions. cyclomatic complexity: 704 Second operand 3 states. [2020-11-28 03:16:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:55,882 INFO L93 Difference]: Finished difference Result 2882 states and 4034 transitions. [2020-11-28 03:16:55,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:16:55,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4034 transitions. [2020-11-28 03:16:55,922 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2020-11-28 03:16:55,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4034 transitions. [2020-11-28 03:16:55,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2020-11-28 03:16:55,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2020-11-28 03:16:55,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4034 transitions. [2020-11-28 03:16:55,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:55,968 INFO L691 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2020-11-28 03:16:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4034 transitions. [2020-11-28 03:16:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2020-11-28 03:16:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2882 states. [2020-11-28 03:16:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4034 transitions. [2020-11-28 03:16:56,078 INFO L714 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2020-11-28 03:16:56,078 INFO L594 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2020-11-28 03:16:56,079 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-28 03:16:56,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4034 transitions. [2020-11-28 03:16:56,109 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2020-11-28 03:16:56,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:56,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:56,110 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:16:56,110 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:56,111 INFO L794 eck$LassoCheckResult]: Stem: 8940#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); 8919#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_#t~nondet14, main_#t~nondet15, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 8920#L127-1 [2020-11-28 03:16:56,111 INFO L796 eck$LassoCheckResult]: Loop: 8920#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 9016#L37 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 9011#L58 assume !(0 != main_~p1~0); 9003#L58-2 assume !(0 != main_~p2~0); 8996#L62-1 assume !(0 != main_~p3~0); 8991#L66-1 assume !(0 != main_~p4~0); 8983#L70-1 assume !(0 != main_~p5~0); 8984#L74-1 assume !(0 != main_~p6~0); 9065#L78-1 assume !(0 != main_~p7~0); 9061#L82-1 assume !(0 != main_~p8~0); 9057#L86-1 assume !(0 != main_~p1~0); 9053#L92-1 assume !(0 != main_~p2~0); 9049#L97-1 assume !(0 != main_~p3~0); 9045#L102-1 assume !(0 != main_~p4~0); 9043#L107-1 assume !(0 != main_~p5~0); 9036#L112-1 assume !(0 != main_~p6~0); 9031#L117-1 assume !(0 != main_~p7~0); 9026#L122-1 assume !(0 != main_~p8~0); 8920#L127-1 [2020-11-28 03:16:56,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-11-28 03:16:56,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:56,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885815212] [2020-11-28 03:16:56,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:56,123 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:56,141 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:56,152 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:56,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:56,157 INFO L82 PathProgramCache]: Analyzing trace with hash -542779158, now seen corresponding path program 1 times [2020-11-28 03:16:56,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:56,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878831703] [2020-11-28 03:16:56,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:56,167 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:56,174 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:56,185 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:56,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:56,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1175900116, now seen corresponding path program 1 times [2020-11-28 03:16:56,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:56,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696728970] [2020-11-28 03:16:56,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:56,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:56,224 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:56,238 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:56,834 WARN L193 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2020-11-28 03:16:57,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:16:57 BoogieIcfgContainer [2020-11-28 03:16:57,009 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-28 03:16:57,010 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:16:57,010 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:16:57,010 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:16:57,011 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:53" (3/4) ... [2020-11-28 03:16:57,015 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-28 03:16:57,118 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4053ec1a-8d2b-49a2-8538-584c0619568c/bin/uautomizer/witness.graphml [2020-11-28 03:16:57,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:16:57,122 INFO L168 Benchmark]: Toolchain (without parser) took 4402.99 ms. Allocated memory was 86.0 MB in the beginning and 151.0 MB in the end (delta: 65.0 MB). Free memory was 56.7 MB in the beginning and 92.1 MB in the end (delta: -35.4 MB). Peak memory consumption was 29.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:57,124 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 86.0 MB. Free memory was 42.9 MB in the beginning and 42.8 MB in the end (delta: 75.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:16:57,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.03 ms. Allocated memory was 86.0 MB in the beginning and 113.2 MB in the end (delta: 27.3 MB). Free memory was 56.5 MB in the beginning and 90.6 MB in the end (delta: -34.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:57,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.08 ms. Allocated memory is still 113.2 MB. Free memory was 90.1 MB in the beginning and 89.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:57,127 INFO L168 Benchmark]: Boogie Preprocessor took 29.58 ms. Allocated memory is still 113.2 MB. Free memory was 89.0 MB in the beginning and 87.8 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:16:57,128 INFO L168 Benchmark]: RCFGBuilder took 647.13 ms. Allocated memory is still 113.2 MB. Free memory was 87.8 MB in the beginning and 70.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:57,131 INFO L168 Benchmark]: BuchiAutomizer took 3168.46 ms. Allocated memory was 113.2 MB in the beginning and 151.0 MB in the end (delta: 37.7 MB). Free memory was 70.3 MB in the beginning and 94.1 MB in the end (delta: -23.9 MB). Peak memory consumption was 44.8 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:57,132 INFO L168 Benchmark]: Witness Printer took 108.63 ms. Allocated memory is still 151.0 MB. Free memory was 94.1 MB in the beginning and 92.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:57,135 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.33 ms. Allocated memory is still 86.0 MB. Free memory was 42.9 MB in the beginning and 42.8 MB in the end (delta: 75.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 380.03 ms. Allocated memory was 86.0 MB in the beginning and 113.2 MB in the end (delta: 27.3 MB). Free memory was 56.5 MB in the beginning and 90.6 MB in the end (delta: -34.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.08 ms. Allocated memory is still 113.2 MB. Free memory was 90.1 MB in the beginning and 89.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.58 ms. Allocated memory is still 113.2 MB. Free memory was 89.0 MB in the beginning and 87.8 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 647.13 ms. Allocated memory is still 113.2 MB. Free memory was 87.8 MB in the beginning and 70.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 3168.46 ms. Allocated memory was 113.2 MB in the beginning and 151.0 MB in the end (delta: 37.7 MB). Free memory was 70.3 MB in the beginning and 94.1 MB in the end (delta: -23.9 MB). Peak memory consumption was 44.8 MB. Max. memory is 16.1 GB. * Witness Printer took 108.63 ms. Allocated memory is still 151.0 MB. Free memory was 94.1 MB in the beginning and 92.1 MB in the end (delta: 2.0 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 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2882 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 2882 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 459 SDtfs, 236 SDslu, 277 SDs, 0 SdLazy, 35 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI7 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: 35]: 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=3, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=1, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8259093=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@270dbc51=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c114b0f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62e88b96=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46ed3e50=0, cond=11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@cc8ede8=0, NULL=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a57864d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c4502aa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5375bccc=11, NULL=0, NULL=0, NULL=0, NULL=4, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0, lk7=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: 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; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...