./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_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_8630f921-427f-46a1-96e8-26b2e1becd60/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8630f921-427f-46a1-96e8-26b2e1becd60/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_8630f921-427f-46a1-96e8-26b2e1becd60/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8630f921-427f-46a1-96e8-26b2e1becd60/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8630f921-427f-46a1-96e8-26b2e1becd60/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_8630f921-427f-46a1-96e8-26b2e1becd60/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 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 --- 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:30:44,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:30:44,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:30:44,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:30:44,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:30:44,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:30:44,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:30:44,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:30:44,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:30:44,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:30:44,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:30:44,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:30:44,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:30:44,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:30:44,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:30:44,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:30:44,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:30:44,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:30:44,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:30:44,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:30:44,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:30:44,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:30:44,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:30:44,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:30:44,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:30:44,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:30:44,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:30:44,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:30:44,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:30:44,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:30:44,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:30:44,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:30:44,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:30:44,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:30:44,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:30:44,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:30:44,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:30:44,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:30:44,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:30:44,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:30:44,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:30:44,703 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8630f921-427f-46a1-96e8-26b2e1becd60/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:30:44,745 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:30:44,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:30:44,753 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:30:44,753 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:30:44,754 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:30:44,754 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:30:44,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:30:44,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:30:44,756 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:30:44,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:30:44,758 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:30:44,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:30:44,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:30:44,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:30:44,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:30:44,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:30:44,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:30:44,760 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:30:44,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:30:44,760 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:30:44,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:30:44,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:30:44,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:30:44,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:30:44,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:30:44,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:30:44,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:30:44,763 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:30:44,763 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:30:44,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:30:44,764 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:30:44,764 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:30:44,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:30:44,765 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_8630f921-427f-46a1-96e8-26b2e1becd60/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_8630f921-427f-46a1-96e8-26b2e1becd60/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 -> 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 [2022-11-20 12:30:45,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:30:45,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:30:45,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:30:45,126 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:30:45,127 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:30:45,129 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8630f921-427f-46a1-96e8-26b2e1becd60/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2022-11-20 12:30:48,412 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:30:48,721 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:30:48,727 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8630f921-427f-46a1-96e8-26b2e1becd60/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2022-11-20 12:30:48,746 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8630f921-427f-46a1-96e8-26b2e1becd60/bin/uautomizer-ug76WZFUDN/data/d754169de/91384b3c09f846c58d084de7059f5daf/FLAG5ae62e1b9 [2022-11-20 12:30:48,762 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8630f921-427f-46a1-96e8-26b2e1becd60/bin/uautomizer-ug76WZFUDN/data/d754169de/91384b3c09f846c58d084de7059f5daf [2022-11-20 12:30:48,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:30:48,766 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:30:48,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:30:48,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:30:48,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:30:48,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:30:48" (1/1) ... [2022-11-20 12:30:48,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e823520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:48, skipping insertion in model container [2022-11-20 12:30:48,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:30:48" (1/1) ... [2022-11-20 12:30:48,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:30:48,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:30:49,024 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_8630f921-427f-46a1-96e8-26b2e1becd60/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014] [2022-11-20 12:30:49,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:30:49,396 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:30:49,417 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_8630f921-427f-46a1-96e8-26b2e1becd60/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014] [2022-11-20 12:30:49,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:30:49,575 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:30:49,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:49 WrapperNode [2022-11-20 12:30:49,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:30:49,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:30:49,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:30:49,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:30:49,589 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:30:49" (1/1) ... [2022-11-20 12:30:49,640 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:30:49" (1/1) ... [2022-11-20 12:30:49,690 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-20 12:30:49,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:30:49,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:30:49,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:30:49,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:30:49,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:49" (1/1) ... [2022-11-20 12:30:49,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:49" (1/1) ... [2022-11-20 12:30:49,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:49" (1/1) ... [2022-11-20 12:30:49,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:49" (1/1) ... [2022-11-20 12:30:49,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:49" (1/1) ... [2022-11-20 12:30:49,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:49" (1/1) ... [2022-11-20 12:30:49,752 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:49" (1/1) ... [2022-11-20 12:30:49,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:49" (1/1) ... [2022-11-20 12:30:49,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:30:49,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:30:49,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:30:49,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:30:49,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:49" (1/1) ... [2022-11-20 12:30:49,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:30:49,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8630f921-427f-46a1-96e8-26b2e1becd60/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:30:49,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8630f921-427f-46a1-96e8-26b2e1becd60/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:30:49,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8630f921-427f-46a1-96e8-26b2e1becd60/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:30:49,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:30:49,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:30:49,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:30:49,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:30:49,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:30:49,884 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 12:30:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 12:30:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 12:30:49,886 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 12:30:49,887 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 12:30:49,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 12:30:49,887 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-20 12:30:49,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-20 12:30:49,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:30:49,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:30:49,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:30:49,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:30:49,890 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:30:50,101 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:30:50,104 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:30:50,681 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:30:50,852 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:30:50,852 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:30:50,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:30:50 BoogieIcfgContainer [2022-11-20 12:30:50,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:30:50,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:30:50,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:30:50,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:30:50,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:30:48" (1/3) ... [2022-11-20 12:30:50,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556af773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:30:50, skipping insertion in model container [2022-11-20 12:30:50,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:49" (2/3) ... [2022-11-20 12:30:50,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556af773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:30:50, skipping insertion in model container [2022-11-20 12:30:50,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:30:50" (3/3) ... [2022-11-20 12:30:50,868 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2022-11-20 12:30:50,880 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:30:50,909 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:30:50,909 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 12:30:50,909 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:30:51,039 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 12:30:51,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-20 12:30:51,198 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-20 12:30:51,199 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:30:51,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-20 12:30:51,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-11-20 12:30:51,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-11-20 12:30:51,239 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:30:51,249 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;@c67618d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:30:51,249 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-20 12:30:51,287 INFO L130 PetriNetUnfolder]: 0/63 cut-off events. [2022-11-20 12:30:51,287 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:30:51,287 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:30:51,288 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] [2022-11-20 12:30:51,289 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:30:51,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:51,304 INFO L85 PathProgramCache]: Analyzing trace with hash -409989150, now seen corresponding path program 1 times [2022-11-20 12:30:51,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:30:51,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083939030] [2022-11-20 12:30:51,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:51,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:30:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:52,110 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:30:52,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:30:52,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083939030] [2022-11-20 12:30:52,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083939030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:30:52,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:30:52,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:30:52,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210885378] [2022-11-20 12:30:52,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:30:52,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:30:52,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:30:52,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:30:52,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:30:52,175 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 137 [2022-11-20 12:30:52,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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:30:52,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:30:52,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 137 [2022-11-20 12:30:52,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:30:52,592 INFO L130 PetriNetUnfolder]: 109/538 cut-off events. [2022-11-20 12:30:52,606 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-11-20 12:30:52,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 764 conditions, 538 events. 109/538 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2717 event pairs, 67 based on Foata normal form. 22/515 useless extension candidates. Maximal degree in co-relation 706. Up to 131 conditions per place. [2022-11-20 12:30:52,616 INFO L137 encePairwiseOnDemand]: 132/137 looper letters, 15 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2022-11-20 12:30:52,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 135 transitions, 322 flow [2022-11-20 12:30:52,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:30:52,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:30:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2022-11-20 12:30:52,650 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9440389294403893 [2022-11-20 12:30:52,651 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2022-11-20 12:30:52,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2022-11-20 12:30:52,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:30:52,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2022-11-20 12:30:52,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:30:52,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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:30:52,681 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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:30:52,683 INFO L175 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 388 transitions. [2022-11-20 12:30:52,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 135 transitions, 322 flow [2022-11-20 12:30:52,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 135 transitions, 316 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 12:30:52,695 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2022-11-20 12:30:52,699 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2022-11-20 12:30:52,707 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2022-11-20 12:30:52,707 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2022-11-20 12:30:52,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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:30:52,708 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:30:52,709 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:30:52,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:30:52,709 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:30:52,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:52,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1147453847, now seen corresponding path program 1 times [2022-11-20 12:30:52,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:30:52,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949715626] [2022-11-20 12:30:52,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:52,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:30:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:53,449 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:30:53,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:30:53,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949715626] [2022-11-20 12:30:53,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949715626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:30:53,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:30:53,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:30:53,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669941451] [2022-11-20 12:30:53,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:30:53,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:30:53,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:30:53,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:30:53,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:30:53,457 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2022-11-20 12:30:53,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 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:30:53,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:30:53,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2022-11-20 12:30:53,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:30:56,851 INFO L130 PetriNetUnfolder]: 4676/10347 cut-off events. [2022-11-20 12:30:56,852 INFO L131 PetriNetUnfolder]: For 482/482 co-relation queries the response was YES. [2022-11-20 12:30:56,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17515 conditions, 10347 events. 4676/10347 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 94007 event pairs, 530 based on Foata normal form. 0/10131 useless extension candidates. Maximal degree in co-relation 17454. Up to 2267 conditions per place. [2022-11-20 12:30:56,946 INFO L137 encePairwiseOnDemand]: 127/137 looper letters, 39 selfloop transitions, 6 changer transitions 98/232 dead transitions. [2022-11-20 12:30:56,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 232 transitions, 758 flow [2022-11-20 12:30:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:30:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:30:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1511 transitions. [2022-11-20 12:30:56,953 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8483997754070747 [2022-11-20 12:30:56,953 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1511 transitions. [2022-11-20 12:30:56,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1511 transitions. [2022-11-20 12:30:56,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:30:56,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1511 transitions. [2022-11-20 12:30:56,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.23076923076923) internal successors, (1511), 13 states have internal predecessors, (1511), 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:30:56,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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:30:56,969 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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:30:56,969 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 13 states and 1511 transitions. [2022-11-20 12:30:56,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 232 transitions, 758 flow [2022-11-20 12:30:56,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 232 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:30:56,980 INFO L231 Difference]: Finished difference. Result has 162 places, 119 transitions, 324 flow [2022-11-20 12:30:56,981 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=324, PETRI_PLACES=162, PETRI_TRANSITIONS=119} [2022-11-20 12:30:56,982 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 18 predicate places. [2022-11-20 12:30:56,984 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 119 transitions, 324 flow [2022-11-20 12:30:56,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 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:30:56,985 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:30:56,985 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] [2022-11-20 12:30:56,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:30:56,986 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:30:56,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:56,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1950920449, now seen corresponding path program 1 times [2022-11-20 12:30:56,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:30:56,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980065311] [2022-11-20 12:30:56,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:56,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:30:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:57,433 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:30:57,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:30:57,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980065311] [2022-11-20 12:30:57,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980065311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:30:57,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:30:57,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:30:57,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881696730] [2022-11-20 12:30:57,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:30:57,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:30:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:30:57,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:30:57,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:30:57,438 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-11-20 12:30:57,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 119 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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:30:57,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:30:57,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-11-20 12:30:57,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:31:00,050 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L795-->L802: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_39 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_28 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_103 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_102 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_103)) (= (ite .cse2 v_~x$w_buff0~0_39 (ite .cse0 v_~x$w_buff1~0_32 v_~x~0_49)) v_~x~0_48) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_39) v_~x$r_buff0_thd2~0_38) (= v_~x$r_buff1_thd2~0_27 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_38 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_102 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_28)) (= v_~x$w_buff0_used~0_109 (ite .cse2 0 v_~x$w_buff0_used~0_110))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_39, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_38, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][140], [32#L838true, 88#L872true, 191#true, 155#true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork3InUse, Black: 175#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 7#L775true, Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 98#L802true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 68#L825true, Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-20 12:31:00,051 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-20 12:31:00,051 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-20 12:31:00,052 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-20 12:31:00,052 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-20 12:31:00,832 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L795-->L802: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_39 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_28 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_103 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_102 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_103)) (= (ite .cse2 v_~x$w_buff0~0_39 (ite .cse0 v_~x$w_buff1~0_32 v_~x~0_49)) v_~x~0_48) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_39) v_~x$r_buff0_thd2~0_38) (= v_~x$r_buff1_thd2~0_27 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_38 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_102 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_28)) (= v_~x$w_buff0_used~0_109 (ite .cse2 0 v_~x$w_buff0_used~0_110))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_39, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_38, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][140], [32#L838true, 79#L873-1true, 191#true, 155#true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork3InUse, Black: 175#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 7#L775true, 98#L802true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 68#L825true, Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-20 12:31:00,832 INFO L383 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-11-20 12:31:00,832 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-20 12:31:00,832 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-20 12:31:00,833 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-20 12:31:01,240 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L795-->L802: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_39 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_28 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_103 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_102 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_103)) (= (ite .cse2 v_~x$w_buff0~0_39 (ite .cse0 v_~x$w_buff1~0_32 v_~x~0_49)) v_~x~0_48) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_39) v_~x$r_buff0_thd2~0_38) (= v_~x$r_buff1_thd2~0_27 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_38 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_102 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_28)) (= v_~x$w_buff0_used~0_109 (ite .cse2 0 v_~x$w_buff0_used~0_110))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_39, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_38, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][140], [32#L838true, 191#true, 155#true, P1Thread1of1ForFork2InUse, 65#L3true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork3InUse, Black: 175#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 7#L775true, Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 98#L802true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 68#L825true, Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-20 12:31:01,240 INFO L383 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-11-20 12:31:01,241 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-20 12:31:01,241 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-20 12:31:01,241 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-20 12:31:01,498 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L795-->L802: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_39 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_28 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_103 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_102 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_103)) (= (ite .cse2 v_~x$w_buff0~0_39 (ite .cse0 v_~x$w_buff1~0_32 v_~x~0_49)) v_~x~0_48) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_39) v_~x$r_buff0_thd2~0_38) (= v_~x$r_buff1_thd2~0_27 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_38 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_102 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_28)) (= v_~x$w_buff0_used~0_109 (ite .cse2 0 v_~x$w_buff0_used~0_110))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_39, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_38, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][140], [32#L838true, 191#true, 155#true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork3InUse, Black: 175#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 7#L775true, Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 98#L802true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 68#L825true, Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 89#L4true]) [2022-11-20 12:31:01,498 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-11-20 12:31:01,499 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-20 12:31:01,499 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-20 12:31:01,499 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-20 12:31:01,693 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L795-->L802: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_39 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_28 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_103 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_102 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_103)) (= (ite .cse2 v_~x$w_buff0~0_39 (ite .cse0 v_~x$w_buff1~0_32 v_~x~0_49)) v_~x~0_48) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_39) v_~x$r_buff0_thd2~0_38) (= v_~x$r_buff1_thd2~0_27 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_38 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_102 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_28)) (= v_~x$w_buff0_used~0_109 (ite .cse2 0 v_~x$w_buff0_used~0_110))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_39, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_38, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][184], [32#L838true, 155#true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 101#L4-1true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork3InUse, Black: 175#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 7#L775true, Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 98#L802true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 196#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 68#L825true, Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-20 12:31:01,694 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-20 12:31:01,694 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-20 12:31:01,694 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-20 12:31:01,694 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-20 12:31:01,695 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L795-->L802: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_39 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_28 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_103 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_102 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_103)) (= (ite .cse2 v_~x$w_buff0~0_39 (ite .cse0 v_~x$w_buff1~0_32 v_~x~0_49)) v_~x~0_48) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_39) v_~x$r_buff0_thd2~0_38) (= v_~x$r_buff1_thd2~0_27 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_38 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_102 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_28)) (= v_~x$w_buff0_used~0_109 (ite .cse2 0 v_~x$w_buff0_used~0_110))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_39, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_38, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][140], [32#L838true, 191#true, 155#true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork3InUse, Black: 175#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 135#L3-1true, Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 7#L775true, 98#L802true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 68#L825true, Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-20 12:31:01,696 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-20 12:31:01,696 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-20 12:31:01,696 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-20 12:31:01,696 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-20 12:31:01,836 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L880-->L883: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= 2 v_~z~0_5) (= v_~__unbuffered_p1_EAX~0_3 0) (= 2 v_~__unbuffered_p3_EAX~0_3) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p0_EAX~0_3 0))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3} AuxVars[] AssignedVars[~main$tmp_guard1~0][185], [24#L835true, 191#true, 155#true, P1Thread1of1ForFork2InUse, 40#L883true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork3InUse, Black: 175#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 138#L795true, Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 7#L775true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 68#L825true, Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-20 12:31:01,837 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-11-20 12:31:01,837 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-20 12:31:01,837 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-20 12:31:01,837 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-20 12:31:01,967 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L795-->L802: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_39 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_28 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_103 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_102 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_103)) (= (ite .cse2 v_~x$w_buff0~0_39 (ite .cse0 v_~x$w_buff1~0_32 v_~x~0_49)) v_~x~0_48) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_39) v_~x$r_buff0_thd2~0_38) (= v_~x$r_buff1_thd2~0_27 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_38 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_102 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_28)) (= v_~x$w_buff0_used~0_109 (ite .cse2 0 v_~x$w_buff0_used~0_110))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_39, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_38, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][140], [32#L838true, 191#true, 155#true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork3InUse, Black: 175#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 39#L880true, Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 7#L775true, Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 98#L802true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 68#L825true, Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-20 12:31:01,968 INFO L383 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-11-20 12:31:01,968 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-20 12:31:01,968 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-20 12:31:01,969 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-20 12:31:02,570 INFO L130 PetriNetUnfolder]: 11051/18639 cut-off events. [2022-11-20 12:31:02,571 INFO L131 PetriNetUnfolder]: For 16638/18562 co-relation queries the response was YES. [2022-11-20 12:31:02,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43508 conditions, 18639 events. 11051/18639 cut-off events. For 16638/18562 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 154217 event pairs, 1049 based on Foata normal form. 52/17393 useless extension candidates. Maximal degree in co-relation 43439. Up to 6048 conditions per place. [2022-11-20 12:31:02,824 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 85 selfloop transitions, 20 changer transitions 0/201 dead transitions. [2022-11-20 12:31:02,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 201 transitions, 788 flow [2022-11-20 12:31:02,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:31:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:31:02,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1209 transitions. [2022-11-20 12:31:02,829 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8824817518248175 [2022-11-20 12:31:02,829 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1209 transitions. [2022-11-20 12:31:02,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1209 transitions. [2022-11-20 12:31:02,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:31:02,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1209 transitions. [2022-11-20 12:31:02,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.9) internal successors, (1209), 10 states have internal predecessors, (1209), 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:31:02,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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:31:02,841 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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:31:02,841 INFO L175 Difference]: Start difference. First operand has 162 places, 119 transitions, 324 flow. Second operand 10 states and 1209 transitions. [2022-11-20 12:31:02,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 201 transitions, 788 flow [2022-11-20 12:31:02,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 201 transitions, 774 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-20 12:31:02,909 INFO L231 Difference]: Finished difference. Result has 150 places, 137 transitions, 453 flow [2022-11-20 12:31:02,910 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=453, PETRI_PLACES=150, PETRI_TRANSITIONS=137} [2022-11-20 12:31:02,913 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 6 predicate places. [2022-11-20 12:31:02,914 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 137 transitions, 453 flow [2022-11-20 12:31:02,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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:31:02,919 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:31:02,919 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, 1] [2022-11-20 12:31:02,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:31:02,920 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:31:02,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:31:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash 792482388, now seen corresponding path program 1 times [2022-11-20 12:31:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:31:02,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247763469] [2022-11-20 12:31:02,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:31:02,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:31:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:31:03,331 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:31:03,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:31:03,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247763469] [2022-11-20 12:31:03,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247763469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:31:03,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:31:03,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:31:03,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632242987] [2022-11-20 12:31:03,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:31:03,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:31:03,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:31:03,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:31:03,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:31:03,342 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-11-20 12:31:03,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 137 transitions, 453 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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:31:03,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:31:03,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-11-20 12:31:03,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:31:08,085 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L880-->L883: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= 2 v_~z~0_5) (= v_~__unbuffered_p1_EAX~0_3 0) (= 2 v_~__unbuffered_p3_EAX~0_3) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p0_EAX~0_3 0))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3} AuxVars[] AssignedVars[~main$tmp_guard1~0][227], [24#L835true, 155#true, P1Thread1of1ForFork2InUse, Black: 200#(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)), 214#true, P3Thread1of1ForFork1InUse, Black: 194#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 198#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork0InUse, Black: 206#(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)), P2Thread1of1ForFork3InUse, Black: 202#(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)), 138#L795true, 7#L775true, 68#L825true, 191#true, 40#L883true, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-20 12:31:08,086 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-11-20 12:31:08,086 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-20 12:31:08,086 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-20 12:31:08,087 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-20 12:31:08,348 INFO L130 PetriNetUnfolder]: 10394/18005 cut-off events. [2022-11-20 12:31:08,349 INFO L131 PetriNetUnfolder]: For 32588/34456 co-relation queries the response was YES. [2022-11-20 12:31:08,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55723 conditions, 18005 events. 10394/18005 cut-off events. For 32588/34456 co-relation queries the response was YES. Maximal size of possible extension queue 1445. Compared 155561 event pairs, 744 based on Foata normal form. 332/17465 useless extension candidates. Maximal degree in co-relation 55649. Up to 3918 conditions per place. [2022-11-20 12:31:08,549 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 108 selfloop transitions, 38 changer transitions 2/244 dead transitions. [2022-11-20 12:31:08,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 244 transitions, 1289 flow [2022-11-20 12:31:08,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:31:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:31:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1576 transitions. [2022-11-20 12:31:08,556 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8848961257720381 [2022-11-20 12:31:08,556 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1576 transitions. [2022-11-20 12:31:08,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1576 transitions. [2022-11-20 12:31:08,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:31:08,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1576 transitions. [2022-11-20 12:31:08,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 121.23076923076923) internal successors, (1576), 13 states have internal predecessors, (1576), 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:31:08,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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:31:08,570 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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:31:08,571 INFO L175 Difference]: Start difference. First operand has 150 places, 137 transitions, 453 flow. Second operand 13 states and 1576 transitions. [2022-11-20 12:31:08,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 244 transitions, 1289 flow [2022-11-20 12:31:08,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 244 transitions, 1281 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-20 12:31:08,906 INFO L231 Difference]: Finished difference. Result has 164 places, 157 transitions, 738 flow [2022-11-20 12:31:08,907 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=738, PETRI_PLACES=164, PETRI_TRANSITIONS=157} [2022-11-20 12:31:08,908 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 20 predicate places. [2022-11-20 12:31:08,908 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 157 transitions, 738 flow [2022-11-20 12:31:08,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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:31:08,909 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:31:08,910 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, 1, 1, 1, 1, 1] [2022-11-20 12:31:08,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:31:08,915 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:31:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:31:08,916 INFO L85 PathProgramCache]: Analyzing trace with hash -270071850, now seen corresponding path program 1 times [2022-11-20 12:31:08,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:31:08,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525570392] [2022-11-20 12:31:08,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:31:08,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:31:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:31:09,616 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:31:09,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:31:09,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525570392] [2022-11-20 12:31:09,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525570392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:31:09,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:31:09,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:31:09,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353159489] [2022-11-20 12:31:09,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:31:09,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:31:09,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:31:09,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:31:09,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:31:09,623 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-20 12:31:09,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 157 transitions, 738 flow. Second operand has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 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:31:09,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:31:09,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-20 12:31:09,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:31:12,686 INFO L130 PetriNetUnfolder]: 3344/10643 cut-off events. [2022-11-20 12:31:12,687 INFO L131 PetriNetUnfolder]: For 29928/36958 co-relation queries the response was YES. [2022-11-20 12:31:12,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35883 conditions, 10643 events. 3344/10643 cut-off events. For 29928/36958 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 131202 event pairs, 377 based on Foata normal form. 198/10088 useless extension candidates. Maximal degree in co-relation 35803. Up to 2685 conditions per place. [2022-11-20 12:31:12,862 INFO L137 encePairwiseOnDemand]: 131/137 looper letters, 64 selfloop transitions, 6 changer transitions 0/205 dead transitions. [2022-11-20 12:31:12,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 205 transitions, 1064 flow [2022-11-20 12:31:12,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:31:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 12:31:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 848 transitions. [2022-11-20 12:31:12,867 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8842544316996872 [2022-11-20 12:31:12,867 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 848 transitions. [2022-11-20 12:31:12,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 848 transitions. [2022-11-20 12:31:12,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:31:12,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 848 transitions. [2022-11-20 12:31:12,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 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:31:12,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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:31:12,875 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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:31:12,876 INFO L175 Difference]: Start difference. First operand has 164 places, 157 transitions, 738 flow. Second operand 7 states and 848 transitions. [2022-11-20 12:31:12,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 205 transitions, 1064 flow [2022-11-20 12:31:14,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 205 transitions, 969 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-11-20 12:31:14,248 INFO L231 Difference]: Finished difference. Result has 171 places, 162 transitions, 708 flow [2022-11-20 12:31:14,248 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=708, PETRI_PLACES=171, PETRI_TRANSITIONS=162} [2022-11-20 12:31:14,249 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 27 predicate places. [2022-11-20 12:31:14,249 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 162 transitions, 708 flow [2022-11-20 12:31:14,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 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:31:14,250 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:31:14,250 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, 1, 1, 1, 1, 1] [2022-11-20 12:31:14,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:31:14,251 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:31:14,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:31:14,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1233172510, now seen corresponding path program 2 times [2022-11-20 12:31:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:31:14,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006661943] [2022-11-20 12:31:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:31:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:31:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:31:14,688 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:31:14,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:31:14,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006661943] [2022-11-20 12:31:14,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006661943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:31:14,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:31:14,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:31:14,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222335709] [2022-11-20 12:31:14,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:31:14,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:31:14,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:31:14,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:31:14,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:31:14,692 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-11-20 12:31:14,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 162 transitions, 708 flow. Second operand has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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:31:14,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:31:14,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-11-20 12:31:14,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:31:21,655 INFO L130 PetriNetUnfolder]: 17234/30431 cut-off events. [2022-11-20 12:31:21,655 INFO L131 PetriNetUnfolder]: For 84699/89873 co-relation queries the response was YES. [2022-11-20 12:31:21,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103483 conditions, 30431 events. 17234/30431 cut-off events. For 84699/89873 co-relation queries the response was YES. Maximal size of possible extension queue 2450. Compared 291745 event pairs, 850 based on Foata normal form. 462/29411 useless extension candidates. Maximal degree in co-relation 103400. Up to 4256 conditions per place. [2022-11-20 12:31:21,949 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 108 selfloop transitions, 58 changer transitions 30/294 dead transitions. [2022-11-20 12:31:21,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 294 transitions, 1928 flow [2022-11-20 12:31:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 12:31:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-20 12:31:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1942 transitions. [2022-11-20 12:31:21,956 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8859489051094891 [2022-11-20 12:31:21,956 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1942 transitions. [2022-11-20 12:31:21,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1942 transitions. [2022-11-20 12:31:21,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:31:21,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1942 transitions. [2022-11-20 12:31:21,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 121.375) internal successors, (1942), 16 states have internal predecessors, (1942), 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:31:21,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 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:31:21,971 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 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:31:21,971 INFO L175 Difference]: Start difference. First operand has 171 places, 162 transitions, 708 flow. Second operand 16 states and 1942 transitions. [2022-11-20 12:31:21,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 294 transitions, 1928 flow [2022-11-20 12:31:25,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 294 transitions, 1925 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-20 12:31:25,224 INFO L231 Difference]: Finished difference. Result has 189 places, 185 transitions, 1142 flow [2022-11-20 12:31:25,225 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1142, PETRI_PLACES=189, PETRI_TRANSITIONS=185} [2022-11-20 12:31:25,226 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 45 predicate places. [2022-11-20 12:31:25,226 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 185 transitions, 1142 flow [2022-11-20 12:31:25,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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:31:25,229 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:31:25,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:31:25,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:31:25,230 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:31:25,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:31:25,231 INFO L85 PathProgramCache]: Analyzing trace with hash -659311590, now seen corresponding path program 1 times [2022-11-20 12:31:25,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:31:25,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26010470] [2022-11-20 12:31:25,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:31:25,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:31:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:31:25,821 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:31:25,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:31:25,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26010470] [2022-11-20 12:31:25,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26010470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:31:25,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:31:25,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:31:25,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488454786] [2022-11-20 12:31:25,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:31:25,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:31:25,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:31:25,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:31:25,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:31:25,826 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-11-20 12:31:25,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 185 transitions, 1142 flow. Second operand has 9 states, 9 states have (on average 113.11111111111111) internal successors, (1018), 9 states have internal predecessors, (1018), 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:31:25,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:31:25,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-11-20 12:31:25,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:31:33,239 INFO L130 PetriNetUnfolder]: 16984/30261 cut-off events. [2022-11-20 12:31:33,240 INFO L131 PetriNetUnfolder]: For 114244/119452 co-relation queries the response was YES. [2022-11-20 12:31:33,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113345 conditions, 30261 events. 16984/30261 cut-off events. For 114244/119452 co-relation queries the response was YES. Maximal size of possible extension queue 2362. Compared 293583 event pairs, 817 based on Foata normal form. 325/29258 useless extension candidates. Maximal degree in co-relation 113312. Up to 4058 conditions per place. [2022-11-20 12:31:33,544 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 80 selfloop transitions, 59 changer transitions 55/292 dead transitions. [2022-11-20 12:31:33,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 292 transitions, 2129 flow [2022-11-20 12:31:33,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 12:31:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-20 12:31:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2262 transitions. [2022-11-20 12:31:33,562 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8689973107952362 [2022-11-20 12:31:33,562 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2262 transitions. [2022-11-20 12:31:33,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2262 transitions. [2022-11-20 12:31:33,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:31:33,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2262 transitions. [2022-11-20 12:31:33,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 119.05263157894737) internal successors, (2262), 19 states have internal predecessors, (2262), 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:31:33,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 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:31:33,581 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 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:31:33,582 INFO L175 Difference]: Start difference. First operand has 189 places, 185 transitions, 1142 flow. Second operand 19 states and 2262 transitions. [2022-11-20 12:31:33,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 292 transitions, 2129 flow [2022-11-20 12:31:44,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 292 transitions, 1728 flow, removed 157 selfloop flow, removed 15 redundant places. [2022-11-20 12:31:44,633 INFO L231 Difference]: Finished difference. Result has 196 places, 180 transitions, 951 flow [2022-11-20 12:31:44,633 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=951, PETRI_PLACES=196, PETRI_TRANSITIONS=180} [2022-11-20 12:31:44,634 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 52 predicate places. [2022-11-20 12:31:44,635 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 180 transitions, 951 flow [2022-11-20 12:31:44,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.11111111111111) internal successors, (1018), 9 states have internal predecessors, (1018), 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:31:44,636 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:31:44,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:31:44,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:31:44,637 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:31:44,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:31:44,638 INFO L85 PathProgramCache]: Analyzing trace with hash -277251560, now seen corresponding path program 1 times [2022-11-20 12:31:44,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:31:44,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90601041] [2022-11-20 12:31:44,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:31:44,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:31:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:31:45,235 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:31:45,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:31:45,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90601041] [2022-11-20 12:31:45,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90601041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:31:45,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:31:45,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:31:45,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936193439] [2022-11-20 12:31:45,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:31:45,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:31:45,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:31:45,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:31:45,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:31:45,240 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 137 [2022-11-20 12:31:45,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 180 transitions, 951 flow. Second operand has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 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:31:45,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:31:45,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 137 [2022-11-20 12:31:45,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:31:47,916 INFO L130 PetriNetUnfolder]: 4302/14351 cut-off events. [2022-11-20 12:31:47,916 INFO L131 PetriNetUnfolder]: For 32662/34315 co-relation queries the response was YES. [2022-11-20 12:31:48,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46036 conditions, 14351 events. 4302/14351 cut-off events. For 32662/34315 co-relation queries the response was YES. Maximal size of possible extension queue 1866. Compared 197037 event pairs, 75 based on Foata normal form. 8/13393 useless extension candidates. Maximal degree in co-relation 45942. Up to 1382 conditions per place. [2022-11-20 12:31:48,171 INFO L137 encePairwiseOnDemand]: 123/137 looper letters, 45 selfloop transitions, 18 changer transitions 7/216 dead transitions. [2022-11-20 12:31:48,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 216 transitions, 1279 flow [2022-11-20 12:31:48,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:31:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 12:31:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 894 transitions. [2022-11-20 12:31:48,176 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8156934306569343 [2022-11-20 12:31:48,176 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 894 transitions. [2022-11-20 12:31:48,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 894 transitions. [2022-11-20 12:31:48,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:31:48,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 894 transitions. [2022-11-20 12:31:48,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.75) internal successors, (894), 8 states have internal predecessors, (894), 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:31:48,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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:31:48,185 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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:31:48,185 INFO L175 Difference]: Start difference. First operand has 196 places, 180 transitions, 951 flow. Second operand 8 states and 894 transitions. [2022-11-20 12:31:48,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 216 transitions, 1279 flow [2022-11-20 12:31:50,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 216 transitions, 1098 flow, removed 46 selfloop flow, removed 17 redundant places. [2022-11-20 12:31:50,944 INFO L231 Difference]: Finished difference. Result has 189 places, 191 transitions, 972 flow [2022-11-20 12:31:50,944 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=972, PETRI_PLACES=189, PETRI_TRANSITIONS=191} [2022-11-20 12:31:50,945 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 45 predicate places. [2022-11-20 12:31:50,945 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 191 transitions, 972 flow [2022-11-20 12:31:50,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 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:31:50,946 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:31:50,947 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:31:50,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:31:50,947 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:31:50,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:31:50,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1245333594, now seen corresponding path program 2 times [2022-11-20 12:31:50,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:31:50,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975214142] [2022-11-20 12:31:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:31:50,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:31:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:31:52,726 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:31:52,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:31:52,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975214142] [2022-11-20 12:31:52,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975214142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:31:52,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:31:52,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:31:52,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321780760] [2022-11-20 12:31:52,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:31:52,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:31:52,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:31:52,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:31:52,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:31:52,729 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-11-20 12:31:52,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 191 transitions, 972 flow. Second operand has 10 states, 10 states have (on average 112.2) internal successors, (1122), 10 states have internal predecessors, (1122), 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:31:52,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:31:52,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-11-20 12:31:52,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:31:57,872 INFO L130 PetriNetUnfolder]: 7367/24714 cut-off events. [2022-11-20 12:31:57,872 INFO L131 PetriNetUnfolder]: For 43425/44298 co-relation queries the response was YES. [2022-11-20 12:31:58,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71074 conditions, 24714 events. 7367/24714 cut-off events. For 43425/44298 co-relation queries the response was YES. Maximal size of possible extension queue 3170. Compared 372802 event pairs, 95 based on Foata normal form. 24/23183 useless extension candidates. Maximal degree in co-relation 71042. Up to 2518 conditions per place. [2022-11-20 12:31:58,148 INFO L137 encePairwiseOnDemand]: 127/137 looper letters, 36 selfloop transitions, 11 changer transitions 9/223 dead transitions. [2022-11-20 12:31:58,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 223 transitions, 1234 flow [2022-11-20 12:31:58,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:31:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:31:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1039 transitions. [2022-11-20 12:31:58,153 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8426601784266018 [2022-11-20 12:31:58,153 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1039 transitions. [2022-11-20 12:31:58,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1039 transitions. [2022-11-20 12:31:58,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:31:58,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1039 transitions. [2022-11-20 12:31:58,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.44444444444444) internal successors, (1039), 9 states have internal predecessors, (1039), 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:31:58,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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:31:58,160 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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:31:58,161 INFO L175 Difference]: Start difference. First operand has 189 places, 191 transitions, 972 flow. Second operand 9 states and 1039 transitions. [2022-11-20 12:31:58,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 223 transitions, 1234 flow [2022-11-20 12:32:05,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 223 transitions, 1222 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-11-20 12:32:05,902 INFO L231 Difference]: Finished difference. Result has 197 places, 200 transitions, 1084 flow [2022-11-20 12:32:05,902 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1084, PETRI_PLACES=197, PETRI_TRANSITIONS=200} [2022-11-20 12:32:05,903 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 53 predicate places. [2022-11-20 12:32:05,904 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 200 transitions, 1084 flow [2022-11-20 12:32:05,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 112.2) internal successors, (1122), 10 states have internal predecessors, (1122), 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:32:05,905 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:32:05,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:32:05,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:32:05,905 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-20 12:32:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:32:05,906 INFO L85 PathProgramCache]: Analyzing trace with hash 722794186, now seen corresponding path program 3 times [2022-11-20 12:32:05,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:32:05,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718105845] [2022-11-20 12:32:05,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:32:05,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:32:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:32:06,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:32:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:32:06,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:32:06,158 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:32:06,160 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-20 12:32:06,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-20 12:32:06,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-20 12:32:06,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-20 12:32:06,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-20 12:32:06,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-20 12:32:06,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-20 12:32:06,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:32:06,172 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-11-20 12:32:06,181 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 12:32:06,181 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:32:06,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:32:06 BasicIcfg [2022-11-20 12:32:06,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:32:06,393 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:32:06,393 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:32:06,393 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:32:06,394 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:30:50" (3/4) ... [2022-11-20 12:32:06,396 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 12:32:06,561 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8630f921-427f-46a1-96e8-26b2e1becd60/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:32:06,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:32:06,562 INFO L158 Benchmark]: Toolchain (without parser) took 77796.05ms. Allocated memory was 151.0MB in the beginning and 11.9GB in the end (delta: 11.7GB). Free memory was 117.1MB in the beginning and 10.5GB in the end (delta: -10.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2022-11-20 12:32:06,563 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 151.0MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:32:06,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 809.17ms. Allocated memory is still 151.0MB. Free memory was 117.1MB in the beginning and 93.5MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 12:32:06,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.18ms. Allocated memory is still 151.0MB. Free memory was 93.5MB in the beginning and 91.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 12:32:06,564 INFO L158 Benchmark]: Boogie Preprocessor took 71.45ms. Allocated memory is still 151.0MB. Free memory was 91.0MB in the beginning and 89.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:32:06,564 INFO L158 Benchmark]: RCFGBuilder took 1091.90ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 88.9MB in the beginning and 152.0MB in the end (delta: -63.1MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2022-11-20 12:32:06,565 INFO L158 Benchmark]: TraceAbstraction took 75533.24ms. Allocated memory was 205.5MB in the beginning and 11.9GB in the end (delta: 11.7GB). Free memory was 152.0MB in the beginning and 10.5GB in the end (delta: -10.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2022-11-20 12:32:06,566 INFO L158 Benchmark]: Witness Printer took 168.52ms. Allocated memory is still 11.9GB. Free memory was 10.5GB in the beginning and 10.5GB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-20 12:32:06,568 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.36ms. Allocated memory is still 151.0MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 809.17ms. Allocated memory is still 151.0MB. Free memory was 117.1MB in the beginning and 93.5MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.18ms. Allocated memory is still 151.0MB. Free memory was 93.5MB in the beginning and 91.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.45ms. Allocated memory is still 151.0MB. Free memory was 91.0MB in the beginning and 89.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1091.90ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 88.9MB in the beginning and 152.0MB in the end (delta: -63.1MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * TraceAbstraction took 75533.24ms. Allocated memory was 205.5MB in the beginning and 11.9GB in the end (delta: 11.7GB). Free memory was 152.0MB in the beginning and 10.5GB in the end (delta: -10.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 168.52ms. Allocated memory is still 11.9GB. Free memory was 10.5GB in the beginning and 10.5GB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L713] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L719] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L721] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L727] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L728] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L729] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L730] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L731] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L732] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L733] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L734] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L735] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L736] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L737] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L738] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L739] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L740] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L741] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L742] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L743] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L745] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L748] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L749] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t685; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t685={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t685, ((void *)0), P0, ((void *)0))=-3, t685={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t686; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t685={5:0}, t686={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t686, ((void *)0), P1, ((void *)0))=-2, t685={5:0}, t686={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L866] 0 pthread_t t687; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t687, ((void *)0), P2, ((void *)0))=-1, t685={5:0}, t686={6:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L868] 0 pthread_t t688; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t688, ((void *)0), P3, ((void *)0))=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: 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: 865]: 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: 869]: 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: 863]: 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: 867]: 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 9 procedures, 173 locations, 7 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: 75.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 68.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 834 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 834 mSDsluCounter, 490 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 392 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1452 IncrementalHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 98 mSDtfsCounter, 1452 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1142occurred in iteration=6, InterpolantAutomatonStates: 98, 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.8s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 935 NumberOfCodeBlocks, 935 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 820 ConstructedInterpolants, 0 QuantifiedInterpolants, 3680 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:32:06,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8630f921-427f-46a1-96e8-26b2e1becd60/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