./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d676f87-5504-4435-818a-a50d8f46b47a/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d676f87-5504-4435-818a-a50d8f46b47a/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_9d676f87-5504-4435-818a-a50d8f46b47a/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d676f87-5504-4435-818a-a50d8f46b47a/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d676f87-5504-4435-818a-a50d8f46b47a/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_9d676f87-5504-4435-818a-a50d8f46b47a/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 ea86164637dd5d5bd9745ca8d3f5dc708b98bc3f75b645830d494ea6e5cae6ff --- 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 12:47:15,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:47:15,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:47:15,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:47:15,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:47:15,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:47:15,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:47:15,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:47:15,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:47:15,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:47:15,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:47:15,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:47:15,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:47:15,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:47:15,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:47:15,655 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:47:15,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:47:15,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:47:15,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:47:15,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:47:15,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:47:15,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:47:15,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:47:15,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:47:15,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:47:15,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:47:15,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:47:15,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:47:15,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:47:15,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:47:15,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:47:15,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:47:15,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:47:15,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:47:15,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:47:15,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:47:15,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:47:15,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:47:15,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:47:15,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:47:15,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:47:15,689 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d676f87-5504-4435-818a-a50d8f46b47a/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:47:15,717 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:47:15,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:47:15,718 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:47:15,718 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:47:15,719 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:47:15,719 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:47:15,720 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:47:15,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:47:15,721 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:47:15,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:47:15,722 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:47:15,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:47:15,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:47:15,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:47:15,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:47:15,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:47:15,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:47:15,724 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:47:15,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:47:15,724 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:47:15,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:47:15,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:47:15,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:47:15,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:47:15,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:47:15,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:47:15,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:47:15,727 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:47:15,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:47:15,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:47:15,728 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:47:15,728 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:47:15,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:47:15,729 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_9d676f87-5504-4435-818a-a50d8f46b47a/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_9d676f87-5504-4435-818a-a50d8f46b47a/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 -> ea86164637dd5d5bd9745ca8d3f5dc708b98bc3f75b645830d494ea6e5cae6ff [2022-11-20 12:47:16,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:47:16,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:47:16,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:47:16,096 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:47:16,097 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:47:16,098 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d676f87-5504-4435-818a-a50d8f46b47a/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-20 12:47:20,015 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:47:20,470 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:47:20,471 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d676f87-5504-4435-818a-a50d8f46b47a/sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-20 12:47:20,489 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d676f87-5504-4435-818a-a50d8f46b47a/bin/uautomizer-ug76WZFUDN/data/8a522ee17/28288018624e4ac9a6800b47ff4dd07d/FLAG901d53545 [2022-11-20 12:47:20,508 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d676f87-5504-4435-818a-a50d8f46b47a/bin/uautomizer-ug76WZFUDN/data/8a522ee17/28288018624e4ac9a6800b47ff4dd07d [2022-11-20 12:47:20,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:47:20,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:47:20,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:47:20,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:47:20,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:47:20,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:47:20" (1/1) ... [2022-11-20 12:47:20,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d4ff4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:20, skipping insertion in model container [2022-11-20 12:47:20,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:47:20" (1/1) ... [2022-11-20 12:47:20,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:47:20,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:47:20,829 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_9d676f87-5504-4435-818a-a50d8f46b47a/sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2022-11-20 12:47:21,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:47:21,198 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:47:21,219 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_9d676f87-5504-4435-818a-a50d8f46b47a/sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2022-11-20 12:47:21,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:47:21,395 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:47:21,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:21 WrapperNode [2022-11-20 12:47:21,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:47:21,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:47:21,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:47:21,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:47:21,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:21" (1/1) ... [2022-11-20 12:47:21,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:21" (1/1) ... [2022-11-20 12:47:21,511 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-11-20 12:47:21,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:47:21,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:47:21,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:47:21,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:47:21,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:21" (1/1) ... [2022-11-20 12:47:21,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:21" (1/1) ... [2022-11-20 12:47:21,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:21" (1/1) ... [2022-11-20 12:47:21,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:21" (1/1) ... [2022-11-20 12:47:21,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:21" (1/1) ... [2022-11-20 12:47:21,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:21" (1/1) ... [2022-11-20 12:47:21,581 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:21" (1/1) ... [2022-11-20 12:47:21,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:21" (1/1) ... [2022-11-20 12:47:21,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:47:21,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:47:21,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:47:21,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:47:21,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:21" (1/1) ... [2022-11-20 12:47:21,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:47:21,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d676f87-5504-4435-818a-a50d8f46b47a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:47:21,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d676f87-5504-4435-818a-a50d8f46b47a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:47:21,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d676f87-5504-4435-818a-a50d8f46b47a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:47:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:47:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:47:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:47:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:47:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:47:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 12:47:21,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 12:47:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 12:47:21,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 12:47:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 12:47:21,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 12:47:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:47:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:47:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:47:21,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:47:21,716 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 12:47:21,976 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:47:21,979 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:47:22,395 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:47:22,614 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:47:22,614 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:47:22,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:47:22 BoogieIcfgContainer [2022-11-20 12:47:22,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:47:22,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:47:22,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:47:22,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:47:22,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:47:20" (1/3) ... [2022-11-20 12:47:22,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43de7d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:47:22, skipping insertion in model container [2022-11-20 12:47:22,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:21" (2/3) ... [2022-11-20 12:47:22,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43de7d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:47:22, skipping insertion in model container [2022-11-20 12:47:22,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:47:22" (3/3) ... [2022-11-20 12:47:22,629 INFO L112 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-20 12:47:22,641 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:47:22,688 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:47:22,688 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 12:47:22,689 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:47:22,803 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:47:22,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-11-20 12:47:22,935 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-11-20 12:47:22,935 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:47:22,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-20 12:47:22,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-11-20 12:47:22,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-11-20 12:47:22,962 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:47:22,976 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;@48647212, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:47:22,978 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 12:47:23,003 INFO L130 PetriNetUnfolder]: 0/46 cut-off events. [2022-11-20 12:47:23,008 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:47:23,008 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:47:23,010 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] [2022-11-20 12:47:23,012 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:47:23,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:47:23,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1121896124, now seen corresponding path program 1 times [2022-11-20 12:47:23,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:47:23,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571054437] [2022-11-20 12:47:23,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:47:23,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:47:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:47:23,883 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 12:47:23,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:47:23,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571054437] [2022-11-20 12:47:23,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571054437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:47:23,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:47:23,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:47:23,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942665137] [2022-11-20 12:47:23,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:47:23,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:47:23,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:47:23,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:47:23,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:47:23,981 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 117 [2022-11-20 12:47:23,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 12:47:23,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:47:23,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 117 [2022-11-20 12:47:23,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:47:24,277 INFO L130 PetriNetUnfolder]: 58/278 cut-off events. [2022-11-20 12:47:24,277 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-20 12:47:24,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 278 events. 58/278 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1111 event pairs, 10 based on Foata normal form. 20/280 useless extension candidates. Maximal degree in co-relation 354. Up to 79 conditions per place. [2022-11-20 12:47:24,286 INFO L137 encePairwiseOnDemand]: 112/117 looper letters, 14 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2022-11-20 12:47:24,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 116 transitions, 279 flow [2022-11-20 12:47:24,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:47:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:47:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-11-20 12:47:24,314 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9401709401709402 [2022-11-20 12:47:24,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2022-11-20 12:47:24,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2022-11-20 12:47:24,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:47:24,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2022-11-20 12:47:24,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 12:47:24,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 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 12:47:24,350 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 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 12:47:24,352 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 237 flow. Second operand 3 states and 330 transitions. [2022-11-20 12:47:24,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 116 transitions, 279 flow [2022-11-20 12:47:24,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 274 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:47:24,376 INFO L231 Difference]: Finished difference. Result has 119 places, 110 transitions, 230 flow [2022-11-20 12:47:24,379 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2022-11-20 12:47:24,389 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, -3 predicate places. [2022-11-20 12:47:24,390 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 230 flow [2022-11-20 12:47:24,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 12:47:24,391 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:47:24,392 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] [2022-11-20 12:47:24,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:47:24,393 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:47:24,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:47:24,397 INFO L85 PathProgramCache]: Analyzing trace with hash -835230692, now seen corresponding path program 1 times [2022-11-20 12:47:24,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:47:24,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357441295] [2022-11-20 12:47:24,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:47:24,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:47:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:47:25,071 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 12:47:25,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:47:25,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357441295] [2022-11-20 12:47:25,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357441295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:47:25,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:47:25,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:47:25,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520168636] [2022-11-20 12:47:25,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:47:25,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:47:25,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:47:25,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:47:25,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:47:25,078 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2022-11-20 12:47:25,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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 12:47:25,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:47:25,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2022-11-20 12:47:25,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:47:27,036 INFO L130 PetriNetUnfolder]: 1856/4539 cut-off events. [2022-11-20 12:47:27,036 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-11-20 12:47:27,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7643 conditions, 4539 events. 1856/4539 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 37568 event pairs, 257 based on Foata normal form. 0/4414 useless extension candidates. Maximal degree in co-relation 7587. Up to 894 conditions per place. [2022-11-20 12:47:27,075 INFO L137 encePairwiseOnDemand]: 108/117 looper letters, 35 selfloop transitions, 5 changer transitions 87/202 dead transitions. [2022-11-20 12:47:27,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 202 transitions, 668 flow [2022-11-20 12:47:27,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:47:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:47:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1276 transitions. [2022-11-20 12:47:27,083 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8389217619986851 [2022-11-20 12:47:27,083 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1276 transitions. [2022-11-20 12:47:27,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1276 transitions. [2022-11-20 12:47:27,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:47:27,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1276 transitions. [2022-11-20 12:47:27,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.15384615384616) internal successors, (1276), 13 states have internal predecessors, (1276), 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 12:47:27,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 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 12:47:27,099 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 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 12:47:27,099 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 230 flow. Second operand 13 states and 1276 transitions. [2022-11-20 12:47:27,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 202 transitions, 668 flow [2022-11-20 12:47:27,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 202 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:47:27,109 INFO L231 Difference]: Finished difference. Result has 141 places, 101 transitions, 274 flow [2022-11-20 12:47:27,110 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=274, PETRI_PLACES=141, PETRI_TRANSITIONS=101} [2022-11-20 12:47:27,111 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 19 predicate places. [2022-11-20 12:47:27,111 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 101 transitions, 274 flow [2022-11-20 12:47:27,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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 12:47:27,113 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:47:27,114 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, 1, 1] [2022-11-20 12:47:27,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:47:27,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:47:27,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:47:27,116 INFO L85 PathProgramCache]: Analyzing trace with hash -234619783, now seen corresponding path program 1 times [2022-11-20 12:47:27,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:47:27,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840552788] [2022-11-20 12:47:27,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:47:27,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:47:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:47:27,491 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 12:47:27,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:47:27,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840552788] [2022-11-20 12:47:27,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840552788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:47:27,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:47:27,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:47:27,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258511464] [2022-11-20 12:47:27,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:47:27,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:47:27,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:47:27,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:47:27,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:47:27,497 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-11-20 12:47:27,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 101 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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 12:47:27,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:47:27,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-11-20 12:47:27,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:47:29,121 INFO L130 PetriNetUnfolder]: 2421/4657 cut-off events. [2022-11-20 12:47:29,122 INFO L131 PetriNetUnfolder]: For 3820/4101 co-relation queries the response was YES. [2022-11-20 12:47:29,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10480 conditions, 4657 events. 2421/4657 cut-off events. For 3820/4101 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 34709 event pairs, 205 based on Foata normal form. 14/4422 useless extension candidates. Maximal degree in co-relation 10415. Up to 1249 conditions per place. [2022-11-20 12:47:29,168 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 62 selfloop transitions, 15 changer transitions 18/175 dead transitions. [2022-11-20 12:47:29,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 175 transitions, 700 flow [2022-11-20 12:47:29,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:47:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:47:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1019 transitions. [2022-11-20 12:47:29,173 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.870940170940171 [2022-11-20 12:47:29,173 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1019 transitions. [2022-11-20 12:47:29,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1019 transitions. [2022-11-20 12:47:29,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:47:29,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1019 transitions. [2022-11-20 12:47:29,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.9) internal successors, (1019), 10 states have internal predecessors, (1019), 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 12:47:29,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 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 12:47:29,183 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 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 12:47:29,183 INFO L175 Difference]: Start difference. First operand has 141 places, 101 transitions, 274 flow. Second operand 10 states and 1019 transitions. [2022-11-20 12:47:29,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 175 transitions, 700 flow [2022-11-20 12:47:29,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 175 transitions, 686 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-20 12:47:29,198 INFO L231 Difference]: Finished difference. Result has 131 places, 114 transitions, 369 flow [2022-11-20 12:47:29,199 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=369, PETRI_PLACES=131, PETRI_TRANSITIONS=114} [2022-11-20 12:47:29,200 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 9 predicate places. [2022-11-20 12:47:29,200 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 114 transitions, 369 flow [2022-11-20 12:47:29,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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 12:47:29,201 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:47:29,201 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, 1, 1, 1, 1, 1] [2022-11-20 12:47:29,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:47:29,201 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:47:29,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:47:29,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1998021497, now seen corresponding path program 1 times [2022-11-20 12:47:29,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:47:29,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106400884] [2022-11-20 12:47:29,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:47:29,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:47:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:47:29,746 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 12:47:29,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:47:29,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106400884] [2022-11-20 12:47:29,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106400884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:47:29,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:47:29,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:47:29,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900076414] [2022-11-20 12:47:29,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:47:29,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:47:29,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:47:29,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:47:29,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:47:29,751 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-11-20 12:47:29,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 114 transitions, 369 flow. Second operand has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 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 12:47:29,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:47:29,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-11-20 12:47:29,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:47:31,527 INFO L130 PetriNetUnfolder]: 2139/4266 cut-off events. [2022-11-20 12:47:31,527 INFO L131 PetriNetUnfolder]: For 6429/6711 co-relation queries the response was YES. [2022-11-20 12:47:31,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12322 conditions, 4266 events. 2139/4266 cut-off events. For 6429/6711 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 33252 event pairs, 165 based on Foata normal form. 95/4210 useless extension candidates. Maximal degree in co-relation 12252. Up to 683 conditions per place. [2022-11-20 12:47:31,570 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 68 selfloop transitions, 28 changer transitions 36/212 dead transitions. [2022-11-20 12:47:31,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 212 transitions, 1109 flow [2022-11-20 12:47:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:47:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:47:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1326 transitions. [2022-11-20 12:47:31,576 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8717948717948718 [2022-11-20 12:47:31,576 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1326 transitions. [2022-11-20 12:47:31,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1326 transitions. [2022-11-20 12:47:31,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:47:31,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1326 transitions. [2022-11-20 12:47:31,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.0) internal successors, (1326), 13 states have internal predecessors, (1326), 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 12:47:31,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 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 12:47:31,589 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 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 12:47:31,589 INFO L175 Difference]: Start difference. First operand has 131 places, 114 transitions, 369 flow. Second operand 13 states and 1326 transitions. [2022-11-20 12:47:31,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 212 transitions, 1109 flow [2022-11-20 12:47:31,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 212 transitions, 1101 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-20 12:47:31,635 INFO L231 Difference]: Finished difference. Result has 145 places, 131 transitions, 587 flow [2022-11-20 12:47:31,635 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=587, PETRI_PLACES=145, PETRI_TRANSITIONS=131} [2022-11-20 12:47:31,637 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 23 predicate places. [2022-11-20 12:47:31,643 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 131 transitions, 587 flow [2022-11-20 12:47:31,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 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 12:47:31,644 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:47:31,644 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:47:31,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:47:31,645 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:47:31,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:47:31,646 INFO L85 PathProgramCache]: Analyzing trace with hash 799270612, now seen corresponding path program 1 times [2022-11-20 12:47:31,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:47:31,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417001361] [2022-11-20 12:47:31,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:47:31,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:47:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:47:32,994 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 12:47:32,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:47:32,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417001361] [2022-11-20 12:47:32,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417001361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:47:32,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:47:32,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:47:32,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293930175] [2022-11-20 12:47:32,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:47:32,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:47:32,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:47:32,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:47:32,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:47:32,999 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 117 [2022-11-20 12:47:33,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 131 transitions, 587 flow. Second operand has 9 states, 9 states have (on average 87.77777777777777) internal successors, (790), 9 states have internal predecessors, (790), 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 12:47:33,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:47:33,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 117 [2022-11-20 12:47:33,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:47:34,198 INFO L130 PetriNetUnfolder]: 542/2393 cut-off events. [2022-11-20 12:47:34,198 INFO L131 PetriNetUnfolder]: For 5246/5721 co-relation queries the response was YES. [2022-11-20 12:47:34,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7284 conditions, 2393 events. 542/2393 cut-off events. For 5246/5721 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 24697 event pairs, 18 based on Foata normal form. 12/2296 useless extension candidates. Maximal degree in co-relation 7202. Up to 438 conditions per place. [2022-11-20 12:47:34,254 INFO L137 encePairwiseOnDemand]: 100/117 looper letters, 48 selfloop transitions, 38 changer transitions 18/205 dead transitions. [2022-11-20 12:47:34,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 205 transitions, 1100 flow [2022-11-20 12:47:34,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:47:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 12:47:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1120 transitions. [2022-11-20 12:47:34,271 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7977207977207977 [2022-11-20 12:47:34,285 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1120 transitions. [2022-11-20 12:47:34,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1120 transitions. [2022-11-20 12:47:34,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:47:34,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1120 transitions. [2022-11-20 12:47:34,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 93.33333333333333) internal successors, (1120), 12 states have internal predecessors, (1120), 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 12:47:34,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 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 12:47:34,295 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 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 12:47:34,295 INFO L175 Difference]: Start difference. First operand has 145 places, 131 transitions, 587 flow. Second operand 12 states and 1120 transitions. [2022-11-20 12:47:34,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 205 transitions, 1100 flow [2022-11-20 12:47:34,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 205 transitions, 1040 flow, removed 23 selfloop flow, removed 4 redundant places. [2022-11-20 12:47:34,463 INFO L231 Difference]: Finished difference. Result has 161 places, 166 transitions, 849 flow [2022-11-20 12:47:34,464 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=849, PETRI_PLACES=161, PETRI_TRANSITIONS=166} [2022-11-20 12:47:34,465 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 39 predicate places. [2022-11-20 12:47:34,465 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 166 transitions, 849 flow [2022-11-20 12:47:34,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.77777777777777) internal successors, (790), 9 states have internal predecessors, (790), 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 12:47:34,466 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:47:34,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:47:34,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:47:34,467 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:47:34,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:47:34,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1604939384, now seen corresponding path program 2 times [2022-11-20 12:47:34,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:47:34,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321850948] [2022-11-20 12:47:34,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:47:34,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:47:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:47:34,918 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 12:47:34,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:47:34,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321850948] [2022-11-20 12:47:34,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321850948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:47:34,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:47:34,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:47:34,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462301412] [2022-11-20 12:47:34,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:47:34,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:47:34,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:47:34,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:47:34,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:47:34,924 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-11-20 12:47:34,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 166 transitions, 849 flow. Second operand has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 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 12:47:34,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:47:34,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-11-20 12:47:34,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:47:35,881 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L798-->L814: Formula: (let ((.cse4 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_126 256) 0)) (.cse7 (and (= (mod v_~z$w_buff1_used~0_111 256) 0) .cse9)) (.cse8 (and .cse9 .cse4))) (let ((.cse1 (or .cse11 .cse7 .cse8)) (.cse2 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse5 (= (mod v_~z$w_buff1_used~0_110 256) 0)) (.cse6 (= (mod v_~z$w_buff0_used~0_125 256) 0))) (and (= v_~z$w_buff0_used~0_125 (ite .cse0 v_~z$w_buff0_used~0_126 (ite .cse1 v_~z$w_buff0_used~0_126 (ite .cse2 0 v_~z$w_buff0_used~0_126)))) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse3 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse3 .cse4) (and .cse3 .cse5) .cse6)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49) (= (ite .cse0 v_~z$w_buff1_used~0_111 (ite (or .cse7 .cse8 .cse6) v_~z$w_buff1_used~0_111 0)) v_~z$w_buff1_used~0_110) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or .cse8 .cse6 (and .cse9 .cse5)) v_~z$r_buff0_thd3~0_58 (ite (and .cse10 (not .cse6)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_126, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z~0=v_~z~0_62} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_125, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][160], [105#L814true, Black: 201#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 195#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 96#L755true, Black: 213#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 103#L778true, Black: 191#true, Black: 209#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 154#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 135#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(= ~__unbuffered_p2_EAX~0 0), 132#true, Black: 150#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 235#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0)) (= ~z$w_buff0_used~0 0)), 179#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 231#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~z~0 0)), Black: 224#(and (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 ~z~0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 241#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 233#(and (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 ~z~0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0)), 221#true, Black: 226#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 239#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork0InUse, Black: 171#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 223#(= ~z~0 0), Black: 183#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P1Thread1of1ForFork2InUse, Black: 175#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 168#true, P0Thread1of1ForFork1InUse, 55#L3true]) [2022-11-20 12:47:35,881 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-11-20 12:47:35,881 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-20 12:47:35,882 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-20 12:47:35,886 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-20 12:47:36,032 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L798-->L814: Formula: (let ((.cse4 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_126 256) 0)) (.cse7 (and (= (mod v_~z$w_buff1_used~0_111 256) 0) .cse9)) (.cse8 (and .cse9 .cse4))) (let ((.cse1 (or .cse11 .cse7 .cse8)) (.cse2 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse5 (= (mod v_~z$w_buff1_used~0_110 256) 0)) (.cse6 (= (mod v_~z$w_buff0_used~0_125 256) 0))) (and (= v_~z$w_buff0_used~0_125 (ite .cse0 v_~z$w_buff0_used~0_126 (ite .cse1 v_~z$w_buff0_used~0_126 (ite .cse2 0 v_~z$w_buff0_used~0_126)))) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse3 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse3 .cse4) (and .cse3 .cse5) .cse6)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49) (= (ite .cse0 v_~z$w_buff1_used~0_111 (ite (or .cse7 .cse8 .cse6) v_~z$w_buff1_used~0_111 0)) v_~z$w_buff1_used~0_110) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or .cse8 .cse6 (and .cse9 .cse5)) v_~z$r_buff0_thd3~0_58 (ite (and .cse10 (not .cse6)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_126, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z~0=v_~z~0_62} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_125, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][160], [105#L814true, Black: 201#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 195#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 96#L755true, Black: 213#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 207#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 103#L778true, Black: 191#true, Black: 209#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 146#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 154#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 135#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 134#(= ~__unbuffered_p2_EAX~0 0), 132#true, Black: 150#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 117#L3-1true, Black: 235#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0)) (= ~z$w_buff0_used~0 0)), 179#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 231#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~z~0 0)), Black: 224#(and (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 ~z~0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 241#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 233#(and (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 ~z~0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0)), 221#true, Black: 226#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 239#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 223#(= ~z~0 0), Black: 171#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 183#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P1Thread1of1ForFork2InUse, Black: 175#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 168#true, P0Thread1of1ForFork1InUse]) [2022-11-20 12:47:36,032 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-11-20 12:47:36,033 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-20 12:47:36,033 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-20 12:47:36,033 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-20 12:47:36,749 INFO L130 PetriNetUnfolder]: 2355/4858 cut-off events. [2022-11-20 12:47:36,749 INFO L131 PetriNetUnfolder]: For 12847/13576 co-relation queries the response was YES. [2022-11-20 12:47:36,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17886 conditions, 4858 events. 2355/4858 cut-off events. For 12847/13576 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 40052 event pairs, 116 based on Foata normal form. 182/4863 useless extension candidates. Maximal degree in co-relation 17852. Up to 662 conditions per place. [2022-11-20 12:47:36,815 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 89 selfloop transitions, 28 changer transitions 68/285 dead transitions. [2022-11-20 12:47:36,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 285 transitions, 1993 flow [2022-11-20 12:47:36,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 12:47:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-20 12:47:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1592 transitions. [2022-11-20 12:47:36,822 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8504273504273504 [2022-11-20 12:47:36,822 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1592 transitions. [2022-11-20 12:47:36,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1592 transitions. [2022-11-20 12:47:36,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:47:36,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1592 transitions. [2022-11-20 12:47:36,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 99.5) internal successors, (1592), 16 states have internal predecessors, (1592), 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 12:47:36,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 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 12:47:36,838 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 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 12:47:36,838 INFO L175 Difference]: Start difference. First operand has 161 places, 166 transitions, 849 flow. Second operand 16 states and 1592 transitions. [2022-11-20 12:47:36,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 285 transitions, 1993 flow [2022-11-20 12:47:36,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 285 transitions, 1915 flow, removed 36 selfloop flow, removed 4 redundant places. [2022-11-20 12:47:36,971 INFO L231 Difference]: Finished difference. Result has 176 places, 163 transitions, 866 flow [2022-11-20 12:47:36,972 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=866, PETRI_PLACES=176, PETRI_TRANSITIONS=163} [2022-11-20 12:47:36,975 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 54 predicate places. [2022-11-20 12:47:36,976 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 163 transitions, 866 flow [2022-11-20 12:47:36,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 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 12:47:36,976 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:47:36,977 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:47:36,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:47:36,979 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:47:36,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:47:36,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1146705853, now seen corresponding path program 1 times [2022-11-20 12:47:36,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:47:36,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028502132] [2022-11-20 12:47:36,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:47:36,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:47:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:47:39,149 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 12:47:39,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:47:39,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028502132] [2022-11-20 12:47:39,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028502132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:47:39,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:47:39,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 12:47:39,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478716096] [2022-11-20 12:47:39,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:47:39,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 12:47:39,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:47:39,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 12:47:39,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:47:39,161 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 117 [2022-11-20 12:47:39,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 163 transitions, 866 flow. Second operand has 12 states, 12 states have (on average 89.08333333333333) internal successors, (1069), 12 states have internal predecessors, (1069), 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 12:47:39,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:47:39,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 117 [2022-11-20 12:47:39,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:47:39,936 INFO L130 PetriNetUnfolder]: 300/1865 cut-off events. [2022-11-20 12:47:39,936 INFO L131 PetriNetUnfolder]: For 4489/4556 co-relation queries the response was YES. [2022-11-20 12:47:39,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 1865 events. 300/1865 cut-off events. For 4489/4556 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 20205 event pairs, 4 based on Foata normal form. 7/1786 useless extension candidates. Maximal degree in co-relation 5776. Up to 239 conditions per place. [2022-11-20 12:47:39,964 INFO L137 encePairwiseOnDemand]: 106/117 looper letters, 38 selfloop transitions, 8 changer transitions 20/183 dead transitions. [2022-11-20 12:47:39,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 183 transitions, 1082 flow [2022-11-20 12:47:39,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:47:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 12:47:39,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1086 transitions. [2022-11-20 12:47:39,969 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7735042735042735 [2022-11-20 12:47:39,969 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1086 transitions. [2022-11-20 12:47:39,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1086 transitions. [2022-11-20 12:47:39,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:47:39,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1086 transitions. [2022-11-20 12:47:39,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 90.5) internal successors, (1086), 12 states have internal predecessors, (1086), 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 12:47:39,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 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 12:47:39,979 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 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 12:47:39,980 INFO L175 Difference]: Start difference. First operand has 176 places, 163 transitions, 866 flow. Second operand 12 states and 1086 transitions. [2022-11-20 12:47:39,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 183 transitions, 1082 flow [2022-11-20 12:47:40,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 183 transitions, 962 flow, removed 30 selfloop flow, removed 18 redundant places. [2022-11-20 12:47:40,063 INFO L231 Difference]: Finished difference. Result has 171 places, 154 transitions, 735 flow [2022-11-20 12:47:40,064 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=735, PETRI_PLACES=171, PETRI_TRANSITIONS=154} [2022-11-20 12:47:40,065 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 49 predicate places. [2022-11-20 12:47:40,065 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 154 transitions, 735 flow [2022-11-20 12:47:40,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 89.08333333333333) internal successors, (1069), 12 states have internal predecessors, (1069), 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 12:47:40,066 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:47:40,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:47:40,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:47:40,072 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:47:40,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:47:40,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1493331445, now seen corresponding path program 2 times [2022-11-20 12:47:40,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:47:40,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136846182] [2022-11-20 12:47:40,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:47:40,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:47:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:47:40,577 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 12:47:40,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:47:40,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136846182] [2022-11-20 12:47:40,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136846182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:47:40,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:47:40,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:47:40,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868322361] [2022-11-20 12:47:40,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:47:40,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:47:40,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:47:40,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:47:40,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:47:40,582 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 117 [2022-11-20 12:47:40,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 154 transitions, 735 flow. Second operand has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 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 12:47:40,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:47:40,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 117 [2022-11-20 12:47:40,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:47:41,470 INFO L130 PetriNetUnfolder]: 456/2715 cut-off events. [2022-11-20 12:47:41,470 INFO L131 PetriNetUnfolder]: For 3728/3745 co-relation queries the response was YES. [2022-11-20 12:47:41,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7286 conditions, 2715 events. 456/2715 cut-off events. For 3728/3745 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 32112 event pairs, 25 based on Foata normal form. 1/2594 useless extension candidates. Maximal degree in co-relation 7254. Up to 306 conditions per place. [2022-11-20 12:47:41,505 INFO L137 encePairwiseOnDemand]: 104/117 looper letters, 31 selfloop transitions, 15 changer transitions 55/201 dead transitions. [2022-11-20 12:47:41,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 201 transitions, 1231 flow [2022-11-20 12:47:41,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:47:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:47:41,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 847 transitions. [2022-11-20 12:47:41,508 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8043684710351378 [2022-11-20 12:47:41,509 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 847 transitions. [2022-11-20 12:47:41,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 847 transitions. [2022-11-20 12:47:41,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:47:41,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 847 transitions. [2022-11-20 12:47:41,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.11111111111111) internal successors, (847), 9 states have internal predecessors, (847), 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 12:47:41,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 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 12:47:41,516 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 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 12:47:41,516 INFO L175 Difference]: Start difference. First operand has 171 places, 154 transitions, 735 flow. Second operand 9 states and 847 transitions. [2022-11-20 12:47:41,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 201 transitions, 1231 flow [2022-11-20 12:47:41,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 201 transitions, 1177 flow, removed 10 selfloop flow, removed 11 redundant places. [2022-11-20 12:47:41,631 INFO L231 Difference]: Finished difference. Result has 166 places, 139 transitions, 656 flow [2022-11-20 12:47:41,632 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=656, PETRI_PLACES=166, PETRI_TRANSITIONS=139} [2022-11-20 12:47:41,636 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 44 predicate places. [2022-11-20 12:47:41,636 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 139 transitions, 656 flow [2022-11-20 12:47:41,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 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 12:47:41,637 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:47:41,637 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:47:41,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:47:41,638 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:47:41,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:47:41,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1221526157, now seen corresponding path program 3 times [2022-11-20 12:47:41,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:47:41,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500080643] [2022-11-20 12:47:41,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:47:41,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:47:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:47:42,146 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 12:47:42,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:47:42,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500080643] [2022-11-20 12:47:42,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500080643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:47:42,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:47:42,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:47:42,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904663824] [2022-11-20 12:47:42,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:47:42,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:47:42,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:47:42,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:47:42,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:47:42,150 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2022-11-20 12:47:42,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 139 transitions, 656 flow. Second operand has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 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 12:47:42,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:47:42,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2022-11-20 12:47:42,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:47:42,894 INFO L130 PetriNetUnfolder]: 201/1530 cut-off events. [2022-11-20 12:47:42,895 INFO L131 PetriNetUnfolder]: For 1992/2009 co-relation queries the response was YES. [2022-11-20 12:47:42,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3967 conditions, 1530 events. 201/1530 cut-off events. For 1992/2009 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16041 event pairs, 11 based on Foata normal form. 2/1475 useless extension candidates. Maximal degree in co-relation 3935. Up to 169 conditions per place. [2022-11-20 12:47:42,909 INFO L137 encePairwiseOnDemand]: 106/117 looper letters, 24 selfloop transitions, 7 changer transitions 28/161 dead transitions. [2022-11-20 12:47:42,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 161 transitions, 874 flow [2022-11-20 12:47:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:47:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 12:47:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1030 transitions. [2022-11-20 12:47:42,914 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8003108003108003 [2022-11-20 12:47:42,914 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1030 transitions. [2022-11-20 12:47:42,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1030 transitions. [2022-11-20 12:47:42,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:47:42,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1030 transitions. [2022-11-20 12:47:42,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.63636363636364) internal successors, (1030), 11 states have internal predecessors, (1030), 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 12:47:42,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 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 12:47:42,925 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 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 12:47:42,925 INFO L175 Difference]: Start difference. First operand has 166 places, 139 transitions, 656 flow. Second operand 11 states and 1030 transitions. [2022-11-20 12:47:42,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 161 transitions, 874 flow [2022-11-20 12:47:42,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 161 transitions, 824 flow, removed 18 selfloop flow, removed 7 redundant places. [2022-11-20 12:47:42,966 INFO L231 Difference]: Finished difference. Result has 173 places, 129 transitions, 571 flow [2022-11-20 12:47:42,967 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=571, PETRI_PLACES=173, PETRI_TRANSITIONS=129} [2022-11-20 12:47:42,968 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 51 predicate places. [2022-11-20 12:47:42,969 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 129 transitions, 571 flow [2022-11-20 12:47:42,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 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 12:47:42,969 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:47:42,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:47:42,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:47:42,970 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 12:47:42,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:47:42,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1788399041, now seen corresponding path program 4 times [2022-11-20 12:47:42,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:47:42,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144536615] [2022-11-20 12:47:42,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:47:42,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:47:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:47:43,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:47:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:47:43,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:47:43,218 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:47:43,220 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-20 12:47:43,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-20 12:47:43,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-20 12:47:43,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-20 12:47:43,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-20 12:47:43,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-20 12:47:43,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:47:43,235 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2022-11-20 12:47:43,245 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 12:47:43,245 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:47:43,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:47:43 BasicIcfg [2022-11-20 12:47:43,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:47:43,452 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:47:43,452 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:47:43,452 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:47:43,453 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:47:22" (3/4) ... [2022-11-20 12:47:43,455 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 12:47:43,629 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d676f87-5504-4435-818a-a50d8f46b47a/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:47:43,630 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:47:43,631 INFO L158 Benchmark]: Toolchain (without parser) took 23118.21ms. Allocated memory was 161.5MB in the beginning and 702.5MB in the end (delta: 541.1MB). Free memory was 129.3MB in the beginning and 442.1MB in the end (delta: -312.8MB). Peak memory consumption was 230.4MB. Max. memory is 16.1GB. [2022-11-20 12:47:43,632 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 93.3MB in the end (delta: 75.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:47:43,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 881.93ms. Allocated memory is still 161.5MB. Free memory was 128.9MB in the beginning and 106.0MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 12:47:43,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.59ms. Allocated memory is still 161.5MB. Free memory was 106.0MB in the beginning and 103.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:47:43,633 INFO L158 Benchmark]: Boogie Preprocessor took 74.67ms. Allocated memory is still 161.5MB. Free memory was 103.5MB in the beginning and 101.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:47:43,633 INFO L158 Benchmark]: RCFGBuilder took 1029.81ms. Allocated memory is still 161.5MB. Free memory was 101.8MB in the beginning and 67.0MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-20 12:47:43,634 INFO L158 Benchmark]: TraceAbstraction took 20830.90ms. Allocated memory was 161.5MB in the beginning and 702.5MB in the end (delta: 541.1MB). Free memory was 66.6MB in the beginning and 466.2MB in the end (delta: -399.6MB). Peak memory consumption was 144.4MB. Max. memory is 16.1GB. [2022-11-20 12:47:43,635 INFO L158 Benchmark]: Witness Printer took 178.64ms. Allocated memory is still 702.5MB. Free memory was 466.2MB in the beginning and 442.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 12:47:43,638 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.32ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 93.3MB in the end (delta: 75.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 881.93ms. Allocated memory is still 161.5MB. Free memory was 128.9MB in the beginning and 106.0MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.59ms. Allocated memory is still 161.5MB. Free memory was 106.0MB in the beginning and 103.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.67ms. Allocated memory is still 161.5MB. Free memory was 103.5MB in the beginning and 101.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1029.81ms. Allocated memory is still 161.5MB. Free memory was 101.8MB in the beginning and 67.0MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20830.90ms. Allocated memory was 161.5MB in the beginning and 702.5MB in the end (delta: 541.1MB). Free memory was 66.6MB in the beginning and 466.2MB in the end (delta: -399.6MB). Peak memory consumption was 144.4MB. Max. memory is 16.1GB. * Witness Printer took 178.64ms. Allocated memory is still 702.5MB. Free memory was 466.2MB in the beginning and 442.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L724] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L725] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L726] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L727] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L728] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L729] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L730] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L731] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L732] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L733] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L734] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L735] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L736] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L737] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L738] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L739] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t657; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t657, ((void *)0), P0, ((void *)0))=-2, t657={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t658; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, t658={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t658, ((void *)0), P1, ((void *)0))=-1, t657={5:0}, t658={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t659; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t659, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t659, ((void *)0), P2, ((void *)0))=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0: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=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$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: 843]: 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: 841]: 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: 839]: 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 7 procedures, 145 locations, 6 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: 20.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 661 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 661 mSDsluCounter, 593 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 478 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1369 IncrementalHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 115 mSDtfsCounter, 1369 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=866occurred in iteration=6, InterpolantAutomatonStates: 99, 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.9s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 816 NumberOfCodeBlocks, 816 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 716 ConstructedInterpolants, 0 QuantifiedInterpolants, 3987 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 12:47:43,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d676f87-5504-4435-818a-a50d8f46b47a/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