./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP --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 a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:27:16,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:27:16,958 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:27:16,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:27:16,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:27:17,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:27:17,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:27:17,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:27:17,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:27:17,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:27:17,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:27:17,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:27:17,021 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:27:17,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:27:17,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:27:17,024 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:27:17,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:27:17,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:27:17,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:27:17,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:27:17,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:27:17,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:27:17,027 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:27:17,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:27:17,028 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:27:17,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:27:17,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:27:17,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:27:17,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:27:17,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:27:17,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:27:17,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:27:17,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:27:17,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:27:17,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:27:17,033 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:27:17,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:27:17,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:27:17,034 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:27:17,035 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP/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_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP 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 -> a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e [2023-11-06 22:27:17,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:27:17,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:27:17,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:27:17,431 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:27:17,431 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:27:17,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:27:20,611 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:27:20,905 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:27:20,905 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8caa930-0d3a-4b59-9d1f-a6edddaed548/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:27:20,923 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP/data/b41202da9/019e7ec360734282a547f3d5775098f1/FLAG505b9bf84 [2023-11-06 22:27:20,944 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP/data/b41202da9/019e7ec360734282a547f3d5775098f1 [2023-11-06 22:27:20,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:27:20,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:27:20,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:27:20,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:27:20,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:27:20,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:20" (1/1) ... [2023-11-06 22:27:20,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a841569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:20, skipping insertion in model container [2023-11-06 22:27:20,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:20" (1/1) ... [2023-11-06 22:27:21,048 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:27:21,292 WARN L240 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_a8caa930-0d3a-4b59-9d1f-a6edddaed548/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-06 22:27:21,616 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:27:21,634 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:27:21,652 WARN L240 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_a8caa930-0d3a-4b59-9d1f-a6edddaed548/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-06 22:27:21,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:27:21,744 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:21,745 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:21,753 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:27:21,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:21 WrapperNode [2023-11-06 22:27:21,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:27:21,755 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:27:21,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:27:21,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:27:21,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:21" (1/1) ... [2023-11-06 22:27:21,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:21" (1/1) ... [2023-11-06 22:27:21,810 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2023-11-06 22:27:21,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:27:21,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:27:21,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:27:21,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:27:21,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:21" (1/1) ... [2023-11-06 22:27:21,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:21" (1/1) ... [2023-11-06 22:27:21,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:21" (1/1) ... [2023-11-06 22:27:21,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:21" (1/1) ... [2023-11-06 22:27:21,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:21" (1/1) ... [2023-11-06 22:27:21,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:21" (1/1) ... [2023-11-06 22:27:21,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:21" (1/1) ... [2023-11-06 22:27:21,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:21" (1/1) ... [2023-11-06 22:27:21,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:27:21,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:27:21,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:27:21,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:27:21,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:21" (1/1) ... [2023-11-06 22:27:21,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:27:21,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:21,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:27:21,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:27:21,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:27:21,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:27:21,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:27:21,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:27:21,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:27:21,951 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:27:21,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:27:21,951 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:27:21,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:27:21,951 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:27:21,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:27:21,952 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:27:21,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:27:21,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:27:21,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:27:21,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:27:21,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:27:21,954 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:27:22,107 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:27:22,109 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:27:22,566 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:27:22,740 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:27:22,740 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:27:22,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:22 BoogieIcfgContainer [2023-11-06 22:27:22,745 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:27:22,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:27:22,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:27:22,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:27:22,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:27:20" (1/3) ... [2023-11-06 22:27:22,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173d990a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:22, skipping insertion in model container [2023-11-06 22:27:22,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:21" (2/3) ... [2023-11-06 22:27:22,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173d990a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:22, skipping insertion in model container [2023-11-06 22:27:22,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:22" (3/3) ... [2023-11-06 22:27:22,759 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 22:27:22,769 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:27:22,780 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:27:22,780 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:27:22,780 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:27:22,885 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:27:22,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 280 flow [2023-11-06 22:27:23,020 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-11-06 22:27:23,021 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:27:23,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 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/124 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-06 22:27:23,028 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 280 flow [2023-11-06 22:27:23,034 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-11-06 22:27:23,038 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:27:23,049 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-11-06 22:27:23,053 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-11-06 22:27:23,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-11-06 22:27:23,110 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-11-06 22:27:23,111 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:27:23,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 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/124 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-06 22:27:23,116 INFO L119 LiptonReduction]: Number of co-enabled transitions 3404 [2023-11-06 22:27:28,340 INFO L134 LiptonReduction]: Checked pairs total: 9349 [2023-11-06 22:27:28,340 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-11-06 22:27:28,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:27:28,364 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;@4fd2c079, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:27:28,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-06 22:27:28,368 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:27:28,369 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-11-06 22:27:28,369 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:27:28,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:28,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:27:28,370 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:27:28,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:28,376 INFO L85 PathProgramCache]: Analyzing trace with hash 558317, now seen corresponding path program 1 times [2023-11-06 22:27:28,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:28,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522249976] [2023-11-06 22:27:28,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:28,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:28,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:28,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522249976] [2023-11-06 22:27:28,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522249976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:28,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:28,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:27:28,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709281126] [2023-11-06 22:27:28,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:29,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:27:29,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:29,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:27:29,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:27:29,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 244 [2023-11-06 22:27:29,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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) [2023-11-06 22:27:29,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:29,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 244 [2023-11-06 22:27:29,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:30,516 INFO L124 PetriNetUnfolderBase]: 4903/6757 cut-off events. [2023-11-06 22:27:30,517 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-06 22:27:30,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13605 conditions, 6757 events. 4903/6757 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 32793 event pairs, 2535 based on Foata normal form. 0/6419 useless extension candidates. Maximal degree in co-relation 13593. Up to 5335 conditions per place. [2023-11-06 22:27:30,584 INFO L140 encePairwiseOnDemand]: 240/244 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-11-06 22:27:30,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 209 flow [2023-11-06 22:27:30,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:27:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:27:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-11-06 22:27:30,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5409836065573771 [2023-11-06 22:27:30,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-11-06 22:27:30,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-11-06 22:27:30,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:30,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-11-06 22:27:30,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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) [2023-11-06 22:27:30,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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) [2023-11-06 22:27:30,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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) [2023-11-06 22:27:30,636 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 396 transitions. [2023-11-06 22:27:30,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 209 flow [2023-11-06 22:27:30,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:27:30,646 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-11-06 22:27:30,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-11-06 22:27:30,656 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-11-06 22:27:30,656 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-11-06 22:27:30,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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) [2023-11-06 22:27:30,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:30,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:30,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:27:30,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:27:30,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:30,659 INFO L85 PathProgramCache]: Analyzing trace with hash 440049272, now seen corresponding path program 1 times [2023-11-06 22:27:30,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:30,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160830832] [2023-11-06 22:27:30,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:30,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:31,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:31,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:31,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160830832] [2023-11-06 22:27:31,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160830832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:31,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:31,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:27:31,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263065567] [2023-11-06 22:27:31,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:31,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:27:31,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:31,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:27:31,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:27:31,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 244 [2023-11-06 22:27:31,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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) [2023-11-06 22:27:31,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:31,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 244 [2023-11-06 22:27:31,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:34,585 INFO L124 PetriNetUnfolderBase]: 16443/22329 cut-off events. [2023-11-06 22:27:34,586 INFO L125 PetriNetUnfolderBase]: For 1116/1116 co-relation queries the response was YES. [2023-11-06 22:27:34,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46175 conditions, 22329 events. 16443/22329 cut-off events. For 1116/1116 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 116606 event pairs, 6427 based on Foata normal form. 704/23033 useless extension candidates. Maximal degree in co-relation 46165. Up to 11662 conditions per place. [2023-11-06 22:27:34,718 INFO L140 encePairwiseOnDemand]: 234/244 looper letters, 42 selfloop transitions, 9 changer transitions 0/51 dead transitions. [2023-11-06 22:27:34,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2023-11-06 22:27:34,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:27:34,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:27:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-11-06 22:27:34,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013661202185792 [2023-11-06 22:27:34,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-11-06 22:27:34,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-11-06 22:27:34,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:34,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-11-06 22:27:34,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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) [2023-11-06 22:27:34,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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) [2023-11-06 22:27:34,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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) [2023-11-06 22:27:34,735 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 367 transitions. [2023-11-06 22:27:34,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2023-11-06 22:27:34,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:27:34,740 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 134 flow [2023-11-06 22:27:34,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2023-11-06 22:27:34,750 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-11-06 22:27:34,750 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 134 flow [2023-11-06 22:27:34,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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) [2023-11-06 22:27:34,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:34,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:34,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:27:34,752 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:27:34,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:34,753 INFO L85 PathProgramCache]: Analyzing trace with hash 756624999, now seen corresponding path program 1 times [2023-11-06 22:27:34,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:34,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274741318] [2023-11-06 22:27:34,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:34,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:35,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:35,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274741318] [2023-11-06 22:27:35,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274741318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:35,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:35,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:27:35,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234504478] [2023-11-06 22:27:35,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:35,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:27:35,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:35,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:27:35,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:27:35,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 244 [2023-11-06 22:27:35,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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) [2023-11-06 22:27:35,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:35,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 244 [2023-11-06 22:27:35,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:38,012 INFO L124 PetriNetUnfolderBase]: 15313/20798 cut-off events. [2023-11-06 22:27:38,012 INFO L125 PetriNetUnfolderBase]: For 10447/10447 co-relation queries the response was YES. [2023-11-06 22:27:38,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53933 conditions, 20798 events. 15313/20798 cut-off events. For 10447/10447 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 105656 event pairs, 3500 based on Foata normal form. 170/20968 useless extension candidates. Maximal degree in co-relation 53921. Up to 8467 conditions per place. [2023-11-06 22:27:38,141 INFO L140 encePairwiseOnDemand]: 235/244 looper letters, 57 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2023-11-06 22:27:38,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 66 transitions, 356 flow [2023-11-06 22:27:38,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:27:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:27:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-11-06 22:27:38,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4918032786885246 [2023-11-06 22:27:38,145 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-11-06 22:27:38,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-11-06 22:27:38,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:38,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-11-06 22:27:38,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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) [2023-11-06 22:27:38,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 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) [2023-11-06 22:27:38,153 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 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) [2023-11-06 22:27:38,153 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 134 flow. Second operand 4 states and 480 transitions. [2023-11-06 22:27:38,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 66 transitions, 356 flow [2023-11-06 22:27:38,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 66 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:27:38,197 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 184 flow [2023-11-06 22:27:38,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2023-11-06 22:27:38,199 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-11-06 22:27:38,203 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 184 flow [2023-11-06 22:27:38,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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) [2023-11-06 22:27:38,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:38,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:38,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:27:38,205 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:27:38,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:38,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1978485186, now seen corresponding path program 1 times [2023-11-06 22:27:38,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:38,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960830002] [2023-11-06 22:27:38,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:38,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:38,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:38,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960830002] [2023-11-06 22:27:38,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960830002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:38,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:38,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:27:38,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088826138] [2023-11-06 22:27:38,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:38,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:27:38,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:38,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:27:38,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:27:38,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 244 [2023-11-06 22:27:38,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 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) [2023-11-06 22:27:38,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:38,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 244 [2023-11-06 22:27:38,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:40,862 INFO L124 PetriNetUnfolderBase]: 15055/20452 cut-off events. [2023-11-06 22:27:40,862 INFO L125 PetriNetUnfolderBase]: For 14536/14536 co-relation queries the response was YES. [2023-11-06 22:27:40,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56354 conditions, 20452 events. 15055/20452 cut-off events. For 14536/14536 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 105475 event pairs, 1461 based on Foata normal form. 40/20492 useless extension candidates. Maximal degree in co-relation 56339. Up to 9914 conditions per place. [2023-11-06 22:27:40,981 INFO L140 encePairwiseOnDemand]: 234/244 looper letters, 63 selfloop transitions, 20 changer transitions 0/83 dead transitions. [2023-11-06 22:27:40,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 512 flow [2023-11-06 22:27:40,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:27:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:27:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2023-11-06 22:27:40,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-06 22:27:40,984 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 488 transitions. [2023-11-06 22:27:40,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 488 transitions. [2023-11-06 22:27:40,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:40,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 488 transitions. [2023-11-06 22:27:40,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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) [2023-11-06 22:27:40,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 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) [2023-11-06 22:27:40,991 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 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) [2023-11-06 22:27:40,991 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 184 flow. Second operand 4 states and 488 transitions. [2023-11-06 22:27:40,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 512 flow [2023-11-06 22:27:41,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:27:41,082 INFO L231 Difference]: Finished difference. Result has 50 places, 54 transitions, 364 flow [2023-11-06 22:27:41,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=364, PETRI_PLACES=50, PETRI_TRANSITIONS=54} [2023-11-06 22:27:41,084 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2023-11-06 22:27:41,084 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 54 transitions, 364 flow [2023-11-06 22:27:41,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 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) [2023-11-06 22:27:41,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:41,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:41,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:27:41,086 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:27:41,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:41,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1266592470, now seen corresponding path program 1 times [2023-11-06 22:27:41,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:41,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761989088] [2023-11-06 22:27:41,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:41,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:41,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:41,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761989088] [2023-11-06 22:27:41,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761989088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:41,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:41,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:27:41,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495973624] [2023-11-06 22:27:41,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:41,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:27:41,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:41,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:27:41,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:27:41,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-11-06 22:27:41,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 54 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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) [2023-11-06 22:27:41,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:41,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-11-06 22:27:41,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:43,677 INFO L124 PetriNetUnfolderBase]: 12172/17348 cut-off events. [2023-11-06 22:27:43,677 INFO L125 PetriNetUnfolderBase]: For 32576/33072 co-relation queries the response was YES. [2023-11-06 22:27:43,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53665 conditions, 17348 events. 12172/17348 cut-off events. For 32576/33072 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 100214 event pairs, 4891 based on Foata normal form. 392/17522 useless extension candidates. Maximal degree in co-relation 53646. Up to 15235 conditions per place. [2023-11-06 22:27:43,893 INFO L140 encePairwiseOnDemand]: 240/244 looper letters, 61 selfloop transitions, 10 changer transitions 0/83 dead transitions. [2023-11-06 22:27:43,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 83 transitions, 668 flow [2023-11-06 22:27:43,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:27:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:27:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-11-06 22:27:43,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5273224043715847 [2023-11-06 22:27:43,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-11-06 22:27:43,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-11-06 22:27:44,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:44,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-11-06 22:27:44,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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) [2023-11-06 22:27:44,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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) [2023-11-06 22:27:44,132 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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) [2023-11-06 22:27:44,132 INFO L175 Difference]: Start difference. First operand has 50 places, 54 transitions, 364 flow. Second operand 3 states and 386 transitions. [2023-11-06 22:27:44,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 83 transitions, 668 flow [2023-11-06 22:27:44,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 668 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:27:44,196 INFO L231 Difference]: Finished difference. Result has 53 places, 63 transitions, 492 flow [2023-11-06 22:27:44,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=53, PETRI_TRANSITIONS=63} [2023-11-06 22:27:44,197 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2023-11-06 22:27:44,197 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 63 transitions, 492 flow [2023-11-06 22:27:44,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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) [2023-11-06 22:27:44,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:44,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:44,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:27:44,199 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:27:44,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:44,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2129727132, now seen corresponding path program 1 times [2023-11-06 22:27:44,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:44,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372412709] [2023-11-06 22:27:44,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:44,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:44,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:44,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372412709] [2023-11-06 22:27:44,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372412709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:44,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:44,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:27:44,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337796995] [2023-11-06 22:27:44,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:44,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:27:44,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:44,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:27:44,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:27:44,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 244 [2023-11-06 22:27:44,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 63 transitions, 492 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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) [2023-11-06 22:27:44,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:44,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 244 [2023-11-06 22:27:44,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:47,777 INFO L124 PetriNetUnfolderBase]: 20582/28191 cut-off events. [2023-11-06 22:27:47,777 INFO L125 PetriNetUnfolderBase]: For 56099/56099 co-relation queries the response was YES. [2023-11-06 22:27:47,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89005 conditions, 28191 events. 20582/28191 cut-off events. For 56099/56099 co-relation queries the response was YES. Maximal size of possible extension queue 908. Compared 156723 event pairs, 3764 based on Foata normal form. 300/28491 useless extension candidates. Maximal degree in co-relation 88983. Up to 11643 conditions per place. [2023-11-06 22:27:47,912 INFO L140 encePairwiseOnDemand]: 234/244 looper letters, 68 selfloop transitions, 34 changer transitions 2/104 dead transitions. [2023-11-06 22:27:47,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 104 transitions, 868 flow [2023-11-06 22:27:47,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:27:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:27:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2023-11-06 22:27:47,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051229508196722 [2023-11-06 22:27:47,918 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 493 transitions. [2023-11-06 22:27:47,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 493 transitions. [2023-11-06 22:27:47,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:47,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 493 transitions. [2023-11-06 22:27:47,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 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) [2023-11-06 22:27:47,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 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) [2023-11-06 22:27:47,925 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 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) [2023-11-06 22:27:47,926 INFO L175 Difference]: Start difference. First operand has 53 places, 63 transitions, 492 flow. Second operand 4 states and 493 transitions. [2023-11-06 22:27:47,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 104 transitions, 868 flow [2023-11-06 22:27:48,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 104 transitions, 858 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:27:48,008 INFO L231 Difference]: Finished difference. Result has 58 places, 68 transitions, 691 flow [2023-11-06 22:27:48,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=691, PETRI_PLACES=58, PETRI_TRANSITIONS=68} [2023-11-06 22:27:48,011 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2023-11-06 22:27:48,012 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 68 transitions, 691 flow [2023-11-06 22:27:48,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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) [2023-11-06 22:27:48,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:48,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:48,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:27:48,013 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:27:48,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:48,013 INFO L85 PathProgramCache]: Analyzing trace with hash 625893511, now seen corresponding path program 1 times [2023-11-06 22:27:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:48,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482689015] [2023-11-06 22:27:48,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:48,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:48,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482689015] [2023-11-06 22:27:48,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482689015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:48,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:48,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:27:48,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972322456] [2023-11-06 22:27:48,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:48,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:27:48,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:48,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:27:48,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:27:48,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 244 [2023-11-06 22:27:48,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 68 transitions, 691 flow. Second operand has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 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) [2023-11-06 22:27:48,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:48,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 244 [2023-11-06 22:27:48,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:49,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L822-->L838: Formula: (let ((.cse2 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse10 (not .cse9)) (.cse5 (and .cse9 .cse2)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_152 256) 0))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= 0 (mod v_~a$w_buff0_used~0_151 256))) (.cse7 (or .cse5 .cse6 .cse11)) (.cse8 (and .cse10 (not .cse11)))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= (ite .cse0 v_~a$w_buff1_used~0_133 (ite (or .cse5 .cse6 .cse4) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= v_~a~0_91 v_~a$mem_tmp~0_16) (= v_~a$w_buff1~0_66 v_~a$w_buff1~0_65) (= (ite .cse0 v_~a$w_buff0_used~0_152 (ite .cse7 v_~a$w_buff0_used~0_152 (ite .cse8 0 v_~a$w_buff0_used~0_152))) v_~a$w_buff0_used~0_151) (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_12)) (= v_~a$w_buff0~0_75 v_~a$w_buff0~0_74) (= v_~a$r_buff0_thd4~0_63 (ite .cse0 v_~a$r_buff0_thd4~0_64 (ite (or .cse5 (and .cse3 .cse9) .cse4) v_~a$r_buff0_thd4~0_64 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_64)))) (= (ite .cse7 v_~a~0_91 (ite .cse8 v_~a$w_buff0~0_75 v_~a$w_buff1~0_66)) v_~__unbuffered_p3_EBX~0_12))))) InVars {~a~0=v_~a~0_91, ~a$w_buff1~0=v_~a$w_buff1~0_66, ~a$w_buff0~0=v_~a$w_buff0~0_75, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_152, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_151, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_65, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_74, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][146], [30#L838true, Black: 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~__unbuffered_p3_EAX~0 0), 44#L762true, 164#true, 47#L873true, P3Thread1of1ForFork1InUse, Black: 166#(= ~y~0 0), Black: 167#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 174#(= ~x~0 0), P0Thread1of1ForFork0InUse, 179#(= ~y~0 1), 156#true, 185#true, Black: 177#true, Black: 180#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 76#L782true, Black: 152#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 68#P2EXITtrue]) [2023-11-06 22:27:49,849 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 22:27:49,849 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:27:49,849 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:27:49,850 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:27:50,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L822-->L838: Formula: (let ((.cse2 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse10 (not .cse9)) (.cse5 (and .cse9 .cse2)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_152 256) 0))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= 0 (mod v_~a$w_buff0_used~0_151 256))) (.cse7 (or .cse5 .cse6 .cse11)) (.cse8 (and .cse10 (not .cse11)))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= (ite .cse0 v_~a$w_buff1_used~0_133 (ite (or .cse5 .cse6 .cse4) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= v_~a~0_91 v_~a$mem_tmp~0_16) (= v_~a$w_buff1~0_66 v_~a$w_buff1~0_65) (= (ite .cse0 v_~a$w_buff0_used~0_152 (ite .cse7 v_~a$w_buff0_used~0_152 (ite .cse8 0 v_~a$w_buff0_used~0_152))) v_~a$w_buff0_used~0_151) (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_12)) (= v_~a$w_buff0~0_75 v_~a$w_buff0~0_74) (= v_~a$r_buff0_thd4~0_63 (ite .cse0 v_~a$r_buff0_thd4~0_64 (ite (or .cse5 (and .cse3 .cse9) .cse4) v_~a$r_buff0_thd4~0_64 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_64)))) (= (ite .cse7 v_~a~0_91 (ite .cse8 v_~a$w_buff0~0_75 v_~a$w_buff1~0_66)) v_~__unbuffered_p3_EBX~0_12))))) InVars {~a~0=v_~a~0_91, ~a$w_buff1~0=v_~a$w_buff1~0_66, ~a$w_buff0~0=v_~a$w_buff0~0_75, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_152, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_151, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_65, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_74, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][146], [30#L838true, Black: 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~__unbuffered_p3_EAX~0 0), 164#true, 47#L873true, P3Thread1of1ForFork1InUse, Black: 166#(= ~y~0 0), Black: 167#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 174#(= ~x~0 0), P0Thread1of1ForFork0InUse, 179#(= ~y~0 1), 156#true, 185#true, Black: 177#true, Black: 180#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 76#L782true, Black: 152#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 13#L769true, 68#P2EXITtrue]) [2023-11-06 22:27:50,083 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 22:27:50,083 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:27:50,083 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:27:50,084 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:27:50,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L782-->L789: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_22 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse2 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_75 256) 0)) .cse0))) (and (= v_~a$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_74 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$r_buff0_thd2~0_21 256) 0)))) 0 v_~a$r_buff1_thd2~0_20)) (= v_~a$r_buff0_thd2~0_21 (ite .cse2 0 v_~a$r_buff0_thd2~0_22)) (= v_~a$w_buff0_used~0_85 (ite .cse3 0 v_~a$w_buff0_used~0_86)) (= v_~a~0_42 (ite .cse3 v_~a$w_buff0~0_32 (ite .cse4 v_~a$w_buff1~0_27 v_~a~0_43))) (= (ite (or .cse2 .cse4) 0 v_~a$w_buff1_used~0_75) v_~a$w_buff1_used~0_74)))) InVars {~a~0=v_~a~0_43, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_20, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_22, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_75} OutVars{~a~0=v_~a~0_42, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_19, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_74} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][36], [Black: 156#true, Black: 158#(= ~__unbuffered_p3_EAX~0 0), Black: 164#true, 47#L873true, P3Thread1of1ForFork1InUse, Black: 166#(= ~y~0 0), 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork2InUse, 167#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork3InUse, Black: 174#(= ~x~0 0), P0Thread1of1ForFork0InUse, 4#L789true, 179#(= ~y~0 1), 185#true, Black: 177#true, Black: 180#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 13#L769true, Black: 150#true, 68#P2EXITtrue, 89#L822true]) [2023-11-06 22:27:50,084 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 22:27:50,084 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:27:50,085 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:27:50,085 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:27:50,086 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L822-->L838: Formula: (let ((.cse2 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse10 (not .cse9)) (.cse5 (and .cse9 .cse2)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_152 256) 0))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= 0 (mod v_~a$w_buff0_used~0_151 256))) (.cse7 (or .cse5 .cse6 .cse11)) (.cse8 (and .cse10 (not .cse11)))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= (ite .cse0 v_~a$w_buff1_used~0_133 (ite (or .cse5 .cse6 .cse4) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= v_~a~0_91 v_~a$mem_tmp~0_16) (= v_~a$w_buff1~0_66 v_~a$w_buff1~0_65) (= (ite .cse0 v_~a$w_buff0_used~0_152 (ite .cse7 v_~a$w_buff0_used~0_152 (ite .cse8 0 v_~a$w_buff0_used~0_152))) v_~a$w_buff0_used~0_151) (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_12)) (= v_~a$w_buff0~0_75 v_~a$w_buff0~0_74) (= v_~a$r_buff0_thd4~0_63 (ite .cse0 v_~a$r_buff0_thd4~0_64 (ite (or .cse5 (and .cse3 .cse9) .cse4) v_~a$r_buff0_thd4~0_64 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_64)))) (= (ite .cse7 v_~a~0_91 (ite .cse8 v_~a$w_buff0~0_75 v_~a$w_buff1~0_66)) v_~__unbuffered_p3_EBX~0_12))))) InVars {~a~0=v_~a~0_91, ~a$w_buff1~0=v_~a$w_buff1~0_66, ~a$w_buff0~0=v_~a$w_buff0~0_75, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_152, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_151, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_65, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_74, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][146], [30#L838true, Black: 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~__unbuffered_p3_EAX~0 0), 44#L762true, 164#true, P3Thread1of1ForFork1InUse, Black: 166#(= ~y~0 0), Black: 167#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, Black: 174#(= ~x~0 0), 38#L880true, 179#(= ~y~0 1), 156#true, 185#true, Black: 177#true, Black: 180#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 76#L782true, Black: 152#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 68#P2EXITtrue]) [2023-11-06 22:27:50,086 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 22:27:50,086 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:27:50,086 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:27:50,086 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:27:50,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L822-->L838: Formula: (let ((.cse2 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse10 (not .cse9)) (.cse5 (and .cse9 .cse2)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_152 256) 0))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= 0 (mod v_~a$w_buff0_used~0_151 256))) (.cse7 (or .cse5 .cse6 .cse11)) (.cse8 (and .cse10 (not .cse11)))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= (ite .cse0 v_~a$w_buff1_used~0_133 (ite (or .cse5 .cse6 .cse4) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= v_~a~0_91 v_~a$mem_tmp~0_16) (= v_~a$w_buff1~0_66 v_~a$w_buff1~0_65) (= (ite .cse0 v_~a$w_buff0_used~0_152 (ite .cse7 v_~a$w_buff0_used~0_152 (ite .cse8 0 v_~a$w_buff0_used~0_152))) v_~a$w_buff0_used~0_151) (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_12)) (= v_~a$w_buff0~0_75 v_~a$w_buff0~0_74) (= v_~a$r_buff0_thd4~0_63 (ite .cse0 v_~a$r_buff0_thd4~0_64 (ite (or .cse5 (and .cse3 .cse9) .cse4) v_~a$r_buff0_thd4~0_64 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_64)))) (= (ite .cse7 v_~a~0_91 (ite .cse8 v_~a$w_buff0~0_75 v_~a$w_buff1~0_66)) v_~__unbuffered_p3_EBX~0_12))))) InVars {~a~0=v_~a~0_91, ~a$w_buff1~0=v_~a$w_buff1~0_66, ~a$w_buff0~0=v_~a$w_buff0~0_75, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_152, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_151, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_65, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_74, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][146], [30#L838true, Black: 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~__unbuffered_p3_EAX~0 0), 164#true, P3Thread1of1ForFork1InUse, Black: 166#(= ~y~0 0), Black: 167#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, Black: 174#(= ~x~0 0), 38#L880true, 179#(= ~y~0 1), 156#true, 185#true, Black: 177#true, Black: 180#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 76#L782true, 13#L769true, Black: 152#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 68#P2EXITtrue]) [2023-11-06 22:27:50,327 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 22:27:50,327 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:27:50,327 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:27:50,328 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:27:50,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L782-->L789: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_22 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse2 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_75 256) 0)) .cse0))) (and (= v_~a$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_74 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$r_buff0_thd2~0_21 256) 0)))) 0 v_~a$r_buff1_thd2~0_20)) (= v_~a$r_buff0_thd2~0_21 (ite .cse2 0 v_~a$r_buff0_thd2~0_22)) (= v_~a$w_buff0_used~0_85 (ite .cse3 0 v_~a$w_buff0_used~0_86)) (= v_~a~0_42 (ite .cse3 v_~a$w_buff0~0_32 (ite .cse4 v_~a$w_buff1~0_27 v_~a~0_43))) (= (ite (or .cse2 .cse4) 0 v_~a$w_buff1_used~0_75) v_~a$w_buff1_used~0_74)))) InVars {~a~0=v_~a~0_43, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_20, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_22, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_75} OutVars{~a~0=v_~a~0_42, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_19, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_74} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][36], [Black: 156#true, Black: 158#(= ~__unbuffered_p3_EAX~0 0), Black: 164#true, P3Thread1of1ForFork1InUse, Black: 166#(= ~y~0 0), 159#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork2InUse, 167#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, Black: 174#(= ~x~0 0), 38#L880true, 4#L789true, 179#(= ~y~0 1), 185#true, Black: 177#true, Black: 180#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 13#L769true, Black: 150#true, 68#P2EXITtrue, 89#L822true]) [2023-11-06 22:27:50,328 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 22:27:50,328 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:27:50,329 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:27:50,329 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:27:51,015 INFO L124 PetriNetUnfolderBase]: 13209/19546 cut-off events. [2023-11-06 22:27:51,015 INFO L125 PetriNetUnfolderBase]: For 63483/66051 co-relation queries the response was YES. [2023-11-06 22:27:51,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61644 conditions, 19546 events. 13209/19546 cut-off events. For 63483/66051 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 128687 event pairs, 1975 based on Foata normal form. 2004/21158 useless extension candidates. Maximal degree in co-relation 61618. Up to 11998 conditions per place. [2023-11-06 22:27:51,141 INFO L140 encePairwiseOnDemand]: 237/244 looper letters, 134 selfloop transitions, 10 changer transitions 0/169 dead transitions. [2023-11-06 22:27:51,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 169 transitions, 1877 flow [2023-11-06 22:27:51,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:27:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:27:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2023-11-06 22:27:51,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5098360655737705 [2023-11-06 22:27:51,145 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 622 transitions. [2023-11-06 22:27:51,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 622 transitions. [2023-11-06 22:27:51,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:51,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 622 transitions. [2023-11-06 22:27:51,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 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) [2023-11-06 22:27:51,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 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) [2023-11-06 22:27:51,153 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 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) [2023-11-06 22:27:51,153 INFO L175 Difference]: Start difference. First operand has 58 places, 68 transitions, 691 flow. Second operand 5 states and 622 transitions. [2023-11-06 22:27:51,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 169 transitions, 1877 flow [2023-11-06 22:27:51,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 169 transitions, 1869 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-11-06 22:27:51,207 INFO L231 Difference]: Finished difference. Result has 65 places, 77 transitions, 764 flow [2023-11-06 22:27:51,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=764, PETRI_PLACES=65, PETRI_TRANSITIONS=77} [2023-11-06 22:27:51,208 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2023-11-06 22:27:51,208 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 77 transitions, 764 flow [2023-11-06 22:27:51,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 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) [2023-11-06 22:27:51,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:51,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:51,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:27:51,209 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:27:51,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:51,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1421121872, now seen corresponding path program 1 times [2023-11-06 22:27:51,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:51,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030800077] [2023-11-06 22:27:51,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:51,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:51,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:51,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030800077] [2023-11-06 22:27:51,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030800077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:51,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:51,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:27:51,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171474397] [2023-11-06 22:27:51,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:51,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:27:51,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:51,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:27:51,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:27:51,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 244 [2023-11-06 22:27:51,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 77 transitions, 764 flow. Second operand has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 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) [2023-11-06 22:27:51,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:51,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 244 [2023-11-06 22:27:51,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:54,205 INFO L124 PetriNetUnfolderBase]: 10757/16334 cut-off events. [2023-11-06 22:27:54,205 INFO L125 PetriNetUnfolderBase]: For 58048/59915 co-relation queries the response was YES. [2023-11-06 22:27:54,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62503 conditions, 16334 events. 10757/16334 cut-off events. For 58048/59915 co-relation queries the response was YES. Maximal size of possible extension queue 876. Compared 110094 event pairs, 925 based on Foata normal form. 1422/17440 useless extension candidates. Maximal degree in co-relation 62472. Up to 5141 conditions per place. [2023-11-06 22:27:54,303 INFO L140 encePairwiseOnDemand]: 237/244 looper letters, 180 selfloop transitions, 19 changer transitions 2/226 dead transitions. [2023-11-06 22:27:54,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 226 transitions, 2540 flow [2023-11-06 22:27:54,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:27:54,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:27:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 873 transitions. [2023-11-06 22:27:54,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111241217798594 [2023-11-06 22:27:54,308 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 873 transitions. [2023-11-06 22:27:54,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 873 transitions. [2023-11-06 22:27:54,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:54,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 873 transitions. [2023-11-06 22:27:54,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:27:54,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 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) [2023-11-06 22:27:54,317 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 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) [2023-11-06 22:27:54,317 INFO L175 Difference]: Start difference. First operand has 65 places, 77 transitions, 764 flow. Second operand 7 states and 873 transitions. [2023-11-06 22:27:54,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 226 transitions, 2540 flow [2023-11-06 22:27:54,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 226 transitions, 2535 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:27:54,486 INFO L231 Difference]: Finished difference. Result has 73 places, 86 transitions, 893 flow [2023-11-06 22:27:54,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=893, PETRI_PLACES=73, PETRI_TRANSITIONS=86} [2023-11-06 22:27:54,487 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2023-11-06 22:27:54,487 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 86 transitions, 893 flow [2023-11-06 22:27:54,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 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) [2023-11-06 22:27:54,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:27:54,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:54,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:27:54,488 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:27:54,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:54,489 INFO L85 PathProgramCache]: Analyzing trace with hash 374126869, now seen corresponding path program 1 times [2023-11-06 22:27:54,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:54,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428214293] [2023-11-06 22:27:54,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:27:54,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:54,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428214293] [2023-11-06 22:27:54,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428214293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:54,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:54,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:27:54,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403483515] [2023-11-06 22:27:54,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:54,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:27:54,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:54,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:27:54,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:27:54,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 244 [2023-11-06 22:27:54,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 86 transitions, 893 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 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) [2023-11-06 22:27:54,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:27:54,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 244 [2023-11-06 22:27:54,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:27:59,242 INFO L124 PetriNetUnfolderBase]: 21259/31200 cut-off events. [2023-11-06 22:27:59,242 INFO L125 PetriNetUnfolderBase]: For 164599/164599 co-relation queries the response was YES. [2023-11-06 22:27:59,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145155 conditions, 31200 events. 21259/31200 cut-off events. For 164599/164599 co-relation queries the response was YES. Maximal size of possible extension queue 1234. Compared 205369 event pairs, 5327 based on Foata normal form. 66/31266 useless extension candidates. Maximal degree in co-relation 145120. Up to 13768 conditions per place. [2023-11-06 22:27:59,541 INFO L140 encePairwiseOnDemand]: 234/244 looper letters, 96 selfloop transitions, 31 changer transitions 49/176 dead transitions. [2023-11-06 22:27:59,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 176 transitions, 1986 flow [2023-11-06 22:27:59,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:27:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:27:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2023-11-06 22:27:59,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.507172131147541 [2023-11-06 22:27:59,546 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 495 transitions. [2023-11-06 22:27:59,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 495 transitions. [2023-11-06 22:27:59,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:27:59,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 495 transitions. [2023-11-06 22:27:59,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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) [2023-11-06 22:27:59,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 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) [2023-11-06 22:27:59,552 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 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) [2023-11-06 22:27:59,552 INFO L175 Difference]: Start difference. First operand has 73 places, 86 transitions, 893 flow. Second operand 4 states and 495 transitions. [2023-11-06 22:27:59,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 176 transitions, 1986 flow [2023-11-06 22:28:03,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 176 transitions, 1840 flow, removed 51 selfloop flow, removed 3 redundant places. [2023-11-06 22:28:03,645 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 910 flow [2023-11-06 22:28:03,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=910, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2023-11-06 22:28:03,647 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2023-11-06 22:28:03,647 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 910 flow [2023-11-06 22:28:03,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 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) [2023-11-06 22:28:03,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:03,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:03,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:28:03,648 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:28:03,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:03,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1393461618, now seen corresponding path program 1 times [2023-11-06 22:28:03,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:03,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846625501] [2023-11-06 22:28:03,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:03,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:03,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:03,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846625501] [2023-11-06 22:28:03,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846625501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:03,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:03,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:28:03,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096989118] [2023-11-06 22:28:03,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:03,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:28:03,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:03,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:28:03,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:28:03,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 244 [2023-11-06 22:28:03,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 910 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 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) [2023-11-06 22:28:03,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:03,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 244 [2023-11-06 22:28:03,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:06,712 INFO L124 PetriNetUnfolderBase]: 11546/17924 cut-off events. [2023-11-06 22:28:06,712 INFO L125 PetriNetUnfolderBase]: For 93488/93488 co-relation queries the response was YES. [2023-11-06 22:28:06,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77927 conditions, 17924 events. 11546/17924 cut-off events. For 93488/93488 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 118921 event pairs, 2299 based on Foata normal form. 66/17990 useless extension candidates. Maximal degree in co-relation 77889. Up to 9192 conditions per place. [2023-11-06 22:28:06,791 INFO L140 encePairwiseOnDemand]: 234/244 looper letters, 85 selfloop transitions, 36 changer transitions 18/139 dead transitions. [2023-11-06 22:28:06,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 139 transitions, 1683 flow [2023-11-06 22:28:06,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:28:06,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:28:06,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2023-11-06 22:28:06,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030737704918032 [2023-11-06 22:28:06,795 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions. [2023-11-06 22:28:06,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions. [2023-11-06 22:28:06,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:06,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions. [2023-11-06 22:28:06,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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) [2023-11-06 22:28:06,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 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) [2023-11-06 22:28:06,800 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 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) [2023-11-06 22:28:06,800 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 910 flow. Second operand 4 states and 491 transitions. [2023-11-06 22:28:06,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 139 transitions, 1683 flow [2023-11-06 22:28:07,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 139 transitions, 1583 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-11-06 22:28:07,335 INFO L231 Difference]: Finished difference. Result has 73 places, 76 transitions, 945 flow [2023-11-06 22:28:07,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=945, PETRI_PLACES=73, PETRI_TRANSITIONS=76} [2023-11-06 22:28:07,336 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2023-11-06 22:28:07,336 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 76 transitions, 945 flow [2023-11-06 22:28:07,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 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) [2023-11-06 22:28:07,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:07,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:07,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:28:07,337 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:28:07,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:07,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1764038874, now seen corresponding path program 2 times [2023-11-06 22:28:07,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:07,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526019279] [2023-11-06 22:28:07,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:07,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:07,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:07,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526019279] [2023-11-06 22:28:07,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526019279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:07,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:07,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:28:07,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341044253] [2023-11-06 22:28:07,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:07,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:07,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:07,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:07,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:07,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 244 [2023-11-06 22:28:07,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 76 transitions, 945 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) [2023-11-06 22:28:07,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:07,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 244 [2023-11-06 22:28:07,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:09,437 INFO L124 PetriNetUnfolderBase]: 6214/10345 cut-off events. [2023-11-06 22:28:09,437 INFO L125 PetriNetUnfolderBase]: For 38355/38737 co-relation queries the response was YES. [2023-11-06 22:28:09,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39840 conditions, 10345 events. 6214/10345 cut-off events. For 38355/38737 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 74308 event pairs, 1054 based on Foata normal form. 795/10956 useless extension candidates. Maximal degree in co-relation 39802. Up to 3320 conditions per place. [2023-11-06 22:28:09,479 INFO L140 encePairwiseOnDemand]: 237/244 looper letters, 113 selfloop transitions, 14 changer transitions 66/212 dead transitions. [2023-11-06 22:28:09,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 212 transitions, 2828 flow [2023-11-06 22:28:09,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:28:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:28:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 874 transitions. [2023-11-06 22:28:09,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117096018735363 [2023-11-06 22:28:09,483 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 874 transitions. [2023-11-06 22:28:09,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 874 transitions. [2023-11-06 22:28:09,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:09,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 874 transitions. [2023-11-06 22:28:09,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 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) [2023-11-06 22:28:09,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 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) [2023-11-06 22:28:09,492 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 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) [2023-11-06 22:28:09,492 INFO L175 Difference]: Start difference. First operand has 73 places, 76 transitions, 945 flow. Second operand 7 states and 874 transitions. [2023-11-06 22:28:09,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 212 transitions, 2828 flow [2023-11-06 22:28:09,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 212 transitions, 2828 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:28:09,545 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 965 flow [2023-11-06 22:28:09,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=965, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2023-11-06 22:28:09,546 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-11-06 22:28:09,546 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 965 flow [2023-11-06 22:28:09,547 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) [2023-11-06 22:28:09,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:09,547 INFO L208 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] [2023-11-06 22:28:09,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:28:09,547 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:28:09,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:09,548 INFO L85 PathProgramCache]: Analyzing trace with hash 450302617, now seen corresponding path program 1 times [2023-11-06 22:28:09,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:09,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200355348] [2023-11-06 22:28:09,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:09,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:09,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:09,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200355348] [2023-11-06 22:28:09,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200355348] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:09,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:09,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:09,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653470220] [2023-11-06 22:28:09,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:09,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:28:09,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:09,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:28:09,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:09,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 244 [2023-11-06 22:28:09,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 965 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) [2023-11-06 22:28:09,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:09,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 244 [2023-11-06 22:28:09,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:11,484 INFO L124 PetriNetUnfolderBase]: 5206/8803 cut-off events. [2023-11-06 22:28:11,484 INFO L125 PetriNetUnfolderBase]: For 38387/38721 co-relation queries the response was YES. [2023-11-06 22:28:11,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37449 conditions, 8803 events. 5206/8803 cut-off events. For 38387/38721 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 64094 event pairs, 943 based on Foata normal form. 230/8856 useless extension candidates. Maximal degree in co-relation 37406. Up to 3045 conditions per place. [2023-11-06 22:28:11,527 INFO L140 encePairwiseOnDemand]: 237/244 looper letters, 52 selfloop transitions, 17 changer transitions 118/191 dead transitions. [2023-11-06 22:28:11,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 191 transitions, 2558 flow [2023-11-06 22:28:11,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:28:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:28:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1091 transitions. [2023-11-06 22:28:11,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49681238615664847 [2023-11-06 22:28:11,532 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1091 transitions. [2023-11-06 22:28:11,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1091 transitions. [2023-11-06 22:28:11,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:11,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1091 transitions. [2023-11-06 22:28:11,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.22222222222223) internal successors, (1091), 9 states have internal predecessors, (1091), 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) [2023-11-06 22:28:11,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 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) [2023-11-06 22:28:11,542 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 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) [2023-11-06 22:28:11,542 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 965 flow. Second operand 9 states and 1091 transitions. [2023-11-06 22:28:11,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 191 transitions, 2558 flow [2023-11-06 22:28:12,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 191 transitions, 2499 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-11-06 22:28:12,207 INFO L231 Difference]: Finished difference. Result has 87 places, 40 transitions, 356 flow [2023-11-06 22:28:12,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=356, PETRI_PLACES=87, PETRI_TRANSITIONS=40} [2023-11-06 22:28:12,208 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2023-11-06 22:28:12,208 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 40 transitions, 356 flow [2023-11-06 22:28:12,209 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) [2023-11-06 22:28:12,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:12,209 INFO L208 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] [2023-11-06 22:28:12,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:28:12,209 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:28:12,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:12,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1014582549, now seen corresponding path program 1 times [2023-11-06 22:28:12,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:12,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872994010] [2023-11-06 22:28:12,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:12,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:13,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:13,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872994010] [2023-11-06 22:28:13,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872994010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:13,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:13,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:13,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559724067] [2023-11-06 22:28:13,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:13,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:28:13,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:13,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:28:13,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:28:13,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 244 [2023-11-06 22:28:13,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 40 transitions, 356 flow. Second operand has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 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) [2023-11-06 22:28:13,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:13,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 244 [2023-11-06 22:28:13,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:14,413 INFO L124 PetriNetUnfolderBase]: 651/1059 cut-off events. [2023-11-06 22:28:14,414 INFO L125 PetriNetUnfolderBase]: For 4259/4289 co-relation queries the response was YES. [2023-11-06 22:28:14,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4544 conditions, 1059 events. 651/1059 cut-off events. For 4259/4289 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4487 event pairs, 87 based on Foata normal form. 1/1060 useless extension candidates. Maximal degree in co-relation 4500. Up to 521 conditions per place. [2023-11-06 22:28:14,420 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 48 selfloop transitions, 4 changer transitions 43/99 dead transitions. [2023-11-06 22:28:14,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 99 transitions, 961 flow [2023-11-06 22:28:14,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:28:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:28:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2023-11-06 22:28:14,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040983606557377 [2023-11-06 22:28:14,424 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 738 transitions. [2023-11-06 22:28:14,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions. [2023-11-06 22:28:14,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:14,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions. [2023-11-06 22:28:14,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 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) [2023-11-06 22:28:14,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 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) [2023-11-06 22:28:14,431 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 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) [2023-11-06 22:28:14,431 INFO L175 Difference]: Start difference. First operand has 87 places, 40 transitions, 356 flow. Second operand 6 states and 738 transitions. [2023-11-06 22:28:14,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 99 transitions, 961 flow [2023-11-06 22:28:14,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 99 transitions, 593 flow, removed 66 selfloop flow, removed 34 redundant places. [2023-11-06 22:28:14,448 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 185 flow [2023-11-06 22:28:14,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-11-06 22:28:14,449 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2023-11-06 22:28:14,450 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 185 flow [2023-11-06 22:28:14,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 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) [2023-11-06 22:28:14,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:14,451 INFO L208 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] [2023-11-06 22:28:14,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:28:14,451 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:28:14,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1529130873, now seen corresponding path program 2 times [2023-11-06 22:28:14,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:14,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81308088] [2023-11-06 22:28:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:14,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:28:15,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:15,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81308088] [2023-11-06 22:28:15,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81308088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:15,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:15,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:15,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497045889] [2023-11-06 22:28:15,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:15,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:28:15,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:15,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:28:15,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:28:15,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 244 [2023-11-06 22:28:15,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 185 flow. Second operand has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 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) [2023-11-06 22:28:15,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:28:15,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 244 [2023-11-06 22:28:15,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:28:15,824 INFO L124 PetriNetUnfolderBase]: 546/937 cut-off events. [2023-11-06 22:28:15,824 INFO L125 PetriNetUnfolderBase]: For 1046/1056 co-relation queries the response was YES. [2023-11-06 22:28:15,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3076 conditions, 937 events. 546/937 cut-off events. For 1046/1056 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4078 event pairs, 61 based on Foata normal form. 1/938 useless extension candidates. Maximal degree in co-relation 3063. Up to 309 conditions per place. [2023-11-06 22:28:15,828 INFO L140 encePairwiseOnDemand]: 236/244 looper letters, 79 selfloop transitions, 6 changer transitions 40/129 dead transitions. [2023-11-06 22:28:15,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 129 transitions, 862 flow [2023-11-06 22:28:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:28:15,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:28:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 847 transitions. [2023-11-06 22:28:15,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959016393442623 [2023-11-06 22:28:15,832 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 847 transitions. [2023-11-06 22:28:15,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 847 transitions. [2023-11-06 22:28:15,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:28:15,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 847 transitions. [2023-11-06 22:28:15,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:28:15,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 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) [2023-11-06 22:28:15,840 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 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) [2023-11-06 22:28:15,840 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 185 flow. Second operand 7 states and 847 transitions. [2023-11-06 22:28:15,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 129 transitions, 862 flow [2023-11-06 22:28:15,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 129 transitions, 849 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-06 22:28:15,852 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 214 flow [2023-11-06 22:28:15,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2023-11-06 22:28:15,853 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-11-06 22:28:15,853 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 214 flow [2023-11-06 22:28:15,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 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) [2023-11-06 22:28:15,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:28:15,854 INFO L208 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] [2023-11-06 22:28:15,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:28:15,854 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:28:15,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:15,855 INFO L85 PathProgramCache]: Analyzing trace with hash 621187979, now seen corresponding path program 3 times [2023-11-06 22:28:15,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:15,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143569286] [2023-11-06 22:28:15,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:15,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:28:15,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:28:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:28:16,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:28:16,019 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:28:16,020 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-06 22:28:16,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-06 22:28:16,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-06 22:28:16,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-06 22:28:16,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-06 22:28:16,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-06 22:28:16,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-06 22:28:16,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:28:16,025 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:16,031 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:28:16,032 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:28:16,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:28:16 BasicIcfg [2023-11-06 22:28:16,129 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:28:16,138 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:28:16,138 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:28:16,139 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:28:16,139 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:22" (3/4) ... [2023-11-06 22:28:16,140 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:28:16,285 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:28:16,286 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:28:16,286 INFO L158 Benchmark]: Toolchain (without parser) took 55333.85ms. Allocated memory was 157.3MB in the beginning and 11.6GB in the end (delta: 11.5GB). Free memory was 120.6MB in the beginning and 10.3GB in the end (delta: -10.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-06 22:28:16,287 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 121.6MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:28:16,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 795.93ms. Allocated memory is still 157.3MB. Free memory was 119.9MB in the beginning and 114.7MB in the end (delta: 5.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:28:16,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.82ms. Allocated memory is still 157.3MB. Free memory was 114.7MB in the beginning and 111.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:28:16,288 INFO L158 Benchmark]: Boogie Preprocessor took 41.43ms. Allocated memory is still 157.3MB. Free memory was 111.8MB in the beginning and 109.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:28:16,288 INFO L158 Benchmark]: RCFGBuilder took 891.16ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 69.1MB in the end (delta: 40.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-06 22:28:16,289 INFO L158 Benchmark]: TraceAbstraction took 53385.73ms. Allocated memory was 157.3MB in the beginning and 11.6GB in the end (delta: 11.5GB). Free memory was 69.1MB in the beginning and 10.4GB in the end (delta: -10.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-06 22:28:16,289 INFO L158 Benchmark]: Witness Printer took 147.46ms. Allocated memory is still 11.6GB. Free memory was 10.4GB in the beginning and 10.3GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:28:16,291 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 121.6MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 795.93ms. Allocated memory is still 157.3MB. Free memory was 119.9MB in the beginning and 114.7MB in the end (delta: 5.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.82ms. Allocated memory is still 157.3MB. Free memory was 114.7MB in the beginning and 111.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.43ms. Allocated memory is still 157.3MB. Free memory was 111.8MB in the beginning and 109.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 891.16ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 69.1MB in the end (delta: 40.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 53385.73ms. Allocated memory was 157.3MB in the beginning and 11.6GB in the end (delta: 11.5GB). Free memory was 69.1MB in the beginning and 10.4GB in the end (delta: -10.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 147.46ms. Allocated memory is still 11.6GB. Free memory was 10.4GB in the beginning and 10.3GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 139 PlacesBefore, 43 PlacesAfterwards, 128 TransitionsBefore, 31 TransitionsAfterwards, 3404 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 112 TotalNumberOfCompositions, 9349 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3970, independent: 3745, independent conditional: 0, independent unconditional: 3745, dependent: 225, dependent conditional: 0, dependent unconditional: 225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1847, independent: 1802, independent conditional: 0, independent unconditional: 1802, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3970, independent: 1943, independent conditional: 0, independent unconditional: 1943, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 1847, unknown conditional: 0, unknown unconditional: 1847] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 152, Positive conditional cache size: 0, Positive unconditional cache size: 152, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L862] 0 pthread_t t801; [L863] FCALL, FORK 0 pthread_create(&t801, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t801, ((void *)0), P0, ((void *)0))=-2, t801={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] 0 pthread_t t802; [L865] FCALL, FORK 0 pthread_create(&t802, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t802, ((void *)0), P1, ((void *)0))=-1, t801={5:0}, t802={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t803; [L867] FCALL, FORK 0 pthread_create(&t803, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t803, ((void *)0), P2, ((void *)0))=0, t801={5:0}, t802={6:0}, t803={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t804; [L869] FCALL, FORK 0 pthread_create(&t804, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t804, ((void *)0), P3, ((void *)0))=1, t801={5:0}, t802={6:0}, t803={7:0}, t804={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L798] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L801] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L818] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, weak$$choice2=0, x=2, y=2, z=2] [L821] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, weak$$choice2=0, x=2, y=2, z=2] [L824] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 4 a$flush_delayed = weak$$choice2 [L827] 4 a$mem_tmp = a [L828] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L829] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L830] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L831] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L832] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L834] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 __unbuffered_p3_EBX = a [L836] 4 a = a$flush_delayed ? a$mem_tmp : a [L837] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=1, x=2, y=2, z=2] [L840] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L841] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L842] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L843] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L844] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=1, x=2, y=2, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=1, x=2, y=2, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L876] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L877] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L878] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L879] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t801={5:0}, t802={6:0}, t803={7:0}, t804={3:0}, weak$$choice2=1, x=2, y=2, z=2] [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 169 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: 53.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 41.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 851 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 675 mSDsluCounter, 361 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 235 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1803 IncrementalHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 126 mSDtfsCounter, 1803 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=965occurred in iteration=11, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 1544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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! [2023-11-06 22:28:16,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8caa930-0d3a-4b59-9d1f-a6edddaed548/bin/uautomizer-verify-WvqO1wxjHP/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