./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:50:39,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:50:39,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:50:39,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:50:39,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:50:39,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:50:39,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:50:39,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:50:39,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:50:39,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:50:39,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:50:39,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:50:39,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:50:39,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:50:39,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:50:39,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:50:39,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:50:39,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:50:39,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:50:39,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:50:39,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:50:39,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:50:39,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:50:39,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:50:39,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:50:39,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:50:39,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:50:39,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:50:39,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:50:39,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:50:39,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:50:39,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:50:39,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:50:39,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:50:39,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:50:39,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:50:39,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:50:39,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:50:39,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:50:39,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:50:39,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:50:39,425 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:50:39,476 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:50:39,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:50:39,478 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:50:39,478 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:50:39,479 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:50:39,480 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:50:39,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:50:39,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:50:39,482 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:50:39,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:50:39,483 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:50:39,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:50:39,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:50:39,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:50:39,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:50:39,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:50:39,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:50:39,486 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:50:39,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:50:39,487 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:50:39,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:50:39,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:50:39,488 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:50:39,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:50:39,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:50:39,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:50:39,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:50:39,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:50:39,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:50:39,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:50:39,490 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:50:39,490 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:50:39,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:50:39,491 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN/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_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN 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(G ! call(reach_error())) ) 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 -> af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 [2022-11-20 11:50:39,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:50:39,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:50:39,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:50:39,949 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:50:39,950 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:50:39,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-11-20 11:50:43,871 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:50:44,187 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:50:44,188 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-11-20 11:50:44,206 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN/data/611c90bbc/901c5be143f441cf8ede98377fc71c65/FLAG2d6358f13 [2022-11-20 11:50:44,224 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN/data/611c90bbc/901c5be143f441cf8ede98377fc71c65 [2022-11-20 11:50:44,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:50:44,230 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:50:44,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:50:44,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:50:44,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:50:44,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:50:44" (1/1) ... [2022-11-20 11:50:44,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e706a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:44, skipping insertion in model container [2022-11-20 11:50:44,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:50:44" (1/1) ... [2022-11-20 11:50:44,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:50:44,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:50:44,517 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-11-20 11:50:44,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:50:44,901 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:50:44,919 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-11-20 11:50:45,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:50:45,083 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:50:45,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:45 WrapperNode [2022-11-20 11:50:45,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:50:45,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:50:45,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:50:45,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:50:45,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:45" (1/1) ... [2022-11-20 11:50:45,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:45" (1/1) ... [2022-11-20 11:50:45,169 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2022-11-20 11:50:45,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:50:45,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:50:45,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:50:45,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:50:45,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:45" (1/1) ... [2022-11-20 11:50:45,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:45" (1/1) ... [2022-11-20 11:50:45,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:45" (1/1) ... [2022-11-20 11:50:45,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:45" (1/1) ... [2022-11-20 11:50:45,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:45" (1/1) ... [2022-11-20 11:50:45,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:45" (1/1) ... [2022-11-20 11:50:45,223 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:45" (1/1) ... [2022-11-20 11:50:45,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:45" (1/1) ... [2022-11-20 11:50:45,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:50:45,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:50:45,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:50:45,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:50:45,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:45" (1/1) ... [2022-11-20 11:50:45,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:50:45,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:50:45,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:50:45,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:50:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:50:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 11:50:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:50:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:50:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:50:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 11:50:45,360 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 11:50:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 11:50:45,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 11:50:45,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:50:45,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 11:50:45,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:50:45,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:50:45,364 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 11:50:45,594 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:50:45,597 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:50:46,172 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:50:46,369 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:50:46,370 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 11:50:46,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:50:46 BoogieIcfgContainer [2022-11-20 11:50:46,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:50:46,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:50:46,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:50:46,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:50:46,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:50:44" (1/3) ... [2022-11-20 11:50:46,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1902cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:50:46, skipping insertion in model container [2022-11-20 11:50:46,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:45" (2/3) ... [2022-11-20 11:50:46,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1902cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:50:46, skipping insertion in model container [2022-11-20 11:50:46,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:50:46" (3/3) ... [2022-11-20 11:50:46,387 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-11-20 11:50:46,399 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 11:50:46,414 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:50:46,415 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 11:50:46,415 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 11:50:46,481 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 11:50:46,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 204 flow [2022-11-20 11:50:46,598 INFO L130 PetriNetUnfolder]: 2/95 cut-off events. [2022-11-20 11:50:46,598 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 11:50:46,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-11-20 11:50:46,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 97 transitions, 204 flow [2022-11-20 11:50:46,610 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 95 transitions, 196 flow [2022-11-20 11:50:46,624 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:50:46,633 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4c60c62f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:50:46,633 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-20 11:50:46,649 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-11-20 11:50:46,649 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 11:50:46,650 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:50:46,651 INFO L209 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:46,652 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 11:50:46,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:46,659 INFO L85 PathProgramCache]: Analyzing trace with hash -468153235, now seen corresponding path program 1 times [2022-11-20 11:50:46,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:46,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201371889] [2022-11-20 11:50:46,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:46,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:47,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:47,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:47,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201371889] [2022-11-20 11:50:47,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201371889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:47,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:47,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:50:47,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403056687] [2022-11-20 11:50:47,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:47,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:50:47,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:47,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:50:47,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:47,584 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 97 [2022-11-20 11:50:47,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:47,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:50:47,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 97 [2022-11-20 11:50:47,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:50:47,709 INFO L130 PetriNetUnfolder]: 18/150 cut-off events. [2022-11-20 11:50:47,715 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-20 11:50:47,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 150 events. 18/150 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 351 event pairs, 2 based on Foata normal form. 8/148 useless extension candidates. Maximal degree in co-relation 153. Up to 31 conditions per place. [2022-11-20 11:50:47,721 INFO L137 encePairwiseOnDemand]: 92/97 looper letters, 10 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2022-11-20 11:50:47,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 223 flow [2022-11-20 11:50:47,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:50:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:50:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2022-11-20 11:50:47,748 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9347079037800687 [2022-11-20 11:50:47,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2022-11-20 11:50:47,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2022-11-20 11:50:47,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:50:47,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2022-11-20 11:50:47,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:47,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:47,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:47,780 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 196 flow. Second operand 3 states and 272 transitions. [2022-11-20 11:50:47,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 223 flow [2022-11-20 11:50:47,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:50:47,790 INFO L231 Difference]: Finished difference. Result has 98 places, 91 transitions, 190 flow [2022-11-20 11:50:47,793 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2022-11-20 11:50:47,797 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2022-11-20 11:50:47,800 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 190 flow [2022-11-20 11:50:47,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:47,802 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:50:47,803 INFO L209 CegarLoopForPetriNet]: trace 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:47,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:50:47,804 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 11:50:47,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:47,808 INFO L85 PathProgramCache]: Analyzing trace with hash -60252564, now seen corresponding path program 1 times [2022-11-20 11:50:47,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:47,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378342924] [2022-11-20 11:50:47,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:48,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:48,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378342924] [2022-11-20 11:50:48,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378342924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:48,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:48,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:50:48,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25026513] [2022-11-20 11:50:48,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:48,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:50:48,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:48,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:50:48,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:50:48,620 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 97 [2022-11-20 11:50:48,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:48,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:50:48,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 97 [2022-11-20 11:50:48,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:50:49,308 INFO L130 PetriNetUnfolder]: 173/622 cut-off events. [2022-11-20 11:50:49,308 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-11-20 11:50:49,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 622 events. 173/622 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3474 event pairs, 40 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 947. Up to 166 conditions per place. [2022-11-20 11:50:49,314 INFO L137 encePairwiseOnDemand]: 91/97 looper letters, 16 selfloop transitions, 2 changer transitions 40/124 dead transitions. [2022-11-20 11:50:49,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 124 transitions, 368 flow [2022-11-20 11:50:49,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:50:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 11:50:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 744 transitions. [2022-11-20 11:50:49,319 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.852233676975945 [2022-11-20 11:50:49,320 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 744 transitions. [2022-11-20 11:50:49,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 744 transitions. [2022-11-20 11:50:49,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:50:49,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 744 transitions. [2022-11-20 11:50:49,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.66666666666667) internal successors, (744), 9 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:49,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:49,330 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:49,330 INFO L175 Difference]: Start difference. First operand has 98 places, 91 transitions, 190 flow. Second operand 9 states and 744 transitions. [2022-11-20 11:50:49,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 124 transitions, 368 flow [2022-11-20 11:50:49,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 124 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:50:49,337 INFO L231 Difference]: Finished difference. Result has 111 places, 81 transitions, 186 flow [2022-11-20 11:50:49,337 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=186, PETRI_PLACES=111, PETRI_TRANSITIONS=81} [2022-11-20 11:50:49,338 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2022-11-20 11:50:49,339 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 81 transitions, 186 flow [2022-11-20 11:50:49,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:49,339 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:50:49,340 INFO L209 CegarLoopForPetriNet]: trace 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:49,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:50:49,341 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 11:50:49,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:49,343 INFO L85 PathProgramCache]: Analyzing trace with hash -672203464, now seen corresponding path program 1 times [2022-11-20 11:50:49,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:49,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419693923] [2022-11-20 11:50:49,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:49,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:49,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:49,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419693923] [2022-11-20 11:50:49,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419693923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:49,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:49,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:50:49,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579625195] [2022-11-20 11:50:49,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:49,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:50:49,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:49,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:50:49,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:50:49,801 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 97 [2022-11-20 11:50:49,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 81 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:49,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:50:49,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 97 [2022-11-20 11:50:49,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:50:50,290 INFO L130 PetriNetUnfolder]: 167/492 cut-off events. [2022-11-20 11:50:50,291 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-11-20 11:50:50,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 492 events. 167/492 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2426 event pairs, 18 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 846. Up to 79 conditions per place. [2022-11-20 11:50:50,299 INFO L137 encePairwiseOnDemand]: 88/97 looper letters, 24 selfloop transitions, 5 changer transitions 40/133 dead transitions. [2022-11-20 11:50:50,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 133 transitions, 430 flow [2022-11-20 11:50:50,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:50:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 11:50:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 831 transitions. [2022-11-20 11:50:50,303 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.856701030927835 [2022-11-20 11:50:50,304 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 831 transitions. [2022-11-20 11:50:50,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 831 transitions. [2022-11-20 11:50:50,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:50:50,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 831 transitions. [2022-11-20 11:50:50,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 83.1) internal successors, (831), 10 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:50,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:50,312 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:50,312 INFO L175 Difference]: Start difference. First operand has 111 places, 81 transitions, 186 flow. Second operand 10 states and 831 transitions. [2022-11-20 11:50:50,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 133 transitions, 430 flow [2022-11-20 11:50:50,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 133 transitions, 414 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-20 11:50:50,324 INFO L231 Difference]: Finished difference. Result has 102 places, 82 transitions, 212 flow [2022-11-20 11:50:50,324 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=212, PETRI_PLACES=102, PETRI_TRANSITIONS=82} [2022-11-20 11:50:50,331 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, 2 predicate places. [2022-11-20 11:50:50,332 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 82 transitions, 212 flow [2022-11-20 11:50:50,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:50,333 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:50:50,333 INFO L209 CegarLoopForPetriNet]: trace 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:50,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:50:50,334 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 11:50:50,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:50,336 INFO L85 PathProgramCache]: Analyzing trace with hash -36336583, now seen corresponding path program 1 times [2022-11-20 11:50:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:50,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836609283] [2022-11-20 11:50:50,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:50,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:50,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:50,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836609283] [2022-11-20 11:50:50,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836609283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:50,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:50,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:50:50,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910488528] [2022-11-20 11:50:50,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:50,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:50:50,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:50,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:50:50,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:50:50,841 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 97 [2022-11-20 11:50:50,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 82 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:50,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:50:50,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 97 [2022-11-20 11:50:50,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:50:51,172 INFO L130 PetriNetUnfolder]: 35/183 cut-off events. [2022-11-20 11:50:51,172 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-11-20 11:50:51,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 183 events. 35/183 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 516 event pairs, 6 based on Foata normal form. 7/187 useless extension candidates. Maximal degree in co-relation 365. Up to 26 conditions per place. [2022-11-20 11:50:51,174 INFO L137 encePairwiseOnDemand]: 89/97 looper letters, 16 selfloop transitions, 7 changer transitions 19/106 dead transitions. [2022-11-20 11:50:51,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 106 transitions, 389 flow [2022-11-20 11:50:51,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:50:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 11:50:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 804 transitions. [2022-11-20 11:50:51,178 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8288659793814434 [2022-11-20 11:50:51,178 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 804 transitions. [2022-11-20 11:50:51,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 804 transitions. [2022-11-20 11:50:51,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:50:51,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 804 transitions. [2022-11-20 11:50:51,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 80.4) internal successors, (804), 10 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:51,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:51,185 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:51,186 INFO L175 Difference]: Start difference. First operand has 102 places, 82 transitions, 212 flow. Second operand 10 states and 804 transitions. [2022-11-20 11:50:51,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 106 transitions, 389 flow [2022-11-20 11:50:51,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 106 transitions, 350 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-20 11:50:51,191 INFO L231 Difference]: Finished difference. Result has 105 places, 82 transitions, 224 flow [2022-11-20 11:50:51,191 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=224, PETRI_PLACES=105, PETRI_TRANSITIONS=82} [2022-11-20 11:50:51,192 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, 5 predicate places. [2022-11-20 11:50:51,192 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 82 transitions, 224 flow [2022-11-20 11:50:51,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:51,193 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:50:51,193 INFO L209 CegarLoopForPetriNet]: trace 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:51,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:50:51,194 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 11:50:51,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:51,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1714033620, now seen corresponding path program 1 times [2022-11-20 11:50:51,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:51,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312809887] [2022-11-20 11:50:51,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:51,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:53,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:53,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312809887] [2022-11-20 11:50:53,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312809887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:53,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:53,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 11:50:53,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808569314] [2022-11-20 11:50:53,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:53,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 11:50:53,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:53,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 11:50:53,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:50:53,340 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 97 [2022-11-20 11:50:53,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 82 transitions, 224 flow. Second operand has 14 states, 14 states have (on average 67.85714285714286) internal successors, (950), 14 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:53,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:50:53,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 97 [2022-11-20 11:50:53,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:50:54,157 INFO L130 PetriNetUnfolder]: 24/186 cut-off events. [2022-11-20 11:50:54,158 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-11-20 11:50:54,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 186 events. 24/186 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 485 event pairs, 10 based on Foata normal form. 1/184 useless extension candidates. Maximal degree in co-relation 321. Up to 41 conditions per place. [2022-11-20 11:50:54,160 INFO L137 encePairwiseOnDemand]: 82/97 looper letters, 25 selfloop transitions, 15 changer transitions 9/105 dead transitions. [2022-11-20 11:50:54,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 105 transitions, 370 flow [2022-11-20 11:50:54,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 11:50:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 11:50:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 908 transitions. [2022-11-20 11:50:54,165 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7200634417129262 [2022-11-20 11:50:54,165 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 908 transitions. [2022-11-20 11:50:54,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 908 transitions. [2022-11-20 11:50:54,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:50:54,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 908 transitions. [2022-11-20 11:50:54,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 69.84615384615384) internal successors, (908), 13 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:54,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:54,177 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:54,177 INFO L175 Difference]: Start difference. First operand has 105 places, 82 transitions, 224 flow. Second operand 13 states and 908 transitions. [2022-11-20 11:50:54,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 105 transitions, 370 flow [2022-11-20 11:50:54,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 105 transitions, 324 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-11-20 11:50:54,185 INFO L231 Difference]: Finished difference. Result has 107 places, 91 transitions, 263 flow [2022-11-20 11:50:54,186 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=263, PETRI_PLACES=107, PETRI_TRANSITIONS=91} [2022-11-20 11:50:54,189 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, 7 predicate places. [2022-11-20 11:50:54,189 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 263 flow [2022-11-20 11:50:54,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 67.85714285714286) internal successors, (950), 14 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:54,190 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:50:54,191 INFO L209 CegarLoopForPetriNet]: trace 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:54,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:50:54,192 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 11:50:54,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:54,193 INFO L85 PathProgramCache]: Analyzing trace with hash 956199284, now seen corresponding path program 2 times [2022-11-20 11:50:54,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:54,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797722099] [2022-11-20 11:50:54,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:54,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:54,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:54,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797722099] [2022-11-20 11:50:54,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797722099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:54,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:54,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 11:50:54,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235709537] [2022-11-20 11:50:54,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:54,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:50:54,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:54,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:50:54,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:50:54,716 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 97 [2022-11-20 11:50:54,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 91 transitions, 263 flow. Second operand has 8 states, 8 states have (on average 74.5) internal successors, (596), 8 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:54,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:50:54,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 97 [2022-11-20 11:50:54,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:50:55,002 INFO L130 PetriNetUnfolder]: 27/217 cut-off events. [2022-11-20 11:50:55,002 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-11-20 11:50:55,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 217 events. 27/217 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 718 event pairs, 6 based on Foata normal form. 1/215 useless extension candidates. Maximal degree in co-relation 435. Up to 35 conditions per place. [2022-11-20 11:50:55,004 INFO L137 encePairwiseOnDemand]: 89/97 looper letters, 18 selfloop transitions, 3 changer transitions 19/102 dead transitions. [2022-11-20 11:50:55,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 102 transitions, 385 flow [2022-11-20 11:50:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:50:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 11:50:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 609 transitions. [2022-11-20 11:50:55,008 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7847938144329897 [2022-11-20 11:50:55,008 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 609 transitions. [2022-11-20 11:50:55,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 609 transitions. [2022-11-20 11:50:55,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:50:55,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 609 transitions. [2022-11-20 11:50:55,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 76.125) internal successors, (609), 8 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:55,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:55,016 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:55,016 INFO L175 Difference]: Start difference. First operand has 107 places, 91 transitions, 263 flow. Second operand 8 states and 609 transitions. [2022-11-20 11:50:55,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 102 transitions, 385 flow [2022-11-20 11:50:55,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 102 transitions, 368 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-11-20 11:50:55,024 INFO L231 Difference]: Finished difference. Result has 110 places, 82 transitions, 218 flow [2022-11-20 11:50:55,024 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=218, PETRI_PLACES=110, PETRI_TRANSITIONS=82} [2022-11-20 11:50:55,027 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places. [2022-11-20 11:50:55,028 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 82 transitions, 218 flow [2022-11-20 11:50:55,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 74.5) internal successors, (596), 8 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:55,029 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:50:55,030 INFO L209 CegarLoopForPetriNet]: trace 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:55,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:50:55,030 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 11:50:55,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash 754902584, now seen corresponding path program 3 times [2022-11-20 11:50:55,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:55,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845119157] [2022-11-20 11:50:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:55,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:56,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:56,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845119157] [2022-11-20 11:50:56,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845119157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:56,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:56,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 11:50:56,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757043455] [2022-11-20 11:50:56,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:56,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 11:50:56,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:56,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:50:56,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:50:56,230 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 97 [2022-11-20 11:50:56,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 82 transitions, 218 flow. Second operand has 10 states, 10 states have (on average 73.1) internal successors, (731), 10 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:56,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:50:56,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 97 [2022-11-20 11:50:56,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:50:56,557 INFO L130 PetriNetUnfolder]: 5/130 cut-off events. [2022-11-20 11:50:56,558 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-11-20 11:50:56,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 130 events. 5/130 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 197 event pairs, 0 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 222. Up to 8 conditions per place. [2022-11-20 11:50:56,559 INFO L137 encePairwiseOnDemand]: 87/97 looper letters, 18 selfloop transitions, 5 changer transitions 8/92 dead transitions. [2022-11-20 11:50:56,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 92 transitions, 316 flow [2022-11-20 11:50:56,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:50:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 11:50:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 813 transitions. [2022-11-20 11:50:56,563 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7619493908153702 [2022-11-20 11:50:56,563 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 813 transitions. [2022-11-20 11:50:56,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 813 transitions. [2022-11-20 11:50:56,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:50:56,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 813 transitions. [2022-11-20 11:50:56,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 73.9090909090909) internal successors, (813), 11 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:56,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 97.0) internal successors, (1164), 12 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:56,571 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 97.0) internal successors, (1164), 12 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:56,571 INFO L175 Difference]: Start difference. First operand has 110 places, 82 transitions, 218 flow. Second operand 11 states and 813 transitions. [2022-11-20 11:50:56,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 92 transitions, 316 flow [2022-11-20 11:50:56,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 92 transitions, 272 flow, removed 17 selfloop flow, removed 11 redundant places. [2022-11-20 11:50:56,575 INFO L231 Difference]: Finished difference. Result has 106 places, 82 transitions, 208 flow [2022-11-20 11:50:56,575 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=208, PETRI_PLACES=106, PETRI_TRANSITIONS=82} [2022-11-20 11:50:56,576 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, 6 predicate places. [2022-11-20 11:50:56,576 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 82 transitions, 208 flow [2022-11-20 11:50:56,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 73.1) internal successors, (731), 10 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:56,577 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:50:56,578 INFO L209 CegarLoopForPetriNet]: trace 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:56,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:50:56,578 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 11:50:56,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:56,579 INFO L85 PathProgramCache]: Analyzing trace with hash -212770918, now seen corresponding path program 4 times [2022-11-20 11:50:56,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:56,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376294118] [2022-11-20 11:50:56,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:56,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:56,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:50:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:56,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:50:56,774 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 11:50:56,775 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-20 11:50:56,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-20 11:50:56,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-20 11:50:56,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-20 11:50:56,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-20 11:50:56,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:50:56,780 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2022-11-20 11:50:56,789 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 11:50:56,790 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:50:56,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:50:56 BasicIcfg [2022-11-20 11:50:56,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:50:56,940 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:50:56,940 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:50:56,940 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:50:56,941 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:50:46" (3/4) ... [2022-11-20 11:50:56,944 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 11:50:57,047 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 11:50:57,047 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:50:57,048 INFO L158 Benchmark]: Toolchain (without parser) took 12818.65ms. Allocated memory was 136.3MB in the beginning and 262.1MB in the end (delta: 125.8MB). Free memory was 90.3MB in the beginning and 180.7MB in the end (delta: -90.3MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2022-11-20 11:50:57,049 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 136.3MB. Free memory is still 76.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:50:57,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 853.30ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 90.3MB in the beginning and 150.1MB in the end (delta: -59.7MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2022-11-20 11:50:57,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.10ms. Allocated memory is still 180.4MB. Free memory was 150.0MB in the beginning and 150.2MB in the end (delta: -227.1kB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-11-20 11:50:57,050 INFO L158 Benchmark]: Boogie Preprocessor took 71.66ms. Allocated memory is still 180.4MB. Free memory was 150.2MB in the beginning and 148.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:50:57,051 INFO L158 Benchmark]: RCFGBuilder took 1130.79ms. Allocated memory is still 180.4MB. Free memory was 148.3MB in the beginning and 117.7MB in the end (delta: 30.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-20 11:50:57,051 INFO L158 Benchmark]: TraceAbstraction took 10562.02ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 116.9MB in the beginning and 196.4MB in the end (delta: -79.5MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2022-11-20 11:50:57,052 INFO L158 Benchmark]: Witness Printer took 107.93ms. Allocated memory is still 262.1MB. Free memory was 196.4MB in the beginning and 180.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-20 11:50:57,054 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.40ms. Allocated memory is still 136.3MB. Free memory is still 76.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 853.30ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 90.3MB in the beginning and 150.1MB in the end (delta: -59.7MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.10ms. Allocated memory is still 180.4MB. Free memory was 150.0MB in the beginning and 150.2MB in the end (delta: -227.1kB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.66ms. Allocated memory is still 180.4MB. Free memory was 150.2MB in the beginning and 148.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1130.79ms. Allocated memory is still 180.4MB. Free memory was 148.3MB in the beginning and 117.7MB in the end (delta: 30.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10562.02ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 116.9MB in the beginning and 196.4MB in the end (delta: -79.5MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Witness Printer took 107.93ms. Allocated memory is still 262.1MB. Free memory was 196.4MB in the beginning and 180.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L721] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L722] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L723] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L724] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L725] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L729] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L730] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L731] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L732] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L733] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L734] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] 0 pthread_t t305; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t305, ((void *)0), P0, ((void *)0))=-1, t305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] 0 pthread_t t306; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t306, ((void *)0), P1, ((void *)0))=0, t305={5:0}, t306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 116 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 252 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 352 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 287 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 751 IncrementalHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 65 mSDtfsCounter, 751 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=5, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 551 NumberOfCodeBlocks, 551 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 468 ConstructedInterpolants, 0 QuantifiedInterpolants, 2007 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-20 11:50:57,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1876c423-bff6-4d22-8881-72789436f274/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE