./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_12.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_d4f96cdb-2525-4e14-b318-3f6414ab7918/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_d4f96cdb-2525-4e14-b318-3f6414ab7918/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d4f96cdb-2525-4e14-b318-3f6414ab7918/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d4f96cdb-2525-4e14-b318-3f6414ab7918/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_12.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d4f96cdb-2525-4e14-b318-3f6414ab7918/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d4f96cdb-2525-4e14-b318-3f6414ab7918/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 fbb7e06bf350f46f725ea0ddc5d1215829061b3a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-29 21:06:11,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 21:06:11,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 21:06:11,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 21:06:11,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 21:06:11,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 21:06:11,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 21:06:11,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 21:06:11,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 21:06:11,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 21:06:11,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 21:06:11,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 21:06:11,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 21:06:11,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 21:06:11,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 21:06:11,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 21:06:11,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 21:06:11,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 21:06:11,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 21:06:11,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 21:06:11,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 21:06:11,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 21:06:11,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 21:06:11,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 21:06:11,268 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 21:06:11,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 21:06:11,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 21:06:11,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 21:06:11,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 21:06:11,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 21:06:11,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 21:06:11,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 21:06:11,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 21:06:11,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 21:06:11,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 21:06:11,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 21:06:11,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 21:06:11,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 21:06:11,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 21:06:11,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 21:06:11,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 21:06:11,288 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d4f96cdb-2525-4e14-b318-3f6414ab7918/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-29 21:06:11,340 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 21:06:11,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 21:06:11,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 21:06:11,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 21:06:11,343 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 21:06:11,343 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 21:06:11,343 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 21:06:11,344 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 21:06:11,344 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 21:06:11,344 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 21:06:11,345 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 21:06:11,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 21:06:11,346 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 21:06:11,346 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 21:06:11,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 21:06:11,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 21:06:11,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 21:06:11,347 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 21:06:11,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 21:06:11,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 21:06:11,348 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 21:06:11,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 21:06:11,349 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 21:06:11,349 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 21:06:11,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 21:06:11,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 21:06:11,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 21:06:11,350 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 21:06:11,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 21:06:11,352 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 21:06:11,352 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 21:06:11,352 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 21:06:11,354 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 21:06:11,354 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_d4f96cdb-2525-4e14-b318-3f6414ab7918/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_d4f96cdb-2525-4e14-b318-3f6414ab7918/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 -> fbb7e06bf350f46f725ea0ddc5d1215829061b3a [2020-11-29 21:06:11,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 21:06:11,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 21:06:11,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 21:06:11,729 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 21:06:11,729 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 21:06:11,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d4f96cdb-2525-4e14-b318-3f6414ab7918/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_12.c [2020-11-29 21:06:11,851 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d4f96cdb-2525-4e14-b318-3f6414ab7918/bin/uautomizer/data/dc30e29af/06fcd9e5cdca493b8205c99f7e3dcacf/FLAGc103d870e [2020-11-29 21:06:12,431 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 21:06:12,432 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d4f96cdb-2525-4e14-b318-3f6414ab7918/sv-benchmarks/c/locks/test_locks_12.c [2020-11-29 21:06:12,441 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d4f96cdb-2525-4e14-b318-3f6414ab7918/bin/uautomizer/data/dc30e29af/06fcd9e5cdca493b8205c99f7e3dcacf/FLAGc103d870e [2020-11-29 21:06:12,808 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d4f96cdb-2525-4e14-b318-3f6414ab7918/bin/uautomizer/data/dc30e29af/06fcd9e5cdca493b8205c99f7e3dcacf [2020-11-29 21:06:12,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 21:06:12,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 21:06:12,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 21:06:12,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 21:06:12,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 21:06:12,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:06:12" (1/1) ... [2020-11-29 21:06:12,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d6a072c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:06:12, skipping insertion in model container [2020-11-29 21:06:12,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:06:12" (1/1) ... [2020-11-29 21:06:12,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 21:06:12,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 21:06:13,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 21:06:13,106 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 21:06:13,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 21:06:13,158 INFO L208 MainTranslator]: Completed translation [2020-11-29 21:06:13,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:06:13 WrapperNode [2020-11-29 21:06:13,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 21:06:13,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 21:06:13,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 21:06:13,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 21:06:13,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:06:13" (1/1) ... [2020-11-29 21:06:13,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:06:13" (1/1) ... [2020-11-29 21:06:13,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 21:06:13,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 21:06:13,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 21:06:13,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 21:06:13,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:06:13" (1/1) ... [2020-11-29 21:06:13,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:06:13" (1/1) ... [2020-11-29 21:06:13,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:06:13" (1/1) ... [2020-11-29 21:06:13,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:06:13" (1/1) ... [2020-11-29 21:06:13,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:06:13" (1/1) ... [2020-11-29 21:06:13,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:06:13" (1/1) ... [2020-11-29 21:06:13,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:06:13" (1/1) ... [2020-11-29 21:06:13,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 21:06:13,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 21:06:13,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 21:06:13,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 21:06:13,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:06:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4f96cdb-2525-4e14-b318-3f6414ab7918/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-29 21:06:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 21:06:13,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 21:06:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 21:06:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 21:06:13,982 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 21:06:13,983 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-11-29 21:06:13,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:06:13 BoogieIcfgContainer [2020-11-29 21:06:13,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 21:06:13,986 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 21:06:13,986 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 21:06:13,989 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 21:06:13,990 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 21:06:13,990 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 09:06:12" (1/3) ... [2020-11-29 21:06:13,992 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b8c82a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 09:06:13, skipping insertion in model container [2020-11-29 21:06:13,992 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 21:06:13,992 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:06:13" (2/3) ... [2020-11-29 21:06:13,992 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b8c82a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 09:06:13, skipping insertion in model container [2020-11-29 21:06:13,993 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 21:06:13,993 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:06:13" (3/3) ... [2020-11-29 21:06:13,994 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_12.c [2020-11-29 21:06:14,043 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 21:06:14,043 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 21:06:14,043 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 21:06:14,043 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 21:06:14,043 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 21:06:14,044 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 21:06:14,044 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 21:06:14,044 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 21:06:14,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-11-29 21:06:14,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2020-11-29 21:06:14,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 21:06:14,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 21:06:14,089 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 21:06:14,089 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:06:14,089 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 21:06:14,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-11-29 21:06:14,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2020-11-29 21:06:14,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 21:06:14,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 21:06:14,095 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 21:06:14,095 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:06:14,102 INFO L794 eck$LassoCheckResult]: Stem: 40#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(16);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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 43#L183-1true [2020-11-29 21:06:14,103 INFO L796 eck$LassoCheckResult]: Loop: 43#L183-1true assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 5#L49true 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 24#L78true assume 0 != main_~p1~0;main_~lk1~0 := 1; 16#L78-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 6#L82-1true assume !(0 != main_~p3~0); 39#L86-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 48#L90-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 33#L94-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 14#L98-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 3#L102-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 10#L106-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 45#L110-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 30#L114-1true assume !(0 != main_~p11~0); 12#L118-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 25#L122-1true assume !(0 != main_~p1~0); 37#L128-1true assume !(0 != main_~p2~0); 26#L133-1true assume !(0 != main_~p3~0); 35#L138-1true assume !(0 != main_~p4~0); 46#L143-1true assume !(0 != main_~p5~0); 8#L148-1true assume !(0 != main_~p6~0); 20#L153-1true assume !(0 != main_~p7~0); 34#L158-1true assume !(0 != main_~p8~0); 44#L163-1true assume !(0 != main_~p9~0); 7#L168-1true assume !(0 != main_~p10~0); 17#L173-1true assume !(0 != main_~p11~0); 31#L178-1true assume !(0 != main_~p12~0); 43#L183-1true [2020-11-29 21:06:14,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:14,111 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-29 21:06:14,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:14,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507192022] [2020-11-29 21:06:14,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:14,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:14,259 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:14,284 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 21:06:14,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:14,286 INFO L82 PathProgramCache]: Analyzing trace with hash -819199544, now seen corresponding path program 1 times [2020-11-29 21:06:14,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:14,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014809402] [2020-11-29 21:06:14,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:06:14,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-29 21:06:14,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014809402] [2020-11-29 21:06:14,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:06:14,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 21:06:14,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52209676] [2020-11-29 21:06:14,415 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 21:06:14,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:06:14,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 21:06:14,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 21:06:14,440 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-11-29 21:06:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:06:14,498 INFO L93 Difference]: Finished difference Result 87 states and 154 transitions. [2020-11-29 21:06:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 21:06:14,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 154 transitions. [2020-11-29 21:06:14,507 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2020-11-29 21:06:14,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 77 states and 123 transitions. [2020-11-29 21:06:14,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2020-11-29 21:06:14,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2020-11-29 21:06:14,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 123 transitions. [2020-11-29 21:06:14,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 21:06:14,517 INFO L691 BuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2020-11-29 21:06:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 123 transitions. [2020-11-29 21:06:14,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-11-29 21:06:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-29 21:06:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions. [2020-11-29 21:06:14,557 INFO L714 BuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2020-11-29 21:06:14,558 INFO L594 BuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2020-11-29 21:06:14,558 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 21:06:14,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 123 transitions. [2020-11-29 21:06:14,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2020-11-29 21:06:14,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 21:06:14,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 21:06:14,562 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 21:06:14,562 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:06:14,562 INFO L794 eck$LassoCheckResult]: Stem: 184#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 159#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 160#L183-1 [2020-11-29 21:06:14,563 INFO L796 eck$LassoCheckResult]: Loop: 160#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 185#L49 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 198#L78 assume !(0 != main_~p1~0); 197#L78-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 196#L82-1 assume !(0 != main_~p3~0); 182#L86-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 183#L90-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 179#L94-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 164#L98-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 142#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 143#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 158#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 190#L114-1 assume !(0 != main_~p11~0); 189#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 188#L122-1 assume !(0 != main_~p1~0); 181#L128-1 assume !(0 != main_~p2~0); 172#L133-1 assume !(0 != main_~p3~0); 174#L138-1 assume !(0 != main_~p4~0); 145#L143-1 assume !(0 != main_~p5~0); 155#L148-1 assume !(0 != main_~p6~0); 157#L153-1 assume !(0 != main_~p7~0); 208#L158-1 assume !(0 != main_~p8~0); 186#L163-1 assume !(0 != main_~p9~0); 150#L168-1 assume !(0 != main_~p10~0); 151#L173-1 assume !(0 != main_~p11~0); 154#L178-1 assume !(0 != main_~p12~0); 160#L183-1 [2020-11-29 21:06:14,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:14,563 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-11-29 21:06:14,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:14,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481717822] [2020-11-29 21:06:14,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:14,617 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:14,633 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:14,639 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 21:06:14,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:14,640 INFO L82 PathProgramCache]: Analyzing trace with hash -953213050, now seen corresponding path program 1 times [2020-11-29 21:06:14,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:14,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190243282] [2020-11-29 21:06:14,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:06:14,696 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-29 21:06:14,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190243282] [2020-11-29 21:06:14,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:06:14,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 21:06:14,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37316867] [2020-11-29 21:06:14,698 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 21:06:14,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:06:14,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 21:06:14,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 21:06:14,699 INFO L87 Difference]: Start difference. First operand 77 states and 123 transitions. cyclomatic complexity: 48 Second operand 3 states. [2020-11-29 21:06:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:06:14,740 INFO L93 Difference]: Finished difference Result 150 states and 238 transitions. [2020-11-29 21:06:14,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 21:06:14,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 238 transitions. [2020-11-29 21:06:14,747 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2020-11-29 21:06:14,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 238 transitions. [2020-11-29 21:06:14,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2020-11-29 21:06:14,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2020-11-29 21:06:14,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 238 transitions. [2020-11-29 21:06:14,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 21:06:14,764 INFO L691 BuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2020-11-29 21:06:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 238 transitions. [2020-11-29 21:06:14,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2020-11-29 21:06:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-11-29 21:06:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 238 transitions. [2020-11-29 21:06:14,792 INFO L714 BuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2020-11-29 21:06:14,793 INFO L594 BuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2020-11-29 21:06:14,793 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 21:06:14,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 238 transitions. [2020-11-29 21:06:14,802 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2020-11-29 21:06:14,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 21:06:14,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 21:06:14,805 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 21:06:14,805 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:06:14,806 INFO L794 eck$LassoCheckResult]: Stem: 417#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 392#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 393#L183-1 [2020-11-29 21:06:14,807 INFO L796 eck$LassoCheckResult]: Loop: 393#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 441#L49 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 439#L78 assume !(0 != main_~p1~0); 437#L78-2 assume !(0 != main_~p2~0); 438#L82-1 assume !(0 != main_~p3~0); 415#L86-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 416#L90-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 468#L94-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 467#L98-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 466#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 465#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 427#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 428#L114-1 assume !(0 != main_~p11~0); 423#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 424#L122-1 assume !(0 != main_~p1~0); 462#L128-1 assume !(0 != main_~p2~0); 461#L133-1 assume !(0 != main_~p3~0); 459#L138-1 assume !(0 != main_~p4~0); 457#L143-1 assume !(0 != main_~p5~0); 455#L148-1 assume !(0 != main_~p6~0); 453#L153-1 assume !(0 != main_~p7~0); 451#L158-1 assume !(0 != main_~p8~0); 449#L163-1 assume !(0 != main_~p9~0); 447#L168-1 assume !(0 != main_~p10~0); 444#L173-1 assume !(0 != main_~p11~0); 443#L178-1 assume !(0 != main_~p12~0); 393#L183-1 [2020-11-29 21:06:14,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:14,810 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-11-29 21:06:14,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:14,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925700955] [2020-11-29 21:06:14,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:14,826 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:14,839 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:14,845 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 21:06:14,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:14,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1536315912, now seen corresponding path program 1 times [2020-11-29 21:06:14,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:14,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505556267] [2020-11-29 21:06:14,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:06:14,878 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-29 21:06:14,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505556267] [2020-11-29 21:06:14,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:06:14,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 21:06:14,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812330457] [2020-11-29 21:06:14,879 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 21:06:14,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:06:14,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 21:06:14,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 21:06:14,880 INFO L87 Difference]: Start difference. First operand 150 states and 238 transitions. cyclomatic complexity: 92 Second operand 3 states. [2020-11-29 21:06:14,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:06:14,909 INFO L93 Difference]: Finished difference Result 294 states and 462 transitions. [2020-11-29 21:06:14,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 21:06:14,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 462 transitions. [2020-11-29 21:06:14,914 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2020-11-29 21:06:14,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 294 states and 462 transitions. [2020-11-29 21:06:14,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2020-11-29 21:06:14,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2020-11-29 21:06:14,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 294 states and 462 transitions. [2020-11-29 21:06:14,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 21:06:14,923 INFO L691 BuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2020-11-29 21:06:14,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states and 462 transitions. [2020-11-29 21:06:14,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2020-11-29 21:06:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-11-29 21:06:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 462 transitions. [2020-11-29 21:06:14,947 INFO L714 BuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2020-11-29 21:06:14,947 INFO L594 BuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2020-11-29 21:06:14,947 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 21:06:14,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 294 states and 462 transitions. [2020-11-29 21:06:14,951 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2020-11-29 21:06:14,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 21:06:14,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 21:06:14,957 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 21:06:14,957 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:06:14,957 INFO L794 eck$LassoCheckResult]: Stem: 873#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 842#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 843#L183-1 [2020-11-29 21:06:14,958 INFO L796 eck$LassoCheckResult]: Loop: 843#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 1074#L49 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 1073#L78 assume !(0 != main_~p1~0); 1072#L78-2 assume !(0 != main_~p2~0); 1071#L82-1 assume !(0 != main_~p3~0); 1069#L86-1 assume !(0 != main_~p4~0); 1068#L90-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1067#L94-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1066#L98-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1065#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1064#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1063#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1018#L114-1 assume !(0 != main_~p11~0); 1016#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1017#L122-1 assume !(0 != main_~p1~0); 1043#L128-1 assume !(0 != main_~p2~0); 1031#L133-1 assume !(0 != main_~p3~0); 1028#L138-1 assume !(0 != main_~p4~0); 876#L143-1 assume !(0 != main_~p5~0); 836#L148-1 assume !(0 != main_~p6~0); 838#L153-1 assume !(0 != main_~p7~0); 852#L158-1 assume !(0 != main_~p8~0); 1082#L163-1 assume !(0 != main_~p9~0); 1080#L168-1 assume !(0 != main_~p10~0); 1077#L173-1 assume !(0 != main_~p11~0); 1076#L178-1 assume !(0 != main_~p12~0); 843#L183-1 [2020-11-29 21:06:14,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:14,958 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-11-29 21:06:14,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:14,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107747884] [2020-11-29 21:06:14,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:14,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:14,983 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:14,987 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 21:06:14,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:14,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1959017738, now seen corresponding path program 1 times [2020-11-29 21:06:14,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:14,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779450985] [2020-11-29 21:06:14,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:06:15,020 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-29 21:06:15,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779450985] [2020-11-29 21:06:15,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:06:15,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 21:06:15,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27096178] [2020-11-29 21:06:15,022 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 21:06:15,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:06:15,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 21:06:15,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 21:06:15,023 INFO L87 Difference]: Start difference. First operand 294 states and 462 transitions. cyclomatic complexity: 176 Second operand 3 states. [2020-11-29 21:06:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:06:15,044 INFO L93 Difference]: Finished difference Result 578 states and 898 transitions. [2020-11-29 21:06:15,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 21:06:15,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 578 states and 898 transitions. [2020-11-29 21:06:15,050 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2020-11-29 21:06:15,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 578 states to 578 states and 898 transitions. [2020-11-29 21:06:15,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2020-11-29 21:06:15,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2020-11-29 21:06:15,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 898 transitions. [2020-11-29 21:06:15,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 21:06:15,063 INFO L691 BuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2020-11-29 21:06:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states and 898 transitions. [2020-11-29 21:06:15,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2020-11-29 21:06:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2020-11-29 21:06:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 898 transitions. [2020-11-29 21:06:15,098 INFO L714 BuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2020-11-29 21:06:15,098 INFO L594 BuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2020-11-29 21:06:15,098 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 21:06:15,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 578 states and 898 transitions. [2020-11-29 21:06:15,111 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2020-11-29 21:06:15,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 21:06:15,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 21:06:15,112 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 21:06:15,113 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:06:15,113 INFO L794 eck$LassoCheckResult]: Stem: 1750#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1721#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 1722#L183-1 [2020-11-29 21:06:15,113 INFO L796 eck$LassoCheckResult]: Loop: 1722#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 1795#L49 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 1790#L78 assume !(0 != main_~p1~0); 1784#L78-2 assume !(0 != main_~p2~0); 1785#L82-1 assume !(0 != main_~p3~0); 1774#L86-1 assume !(0 != main_~p4~0); 1776#L90-1 assume !(0 != main_~p5~0); 1893#L94-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1891#L98-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1889#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1887#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1885#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1883#L114-1 assume !(0 != main_~p11~0); 1881#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1878#L122-1 assume !(0 != main_~p1~0); 1873#L128-1 assume !(0 != main_~p2~0); 1872#L133-1 assume !(0 != main_~p3~0); 1869#L138-1 assume !(0 != main_~p4~0); 1867#L143-1 assume !(0 != main_~p5~0); 1866#L148-1 assume !(0 != main_~p6~0); 1863#L153-1 assume !(0 != main_~p7~0); 1859#L158-1 assume !(0 != main_~p8~0); 1852#L163-1 assume !(0 != main_~p9~0); 1846#L168-1 assume !(0 != main_~p10~0); 1839#L173-1 assume !(0 != main_~p11~0); 1808#L178-1 assume !(0 != main_~p12~0); 1722#L183-1 [2020-11-29 21:06:15,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:15,114 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-11-29 21:06:15,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:15,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415671038] [2020-11-29 21:06:15,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:15,127 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:15,149 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:15,154 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 21:06:15,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:15,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1141369288, now seen corresponding path program 1 times [2020-11-29 21:06:15,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:15,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169872159] [2020-11-29 21:06:15,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:06:15,220 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-29 21:06:15,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169872159] [2020-11-29 21:06:15,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:06:15,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 21:06:15,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001211148] [2020-11-29 21:06:15,222 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 21:06:15,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:06:15,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 21:06:15,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 21:06:15,223 INFO L87 Difference]: Start difference. First operand 578 states and 898 transitions. cyclomatic complexity: 336 Second operand 3 states. [2020-11-29 21:06:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:06:15,285 INFO L93 Difference]: Finished difference Result 1138 states and 1746 transitions. [2020-11-29 21:06:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 21:06:15,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1138 states and 1746 transitions. [2020-11-29 21:06:15,320 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2020-11-29 21:06:15,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1138 states to 1138 states and 1746 transitions. [2020-11-29 21:06:15,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1138 [2020-11-29 21:06:15,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1138 [2020-11-29 21:06:15,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1138 states and 1746 transitions. [2020-11-29 21:06:15,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 21:06:15,340 INFO L691 BuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2020-11-29 21:06:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states and 1746 transitions. [2020-11-29 21:06:15,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2020-11-29 21:06:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2020-11-29 21:06:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1746 transitions. [2020-11-29 21:06:15,369 INFO L714 BuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2020-11-29 21:06:15,369 INFO L594 BuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2020-11-29 21:06:15,369 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-29 21:06:15,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1138 states and 1746 transitions. [2020-11-29 21:06:15,381 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2020-11-29 21:06:15,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 21:06:15,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 21:06:15,382 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 21:06:15,382 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:06:15,382 INFO L794 eck$LassoCheckResult]: Stem: 3474#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3442#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 3443#L183-1 [2020-11-29 21:06:15,382 INFO L796 eck$LassoCheckResult]: Loop: 3443#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 3540#L49 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 3538#L78 assume !(0 != main_~p1~0); 3534#L78-2 assume !(0 != main_~p2~0); 3532#L82-1 assume !(0 != main_~p3~0); 3528#L86-1 assume !(0 != main_~p4~0); 3524#L90-1 assume !(0 != main_~p5~0); 3520#L94-1 assume !(0 != main_~p6~0); 3518#L98-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3516#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3514#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3512#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3510#L114-1 assume !(0 != main_~p11~0); 3508#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 3505#L122-1 assume !(0 != main_~p1~0); 3506#L128-1 assume !(0 != main_~p2~0); 3580#L133-1 assume !(0 != main_~p3~0); 3575#L138-1 assume !(0 != main_~p4~0); 3571#L143-1 assume !(0 != main_~p5~0); 3567#L148-1 assume !(0 != main_~p6~0); 3564#L153-1 assume !(0 != main_~p7~0); 3560#L158-1 assume !(0 != main_~p8~0); 3556#L163-1 assume !(0 != main_~p9~0); 3552#L168-1 assume !(0 != main_~p10~0); 3547#L173-1 assume !(0 != main_~p11~0); 3544#L178-1 assume !(0 != main_~p12~0); 3443#L183-1 [2020-11-29 21:06:15,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:15,385 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-11-29 21:06:15,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:15,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057819741] [2020-11-29 21:06:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:15,405 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:15,437 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:15,441 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 21:06:15,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:15,442 INFO L82 PathProgramCache]: Analyzing trace with hash -547574454, now seen corresponding path program 1 times [2020-11-29 21:06:15,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:15,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142298815] [2020-11-29 21:06:15,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:06:15,487 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-29 21:06:15,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142298815] [2020-11-29 21:06:15,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:06:15,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 21:06:15,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287264126] [2020-11-29 21:06:15,488 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 21:06:15,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:06:15,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 21:06:15,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 21:06:15,490 INFO L87 Difference]: Start difference. First operand 1138 states and 1746 transitions. cyclomatic complexity: 640 Second operand 3 states. [2020-11-29 21:06:15,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:06:15,527 INFO L93 Difference]: Finished difference Result 2242 states and 3394 transitions. [2020-11-29 21:06:15,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 21:06:15,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2242 states and 3394 transitions. [2020-11-29 21:06:15,570 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2020-11-29 21:06:15,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2242 states to 2242 states and 3394 transitions. [2020-11-29 21:06:15,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2242 [2020-11-29 21:06:15,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2242 [2020-11-29 21:06:15,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2242 states and 3394 transitions. [2020-11-29 21:06:15,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 21:06:15,600 INFO L691 BuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2020-11-29 21:06:15,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states and 3394 transitions. [2020-11-29 21:06:15,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2242. [2020-11-29 21:06:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2020-11-29 21:06:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3394 transitions. [2020-11-29 21:06:15,655 INFO L714 BuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2020-11-29 21:06:15,656 INFO L594 BuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2020-11-29 21:06:15,656 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-29 21:06:15,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2242 states and 3394 transitions. [2020-11-29 21:06:15,677 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2020-11-29 21:06:15,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 21:06:15,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 21:06:15,679 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 21:06:15,679 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:06:15,679 INFO L794 eck$LassoCheckResult]: Stem: 6858#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 6827#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 6828#L183-1 [2020-11-29 21:06:15,680 INFO L796 eck$LassoCheckResult]: Loop: 6828#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 6950#L49 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 6946#L78 assume !(0 != main_~p1~0); 6939#L78-2 assume !(0 != main_~p2~0); 6934#L82-1 assume !(0 != main_~p3~0); 6927#L86-1 assume !(0 != main_~p4~0); 6919#L90-1 assume !(0 != main_~p5~0); 6911#L94-1 assume !(0 != main_~p6~0); 6904#L98-1 assume !(0 != main_~p7~0); 6905#L102-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 7036#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 7035#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 7034#L114-1 assume !(0 != main_~p11~0); 7033#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 7032#L122-1 assume !(0 != main_~p1~0); 7030#L128-1 assume !(0 != main_~p2~0); 7029#L133-1 assume !(0 != main_~p3~0); 7022#L138-1 assume !(0 != main_~p4~0); 7017#L143-1 assume !(0 != main_~p5~0); 7013#L148-1 assume !(0 != main_~p6~0); 7011#L153-1 assume !(0 != main_~p7~0); 7010#L158-1 assume !(0 != main_~p8~0); 7008#L163-1 assume !(0 != main_~p9~0); 6983#L168-1 assume !(0 != main_~p10~0); 6976#L173-1 assume !(0 != main_~p11~0); 6959#L178-1 assume !(0 != main_~p12~0); 6828#L183-1 [2020-11-29 21:06:15,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:15,680 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-11-29 21:06:15,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:15,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067625652] [2020-11-29 21:06:15,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:15,703 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:15,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:15,721 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 21:06:15,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:15,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1753248136, now seen corresponding path program 1 times [2020-11-29 21:06:15,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:15,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254786528] [2020-11-29 21:06:15,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:06:15,814 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-29 21:06:15,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254786528] [2020-11-29 21:06:15,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:06:15,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 21:06:15,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939006170] [2020-11-29 21:06:15,816 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 21:06:15,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:06:15,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 21:06:15,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 21:06:15,817 INFO L87 Difference]: Start difference. First operand 2242 states and 3394 transitions. cyclomatic complexity: 1216 Second operand 3 states. [2020-11-29 21:06:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:06:15,866 INFO L93 Difference]: Finished difference Result 4418 states and 6594 transitions. [2020-11-29 21:06:15,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 21:06:15,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4418 states and 6594 transitions. [2020-11-29 21:06:15,921 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2020-11-29 21:06:15,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4418 states to 4418 states and 6594 transitions. [2020-11-29 21:06:15,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4418 [2020-11-29 21:06:15,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4418 [2020-11-29 21:06:15,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4418 states and 6594 transitions. [2020-11-29 21:06:15,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 21:06:15,983 INFO L691 BuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2020-11-29 21:06:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4418 states and 6594 transitions. [2020-11-29 21:06:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4418 to 4418. [2020-11-29 21:06:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4418 states. [2020-11-29 21:06:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 6594 transitions. [2020-11-29 21:06:16,119 INFO L714 BuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2020-11-29 21:06:16,119 INFO L594 BuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2020-11-29 21:06:16,119 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-29 21:06:16,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4418 states and 6594 transitions. [2020-11-29 21:06:16,150 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2020-11-29 21:06:16,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 21:06:16,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 21:06:16,151 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 21:06:16,151 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:06:16,152 INFO L794 eck$LassoCheckResult]: Stem: 13523#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 13493#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 13494#L183-1 [2020-11-29 21:06:16,152 INFO L796 eck$LassoCheckResult]: Loop: 13494#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 13742#L49 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 13740#L78 assume !(0 != main_~p1~0); 13738#L78-2 assume !(0 != main_~p2~0); 13737#L82-1 assume !(0 != main_~p3~0); 13735#L86-1 assume !(0 != main_~p4~0); 13733#L90-1 assume !(0 != main_~p5~0); 13730#L94-1 assume !(0 != main_~p6~0); 13718#L98-1 assume !(0 != main_~p7~0); 13720#L102-1 assume !(0 != main_~p8~0); 13700#L106-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 13701#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 13653#L114-1 assume !(0 != main_~p11~0); 13654#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 13641#L122-1 assume !(0 != main_~p1~0); 13642#L128-1 assume !(0 != main_~p2~0); 13634#L133-1 assume !(0 != main_~p3~0); 13633#L138-1 assume !(0 != main_~p4~0); 13620#L143-1 assume !(0 != main_~p5~0); 13622#L148-1 assume !(0 != main_~p6~0); 13753#L153-1 assume !(0 != main_~p7~0); 13751#L158-1 assume !(0 != main_~p8~0); 13750#L163-1 assume !(0 != main_~p9~0); 13748#L168-1 assume !(0 != main_~p10~0); 13745#L173-1 assume !(0 != main_~p11~0); 13744#L178-1 assume !(0 != main_~p12~0); 13494#L183-1 [2020-11-29 21:06:16,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:16,153 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-11-29 21:06:16,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:16,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823945556] [2020-11-29 21:06:16,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:16,169 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:16,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:16,195 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 21:06:16,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:16,195 INFO L82 PathProgramCache]: Analyzing trace with hash 164900234, now seen corresponding path program 1 times [2020-11-29 21:06:16,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:16,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780201373] [2020-11-29 21:06:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:06:16,249 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-29 21:06:16,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780201373] [2020-11-29 21:06:16,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:06:16,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 21:06:16,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174485327] [2020-11-29 21:06:16,251 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 21:06:16,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:06:16,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 21:06:16,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 21:06:16,252 INFO L87 Difference]: Start difference. First operand 4418 states and 6594 transitions. cyclomatic complexity: 2304 Second operand 3 states. [2020-11-29 21:06:16,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:06:16,316 INFO L93 Difference]: Finished difference Result 8706 states and 12802 transitions. [2020-11-29 21:06:16,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 21:06:16,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8706 states and 12802 transitions. [2020-11-29 21:06:16,383 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2020-11-29 21:06:16,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8706 states to 8706 states and 12802 transitions. [2020-11-29 21:06:16,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8706 [2020-11-29 21:06:16,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8706 [2020-11-29 21:06:16,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8706 states and 12802 transitions. [2020-11-29 21:06:16,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 21:06:16,513 INFO L691 BuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2020-11-29 21:06:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8706 states and 12802 transitions. [2020-11-29 21:06:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8706 to 8706. [2020-11-29 21:06:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8706 states. [2020-11-29 21:06:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8706 states to 8706 states and 12802 transitions. [2020-11-29 21:06:16,781 INFO L714 BuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2020-11-29 21:06:16,781 INFO L594 BuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2020-11-29 21:06:16,781 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-29 21:06:16,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8706 states and 12802 transitions. [2020-11-29 21:06:16,827 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2020-11-29 21:06:16,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 21:06:16,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 21:06:16,831 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 21:06:16,831 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:06:16,832 INFO L794 eck$LassoCheckResult]: Stem: 26662#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 26624#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 26625#L183-1 [2020-11-29 21:06:16,832 INFO L796 eck$LassoCheckResult]: Loop: 26625#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 26912#L49 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 26910#L78 assume !(0 != main_~p1~0); 26908#L78-2 assume !(0 != main_~p2~0); 26907#L82-1 assume !(0 != main_~p3~0); 26904#L86-1 assume !(0 != main_~p4~0); 26900#L90-1 assume !(0 != main_~p5~0); 26896#L94-1 assume !(0 != main_~p6~0); 26893#L98-1 assume !(0 != main_~p7~0); 26884#L102-1 assume !(0 != main_~p8~0); 26886#L106-1 assume !(0 != main_~p9~0); 26866#L110-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 26867#L114-1 assume !(0 != main_~p11~0); 26848#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 26849#L122-1 assume !(0 != main_~p1~0); 26843#L128-1 assume !(0 != main_~p2~0); 26844#L133-1 assume !(0 != main_~p3~0); 26821#L138-1 assume !(0 != main_~p4~0); 26822#L143-1 assume !(0 != main_~p5~0); 26799#L148-1 assume !(0 != main_~p6~0); 26801#L153-1 assume !(0 != main_~p7~0); 26921#L158-1 assume !(0 != main_~p8~0); 26919#L163-1 assume !(0 != main_~p9~0); 26918#L168-1 assume !(0 != main_~p10~0); 26915#L173-1 assume !(0 != main_~p11~0); 26914#L178-1 assume !(0 != main_~p12~0); 26625#L183-1 [2020-11-29 21:06:16,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:16,834 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-11-29 21:06:16,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:16,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995666685] [2020-11-29 21:06:16,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:16,850 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:16,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:16,870 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 21:06:16,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:16,871 INFO L82 PathProgramCache]: Analyzing trace with hash -856168120, now seen corresponding path program 1 times [2020-11-29 21:06:16,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:16,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860283019] [2020-11-29 21:06:16,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:06:16,910 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-29 21:06:16,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860283019] [2020-11-29 21:06:16,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:06:16,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 21:06:16,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437994115] [2020-11-29 21:06:16,912 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 21:06:16,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:06:16,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 21:06:16,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 21:06:16,913 INFO L87 Difference]: Start difference. First operand 8706 states and 12802 transitions. cyclomatic complexity: 4352 Second operand 3 states. [2020-11-29 21:06:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:06:17,095 INFO L93 Difference]: Finished difference Result 17154 states and 24834 transitions. [2020-11-29 21:06:17,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 21:06:17,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17154 states and 24834 transitions. [2020-11-29 21:06:17,289 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2020-11-29 21:06:17,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17154 states to 17154 states and 24834 transitions. [2020-11-29 21:06:17,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17154 [2020-11-29 21:06:17,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17154 [2020-11-29 21:06:17,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17154 states and 24834 transitions. [2020-11-29 21:06:17,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 21:06:17,452 INFO L691 BuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2020-11-29 21:06:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states and 24834 transitions. [2020-11-29 21:06:17,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2020-11-29 21:06:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17154 states. [2020-11-29 21:06:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 24834 transitions. [2020-11-29 21:06:17,865 INFO L714 BuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2020-11-29 21:06:17,865 INFO L594 BuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2020-11-29 21:06:17,866 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-29 21:06:17,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17154 states and 24834 transitions. [2020-11-29 21:06:18,052 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2020-11-29 21:06:18,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 21:06:18,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 21:06:18,056 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 21:06:18,056 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:06:18,056 INFO L794 eck$LassoCheckResult]: Stem: 52528#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 52488#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 52489#L183-1 [2020-11-29 21:06:18,059 INFO L796 eck$LassoCheckResult]: Loop: 52489#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 52958#L49 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 52959#L78 assume !(0 != main_~p1~0); 52961#L78-2 assume !(0 != main_~p2~0); 52956#L82-1 assume !(0 != main_~p3~0); 52957#L86-1 assume !(0 != main_~p4~0); 53036#L90-1 assume !(0 != main_~p5~0); 53029#L94-1 assume !(0 != main_~p6~0); 53022#L98-1 assume !(0 != main_~p7~0); 53019#L102-1 assume !(0 != main_~p8~0); 53017#L106-1 assume !(0 != main_~p9~0); 52875#L110-1 assume !(0 != main_~p10~0); 52877#L114-1 assume !(0 != main_~p11~0); 52867#L118-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 52868#L122-1 assume !(0 != main_~p1~0); 52821#L128-1 assume !(0 != main_~p2~0); 52822#L133-1 assume !(0 != main_~p3~0); 52764#L138-1 assume !(0 != main_~p4~0); 52765#L143-1 assume !(0 != main_~p5~0); 53051#L148-1 assume !(0 != main_~p6~0); 52730#L153-1 assume !(0 != main_~p7~0); 52731#L158-1 assume !(0 != main_~p8~0); 53057#L163-1 assume !(0 != main_~p9~0); 53055#L168-1 assume !(0 != main_~p10~0); 53032#L173-1 assume !(0 != main_~p11~0); 53027#L178-1 assume !(0 != main_~p12~0); 52489#L183-1 [2020-11-29 21:06:18,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:18,060 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2020-11-29 21:06:18,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:18,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531910898] [2020-11-29 21:06:18,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:18,077 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:18,086 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:18,096 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 21:06:18,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:18,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2136031798, now seen corresponding path program 1 times [2020-11-29 21:06:18,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:18,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452408426] [2020-11-29 21:06:18,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:06:18,125 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-29 21:06:18,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452408426] [2020-11-29 21:06:18,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:06:18,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 21:06:18,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636336522] [2020-11-29 21:06:18,127 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 21:06:18,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:06:18,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 21:06:18,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 21:06:18,127 INFO L87 Difference]: Start difference. First operand 17154 states and 24834 transitions. cyclomatic complexity: 8192 Second operand 3 states. [2020-11-29 21:06:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:06:18,593 INFO L93 Difference]: Finished difference Result 33794 states and 48130 transitions. [2020-11-29 21:06:18,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 21:06:18,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33794 states and 48130 transitions. [2020-11-29 21:06:18,938 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2020-11-29 21:06:19,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33794 states to 33794 states and 48130 transitions. [2020-11-29 21:06:19,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33794 [2020-11-29 21:06:19,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33794 [2020-11-29 21:06:19,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33794 states and 48130 transitions. [2020-11-29 21:06:19,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 21:06:19,147 INFO L691 BuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2020-11-29 21:06:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33794 states and 48130 transitions. [2020-11-29 21:06:19,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33794 to 33794. [2020-11-29 21:06:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33794 states. [2020-11-29 21:06:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33794 states to 33794 states and 48130 transitions. [2020-11-29 21:06:19,798 INFO L714 BuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2020-11-29 21:06:19,799 INFO L594 BuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2020-11-29 21:06:19,799 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-29 21:06:19,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33794 states and 48130 transitions. [2020-11-29 21:06:19,912 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2020-11-29 21:06:19,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 21:06:19,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 21:06:19,914 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 21:06:19,914 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:06:19,914 INFO L794 eck$LassoCheckResult]: Stem: 103477#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(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 103442#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;havoc main_~cond~0; 103443#L183-1 [2020-11-29 21:06:19,914 INFO L796 eck$LassoCheckResult]: Loop: 103443#L183-1 assume !false;main_~cond~0 := main_#t~nondet19;havoc main_#t~nondet19; 103594#L49 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0; 103590#L78 assume !(0 != main_~p1~0); 103588#L78-2 assume !(0 != main_~p2~0); 103586#L82-1 assume !(0 != main_~p3~0); 103582#L86-1 assume !(0 != main_~p4~0); 103578#L90-1 assume !(0 != main_~p5~0); 103574#L94-1 assume !(0 != main_~p6~0); 103570#L98-1 assume !(0 != main_~p7~0); 103566#L102-1 assume !(0 != main_~p8~0); 103562#L106-1 assume !(0 != main_~p9~0); 103558#L110-1 assume !(0 != main_~p10~0); 103556#L114-1 assume !(0 != main_~p11~0); 103552#L118-1 assume !(0 != main_~p12~0); 103548#L122-1 assume !(0 != main_~p1~0); 103546#L128-1 assume !(0 != main_~p2~0); 103540#L133-1 assume !(0 != main_~p3~0); 103539#L138-1 assume !(0 != main_~p4~0); 103625#L143-1 assume !(0 != main_~p5~0); 103621#L148-1 assume !(0 != main_~p6~0); 103617#L153-1 assume !(0 != main_~p7~0); 103613#L158-1 assume !(0 != main_~p8~0); 103609#L163-1 assume !(0 != main_~p9~0); 103605#L168-1 assume !(0 != main_~p10~0); 103601#L173-1 assume !(0 != main_~p11~0); 103597#L178-1 assume !(0 != main_~p12~0); 103443#L183-1 [2020-11-29 21:06:19,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:19,915 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2020-11-29 21:06:19,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:19,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169470820] [2020-11-29 21:06:19,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:19,925 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:19,935 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:19,939 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 21:06:19,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:19,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1572129484, now seen corresponding path program 1 times [2020-11-29 21:06:19,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:19,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034231034] [2020-11-29 21:06:19,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:19,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:19,951 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:19,957 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 21:06:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:06:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1068122098, now seen corresponding path program 1 times [2020-11-29 21:06:19,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:06:19,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20526937] [2020-11-29 21:06:19,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:06:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:19,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:06:19,980 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:06:19,991 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 21:06:20,160 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-29 21:06:20,438 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-29 21:06:20,890 WARN L193 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2020-11-29 21:06:21,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 09:06:21 BoogieIcfgContainer [2020-11-29 21:06:21,052 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-29 21:06:21,053 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 21:06:21,053 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 21:06:21,053 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 21:06:21,054 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:06:13" (3/4) ... [2020-11-29 21:06:21,056 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-29 21:06:21,128 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d4f96cdb-2525-4e14-b318-3f6414ab7918/bin/uautomizer/witness.graphml [2020-11-29 21:06:21,128 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 21:06:21,135 INFO L168 Benchmark]: Toolchain (without parser) took 8316.43 ms. Allocated memory was 107.0 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 77.9 MB in the beginning and 905.2 MB in the end (delta: -827.3 MB). Peak memory consumption was 200.9 MB. Max. memory is 16.1 GB. [2020-11-29 21:06:21,136 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 88.1 MB. Free memory was 45.2 MB in the beginning and 45.1 MB in the end (delta: 21.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 21:06:21,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.80 ms. Allocated memory is still 107.0 MB. Free memory was 77.7 MB in the beginning and 84.9 MB in the end (delta: -7.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 21:06:21,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.20 ms. Allocated memory is still 107.0 MB. Free memory was 84.9 MB in the beginning and 83.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 21:06:21,137 INFO L168 Benchmark]: Boogie Preprocessor took 31.75 ms. Allocated memory is still 107.0 MB. Free memory was 83.4 MB in the beginning and 81.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 21:06:21,137 INFO L168 Benchmark]: RCFGBuilder took 734.21 ms. Allocated memory is still 107.0 MB. Free memory was 81.9 MB in the beginning and 60.9 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-29 21:06:21,138 INFO L168 Benchmark]: BuchiAutomizer took 7066.60 ms. Allocated memory was 107.0 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 60.9 MB in the beginning and 907.3 MB in the end (delta: -846.5 MB). Peak memory consumption was 312.8 MB. Max. memory is 16.1 GB. [2020-11-29 21:06:21,138 INFO L168 Benchmark]: Witness Printer took 75.44 ms. Allocated memory is still 1.1 GB. Free memory was 907.3 MB in the beginning and 905.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 21:06:21,141 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.30 ms. Allocated memory is still 88.1 MB. Free memory was 45.2 MB in the beginning and 45.1 MB in the end (delta: 21.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 344.80 ms. Allocated memory is still 107.0 MB. Free memory was 77.7 MB in the beginning and 84.9 MB in the end (delta: -7.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.20 ms. Allocated memory is still 107.0 MB. Free memory was 84.9 MB in the beginning and 83.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.75 ms. Allocated memory is still 107.0 MB. Free memory was 83.4 MB in the beginning and 81.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 734.21 ms. Allocated memory is still 107.0 MB. Free memory was 81.9 MB in the beginning and 60.9 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 7066.60 ms. Allocated memory was 107.0 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 60.9 MB in the beginning and 907.3 MB in the end (delta: -846.5 MB). Peak memory consumption was 312.8 MB. Max. memory is 16.1 GB. * Witness Printer took 75.44 ms. Allocated memory is still 1.1 GB. Free memory was 907.3 MB in the beginning and 905.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 33794 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 1.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.2s Buchi closure took 0.0s. Biggest automaton had 33794 states and ocurred in iteration 10. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 957 SDtfs, 496 SDslu, 595 SDs, 0 SdLazy, 50 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI10 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: 47]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=12237} State at position 1 is {NULL=12240, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=12237, p4=0, p10=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66968d4c=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29b0f593=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51c00458=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2115031f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73bb069c=0, lk10=0, p11=0, lk11=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38cd4f91=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@668847a4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16dc84c5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6eeab2e2=10, cond=10, NULL=12239, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d096915=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c3a4428=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53ea34b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e9ada96=0, NULL=0, NULL=0, NULL=0, NULL=12238, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 47]: 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; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L45] int cond; Loop: [L47] COND TRUE 1 [L48] cond = __VERIFIER_nondet_int() [L49] COND FALSE !(cond == 0) [L52] lk1 = 0 [L54] lk2 = 0 [L56] lk3 = 0 [L58] lk4 = 0 [L60] lk5 = 0 [L62] lk6 = 0 [L64] lk7 = 0 [L66] lk8 = 0 [L68] lk9 = 0 [L70] lk10 = 0 [L72] lk11 = 0 [L74] lk12 = 0 [L78] COND FALSE !(p1 != 0) [L82] COND FALSE !(p2 != 0) [L86] COND FALSE !(p3 != 0) [L90] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L98] COND FALSE !(p6 != 0) [L102] COND FALSE !(p7 != 0) [L106] COND FALSE !(p8 != 0) [L110] COND FALSE !(p9 != 0) [L114] COND FALSE !(p10 != 0) [L118] COND FALSE !(p11 != 0) [L122] COND FALSE !(p12 != 0) [L128] COND FALSE !(p1 != 0) [L133] COND FALSE !(p2 != 0) [L138] COND FALSE !(p3 != 0) [L143] COND FALSE !(p4 != 0) [L148] COND FALSE !(p5 != 0) [L153] COND FALSE !(p6 != 0) [L158] COND FALSE !(p7 != 0) [L163] COND FALSE !(p8 != 0) [L168] COND FALSE !(p9 != 0) [L173] COND FALSE !(p10 != 0) [L178] COND FALSE !(p11 != 0) [L183] COND FALSE !(p12 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...