./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:05:50,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:05:50,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:05:50,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:05:50,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:05:50,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:05:50,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:05:50,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:05:50,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:05:50,331 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:05:50,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:05:50,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:05:50,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:05:50,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:05:50,332 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:05:50,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:05:50,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:05:50,332 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:05:50,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:05:50,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:05:50,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:05:50,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:05:50,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:05:50,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:05:50,332 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:05:50,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:05:50,332 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:05:50,332 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:05:50,333 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:05:50,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:05:50,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:05:50,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:05:50,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:05:50,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:05:50,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:05:50,333 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:05:50,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:05:50,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:05:50,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:05:50,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:05:50,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:05:50,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:05:50,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:05:50,333 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf [2025-03-04 02:05:50,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:05:50,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:05:50,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:05:50,558 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:05:50,559 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:05:50,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i [2025-03-04 02:05:51,732 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bc2a6af/568b12c620f049b3ba1f278e2da4d7ce/FLAG413a40b59 [2025-03-04 02:05:52,008 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:05:52,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i [2025-03-04 02:05:52,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bc2a6af/568b12c620f049b3ba1f278e2da4d7ce/FLAG413a40b59 [2025-03-04 02:05:52,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bc2a6af/568b12c620f049b3ba1f278e2da4d7ce [2025-03-04 02:05:52,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:05:52,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:05:52,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:05:52,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:05:52,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:05:52,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:05:52" (1/1) ... [2025-03-04 02:05:52,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e0c67fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:52, skipping insertion in model container [2025-03-04 02:05:52,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:05:52" (1/1) ... [2025-03-04 02:05:52,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:05:52,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i[949,962] [2025-03-04 02:05:52,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:05:52,653 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:05:52,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i[949,962] [2025-03-04 02:05:52,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:05:52,727 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:05:52,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:52 WrapperNode [2025-03-04 02:05:52,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:05:52,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:05:52,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:05:52,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:05:52,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:52" (1/1) ... [2025-03-04 02:05:52,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:52" (1/1) ... [2025-03-04 02:05:52,764 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2025-03-04 02:05:52,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:05:52,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:05:52,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:05:52,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:05:52,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:52" (1/1) ... [2025-03-04 02:05:52,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:52" (1/1) ... [2025-03-04 02:05:52,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:52" (1/1) ... [2025-03-04 02:05:52,798 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:05:52,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:52" (1/1) ... [2025-03-04 02:05:52,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:52" (1/1) ... [2025-03-04 02:05:52,804 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:52" (1/1) ... [2025-03-04 02:05:52,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:52" (1/1) ... [2025-03-04 02:05:52,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:52" (1/1) ... [2025-03-04 02:05:52,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:52" (1/1) ... [2025-03-04 02:05:52,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:05:52,808 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:05:52,810 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:05:52,815 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:05:52,816 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:52" (1/1) ... [2025-03-04 02:05:52,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:05:52,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:05:52,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:05:52,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:05:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:05:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:05:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 02:05:52,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 02:05:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 02:05:52,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 02:05:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 02:05:52,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 02:05:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-04 02:05:52,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-04 02:05:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:05:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:05:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:05:52,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:05:52,867 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:05:52,956 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:05:52,957 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:05:53,228 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:05:53,228 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:05:53,410 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:05:53,411 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:05:53,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:05:53 BoogieIcfgContainer [2025-03-04 02:05:53,411 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:05:53,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:05:53,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:05:53,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:05:53,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:05:52" (1/3) ... [2025-03-04 02:05:53,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f544468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:05:53, skipping insertion in model container [2025-03-04 02:05:53,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:52" (2/3) ... [2025-03-04 02:05:53,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f544468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:05:53, skipping insertion in model container [2025-03-04 02:05:53,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:05:53" (3/3) ... [2025-03-04 02:05:53,421 INFO L128 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2025-03-04 02:05:53,434 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:05:53,435 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix018_tso.oepc.i that has 5 procedures, 49 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-04 02:05:53,435 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:05:53,489 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:05:53,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2025-03-04 02:05:53,547 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2025-03-04 02:05:53,548 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:05:53,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-03-04 02:05:53,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2025-03-04 02:05:53,555 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2025-03-04 02:05:53,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:05:53,572 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@30adb7b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:05:53,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 02:05:53,577 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:05:53,577 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 02:05:53,577 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:05:53,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:05:53,578 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 02:05:53,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:05:53,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:05:53,583 INFO L85 PathProgramCache]: Analyzing trace with hash -218444636, now seen corresponding path program 1 times [2025-03-04 02:05:53,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:05:53,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233669150] [2025-03-04 02:05:53,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:05:53,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:05:53,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:05:53,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:05:53,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:05:53,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:05:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:05:54,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:05:54,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233669150] [2025-03-04 02:05:54,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233669150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:05:54,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:05:54,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 02:05:54,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984105502] [2025-03-04 02:05:54,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:05:54,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:05:54,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:05:54,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:05:54,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:05:54,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2025-03-04 02:05:54,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2025-03-04 02:05:54,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:05:54,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2025-03-04 02:05:54,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:05:57,695 INFO L124 PetriNetUnfolderBase]: 40307/53476 cut-off events. [2025-03-04 02:05:57,696 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2025-03-04 02:05:57,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106920 conditions, 53476 events. 40307/53476 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 1626. Compared 319461 event pairs, 4977 based on Foata normal form. 1476/54719 useless extension candidates. Maximal degree in co-relation 106908. Up to 45831 conditions per place. [2025-03-04 02:05:57,996 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 59 selfloop transitions, 2 changer transitions 2/70 dead transitions. [2025-03-04 02:05:57,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 284 flow [2025-03-04 02:05:57,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:05:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:05:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-03-04 02:05:58,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2025-03-04 02:05:58,010 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 99 transitions. [2025-03-04 02:05:58,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 284 flow [2025-03-04 02:05:58,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 278 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:05:58,022 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2025-03-04 02:05:58,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-03-04 02:05:58,029 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2025-03-04 02:05:58,030 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2025-03-04 02:05:58,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2025-03-04 02:05:58,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:05:58,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:05:58,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:05:58,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:05:58,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:05:58,033 INFO L85 PathProgramCache]: Analyzing trace with hash 279512778, now seen corresponding path program 1 times [2025-03-04 02:05:58,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:05:58,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313000660] [2025-03-04 02:05:58,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:05:58,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:05:58,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:05:58,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:05:58,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:05:58,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:05:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:05:58,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:05:58,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313000660] [2025-03-04 02:05:58,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313000660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:05:58,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:05:58,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:05:58,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088729914] [2025-03-04 02:05:58,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:05:58,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:05:58,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:05:58,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:05:58,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:05:58,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2025-03-04 02:05:58,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2025-03-04 02:05:58,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:05:58,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2025-03-04 02:05:58,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:06:00,974 INFO L124 PetriNetUnfolderBase]: 32715/47345 cut-off events. [2025-03-04 02:06:00,974 INFO L125 PetriNetUnfolderBase]: For 1700/1700 co-relation queries the response was YES. [2025-03-04 02:06:01,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93295 conditions, 47345 events. 32715/47345 cut-off events. For 1700/1700 co-relation queries the response was YES. Maximal size of possible extension queue 1594. Compared 323853 event pairs, 4407 based on Foata normal form. 1512/47619 useless extension candidates. Maximal degree in co-relation 93285. Up to 24941 conditions per place. [2025-03-04 02:06:01,224 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 74 selfloop transitions, 6 changer transitions 1/88 dead transitions. [2025-03-04 02:06:01,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 88 transitions, 360 flow [2025-03-04 02:06:01,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:06:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:06:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2025-03-04 02:06:01,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6479591836734694 [2025-03-04 02:06:01,226 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 4 states and 127 transitions. [2025-03-04 02:06:01,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 88 transitions, 360 flow [2025-03-04 02:06:01,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:06:01,229 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 134 flow [2025-03-04 02:06:01,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2025-03-04 02:06:01,230 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2025-03-04 02:06:01,230 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 134 flow [2025-03-04 02:06:01,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2025-03-04 02:06:01,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:06:01,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:06:01,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:06:01,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:06:01,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:06:01,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1734560047, now seen corresponding path program 1 times [2025-03-04 02:06:01,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:06:01,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78453638] [2025-03-04 02:06:01,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:06:01,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:06:01,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:06:01,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:06:01,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:06:01,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:06:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:06:01,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:06:01,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78453638] [2025-03-04 02:06:01,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78453638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:06:01,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:06:01,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:06:01,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194005761] [2025-03-04 02:06:01,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:06:01,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:06:01,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:06:01,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:06:01,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:06:01,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2025-03-04 02:06:01,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2025-03-04 02:06:01,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:06:01,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2025-03-04 02:06:01,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:06:03,373 INFO L124 PetriNetUnfolderBase]: 21403/30849 cut-off events. [2025-03-04 02:06:03,374 INFO L125 PetriNetUnfolderBase]: For 6124/6124 co-relation queries the response was YES. [2025-03-04 02:06:03,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68737 conditions, 30849 events. 21403/30849 cut-off events. For 6124/6124 co-relation queries the response was YES. Maximal size of possible extension queue 852. Compared 193711 event pairs, 2563 based on Foata normal form. 1192/31411 useless extension candidates. Maximal degree in co-relation 68725. Up to 11261 conditions per place. [2025-03-04 02:06:03,536 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 96 selfloop transitions, 10 changer transitions 1/114 dead transitions. [2025-03-04 02:06:03,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 114 transitions, 513 flow [2025-03-04 02:06:03,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:06:03,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:06:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2025-03-04 02:06:03,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6693877551020408 [2025-03-04 02:06:03,538 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 134 flow. Second operand 5 states and 164 transitions. [2025-03-04 02:06:03,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 114 transitions, 513 flow [2025-03-04 02:06:03,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 114 transitions, 502 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 02:06:03,546 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 186 flow [2025-03-04 02:06:03,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2025-03-04 02:06:03,547 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2025-03-04 02:06:03,547 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 186 flow [2025-03-04 02:06:03,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2025-03-04 02:06:03,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:06:03,548 INFO L206 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] [2025-03-04 02:06:03,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:06:03,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:06:03,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:06:03,549 INFO L85 PathProgramCache]: Analyzing trace with hash 822372154, now seen corresponding path program 1 times [2025-03-04 02:06:03,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:06:03,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692673543] [2025-03-04 02:06:03,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:06:03,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:06:03,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:06:03,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:06:03,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:06:03,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:06:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:06:03,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:06:03,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692673543] [2025-03-04 02:06:03,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692673543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:06:03,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:06:03,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:06:03,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031035304] [2025-03-04 02:06:03,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:06:03,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:06:03,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:06:03,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:06:03,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:06:03,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2025-03-04 02:06:03,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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) [2025-03-04 02:06:03,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:06:03,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2025-03-04 02:06:03,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:06:04,962 INFO L124 PetriNetUnfolderBase]: 13227/18609 cut-off events. [2025-03-04 02:06:04,963 INFO L125 PetriNetUnfolderBase]: For 11650/11650 co-relation queries the response was YES. [2025-03-04 02:06:05,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45725 conditions, 18609 events. 13227/18609 cut-off events. For 11650/11650 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 102065 event pairs, 2215 based on Foata normal form. 584/18995 useless extension candidates. Maximal degree in co-relation 45711. Up to 5388 conditions per place. [2025-03-04 02:06:05,081 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 116 selfloop transitions, 14 changer transitions 1/138 dead transitions. [2025-03-04 02:06:05,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 138 transitions, 672 flow [2025-03-04 02:06:05,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:06:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:06:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2025-03-04 02:06:05,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6768707482993197 [2025-03-04 02:06:05,083 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 186 flow. Second operand 6 states and 199 transitions. [2025-03-04 02:06:05,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 138 transitions, 672 flow [2025-03-04 02:06:05,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 138 transitions, 642 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 02:06:05,226 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 236 flow [2025-03-04 02:06:05,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2025-03-04 02:06:05,226 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2025-03-04 02:06:05,226 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 236 flow [2025-03-04 02:06:05,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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) [2025-03-04 02:06:05,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:06:05,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:06:05,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:06:05,227 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:06:05,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:06:05,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1313110374, now seen corresponding path program 1 times [2025-03-04 02:06:05,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:06:05,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315693589] [2025-03-04 02:06:05,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:06:05,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:06:05,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:06:05,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:06:05,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:06:05,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:06:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:06:05,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:06:05,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315693589] [2025-03-04 02:06:05,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315693589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:06:05,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:06:05,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:06:05,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149834162] [2025-03-04 02:06:05,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:06:05,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:06:05,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:06:05,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:06:05,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:06:05,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2025-03-04 02:06:05,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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) [2025-03-04 02:06:05,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:06:05,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2025-03-04 02:06:05,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:06:06,649 INFO L124 PetriNetUnfolderBase]: 10367/14229 cut-off events. [2025-03-04 02:06:06,649 INFO L125 PetriNetUnfolderBase]: For 11338/11338 co-relation queries the response was YES. [2025-03-04 02:06:06,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36350 conditions, 14229 events. 10367/14229 cut-off events. For 11338/11338 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 73540 event pairs, 2043 based on Foata normal form. 152/14319 useless extension candidates. Maximal degree in co-relation 36335. Up to 5376 conditions per place. [2025-03-04 02:06:06,714 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 100 selfloop transitions, 18 changer transitions 1/126 dead transitions. [2025-03-04 02:06:06,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 126 transitions, 634 flow [2025-03-04 02:06:06,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:06:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:06:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2025-03-04 02:06:06,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.577259475218659 [2025-03-04 02:06:06,716 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 236 flow. Second operand 7 states and 198 transitions. [2025-03-04 02:06:06,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 126 transitions, 634 flow [2025-03-04 02:06:06,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 126 transitions, 588 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-03-04 02:06:06,904 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 246 flow [2025-03-04 02:06:06,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2025-03-04 02:06:06,904 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2025-03-04 02:06:06,904 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 246 flow [2025-03-04 02:06:06,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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) [2025-03-04 02:06:06,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:06:06,905 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:06:06,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:06:06,905 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:06:06,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:06:06,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1105584863, now seen corresponding path program 1 times [2025-03-04 02:06:06,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:06:06,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315025768] [2025-03-04 02:06:06,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:06:06,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:06:06,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 02:06:07,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 02:06:07,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:06:07,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:06:07,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:06:07,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:06:07,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315025768] [2025-03-04 02:06:07,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315025768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:06:07,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:06:07,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:06:07,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822182871] [2025-03-04 02:06:07,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:06:07,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:06:07,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:06:07,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:06:07,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:06:07,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 49 [2025-03-04 02:06:07,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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) [2025-03-04 02:06:07,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:06:07,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 49 [2025-03-04 02:06:07,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:06:08,688 INFO L124 PetriNetUnfolderBase]: 15379/21073 cut-off events. [2025-03-04 02:06:08,688 INFO L125 PetriNetUnfolderBase]: For 16450/16450 co-relation queries the response was YES. [2025-03-04 02:06:08,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54167 conditions, 21073 events. 15379/21073 cut-off events. For 16450/16450 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 114813 event pairs, 793 based on Foata normal form. 16/21082 useless extension candidates. Maximal degree in co-relation 54151. Up to 11220 conditions per place. [2025-03-04 02:06:08,799 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 79 selfloop transitions, 5 changer transitions 59/149 dead transitions. [2025-03-04 02:06:08,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 149 transitions, 914 flow [2025-03-04 02:06:08,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:06:08,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:06:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2025-03-04 02:06:08,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49489795918367346 [2025-03-04 02:06:08,801 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 246 flow. Second operand 8 states and 194 transitions. [2025-03-04 02:06:08,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 149 transitions, 914 flow [2025-03-04 02:06:09,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 149 transitions, 689 flow, removed 34 selfloop flow, removed 10 redundant places. [2025-03-04 02:06:09,016 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 193 flow [2025-03-04 02:06:09,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=193, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2025-03-04 02:06:09,017 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2025-03-04 02:06:09,017 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 193 flow [2025-03-04 02:06:09,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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) [2025-03-04 02:06:09,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:06:09,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:06:09,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:06:09,017 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:06:09,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:06:09,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2127136583, now seen corresponding path program 2 times [2025-03-04 02:06:09,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:06:09,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22855233] [2025-03-04 02:06:09,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:06:09,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:06:09,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-03-04 02:06:09,091 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 02:06:09,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:06:09,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:06:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:06:09,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:06:09,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22855233] [2025-03-04 02:06:09,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22855233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:06:09,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:06:09,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:06:09,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404069291] [2025-03-04 02:06:09,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:06:09,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:06:09,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:06:09,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:06:09,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:06:09,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 49 [2025-03-04 02:06:09,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 193 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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) [2025-03-04 02:06:09,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:06:09,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 49 [2025-03-04 02:06:09,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:06:10,673 INFO L124 PetriNetUnfolderBase]: 13443/18711 cut-off events. [2025-03-04 02:06:10,673 INFO L125 PetriNetUnfolderBase]: For 8680/8682 co-relation queries the response was YES. [2025-03-04 02:06:10,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46788 conditions, 18711 events. 13443/18711 cut-off events. For 8680/8682 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 102116 event pairs, 750 based on Foata normal form. 17/18724 useless extension candidates. Maximal degree in co-relation 46771. Up to 9206 conditions per place. [2025-03-04 02:06:10,766 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 73 selfloop transitions, 4 changer transitions 54/137 dead transitions. [2025-03-04 02:06:10,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 137 transitions, 709 flow [2025-03-04 02:06:10,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:06:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:06:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2025-03-04 02:06:10,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-04 02:06:10,767 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 193 flow. Second operand 8 states and 182 transitions. [2025-03-04 02:06:10,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 137 transitions, 709 flow [2025-03-04 02:06:10,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 137 transitions, 699 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 02:06:10,773 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 199 flow [2025-03-04 02:06:10,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=199, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2025-03-04 02:06:10,774 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2025-03-04 02:06:10,774 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 199 flow [2025-03-04 02:06:10,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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) [2025-03-04 02:06:10,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:06:10,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:06:10,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:06:10,774 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:06:10,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:06:10,775 INFO L85 PathProgramCache]: Analyzing trace with hash 179519653, now seen corresponding path program 3 times [2025-03-04 02:06:10,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:06:10,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821447183] [2025-03-04 02:06:10,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:06:10,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:06:10,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 1 equivalence classes. [2025-03-04 02:06:10,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 02:06:10,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:06:10,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:06:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:06:11,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:06:11,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821447183] [2025-03-04 02:06:11,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821447183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:06:11,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:06:11,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:06:11,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769453718] [2025-03-04 02:06:11,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:06:11,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:06:11,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:06:11,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:06:11,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:06:11,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 49 [2025-03-04 02:06:11,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 199 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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) [2025-03-04 02:06:11,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:06:11,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 49 [2025-03-04 02:06:11,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:06:12,258 INFO L124 PetriNetUnfolderBase]: 11262/15955 cut-off events. [2025-03-04 02:06:12,259 INFO L125 PetriNetUnfolderBase]: For 8518/8518 co-relation queries the response was YES. [2025-03-04 02:06:12,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39976 conditions, 15955 events. 11262/15955 cut-off events. For 8518/8518 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 87195 event pairs, 2616 based on Foata normal form. 16/15970 useless extension candidates. Maximal degree in co-relation 39956. Up to 9454 conditions per place. [2025-03-04 02:06:12,331 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 66 selfloop transitions, 3 changer transitions 66/141 dead transitions. [2025-03-04 02:06:12,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 141 transitions, 744 flow [2025-03-04 02:06:12,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:06:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:06:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2025-03-04 02:06:12,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4744897959183674 [2025-03-04 02:06:12,332 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 199 flow. Second operand 8 states and 186 transitions. [2025-03-04 02:06:12,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 141 transitions, 744 flow [2025-03-04 02:06:12,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 141 transitions, 730 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 02:06:12,338 INFO L231 Difference]: Finished difference. Result has 76 places, 54 transitions, 193 flow [2025-03-04 02:06:12,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=193, PETRI_PLACES=76, PETRI_TRANSITIONS=54} [2025-03-04 02:06:12,339 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2025-03-04 02:06:12,339 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 54 transitions, 193 flow [2025-03-04 02:06:12,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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) [2025-03-04 02:06:12,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:06:12,339 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:06:12,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:06:12,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:06:12,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:06:12,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2121215043, now seen corresponding path program 4 times [2025-03-04 02:06:12,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:06:12,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186420332] [2025-03-04 02:06:12,340 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:06:12,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:06:12,353 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-04 02:06:12,397 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 02:06:12,397 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:06:12,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:06:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:06:13,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:06:13,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186420332] [2025-03-04 02:06:13,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186420332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:06:13,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:06:13,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:06:13,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732662967] [2025-03-04 02:06:13,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:06:13,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:06:13,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:06:13,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:06:13,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:06:13,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 49 [2025-03-04 02:06:13,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 54 transitions, 193 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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) [2025-03-04 02:06:13,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:06:13,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 49 [2025-03-04 02:06:13,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:06:14,371 INFO L124 PetriNetUnfolderBase]: 11150/16041 cut-off events. [2025-03-04 02:06:14,371 INFO L125 PetriNetUnfolderBase]: For 10617/10620 co-relation queries the response was YES. [2025-03-04 02:06:14,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41306 conditions, 16041 events. 11150/16041 cut-off events. For 10617/10620 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 91988 event pairs, 3826 based on Foata normal form. 16/16043 useless extension candidates. Maximal degree in co-relation 41284. Up to 9504 conditions per place. [2025-03-04 02:06:14,443 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 75 selfloop transitions, 5 changer transitions 18/104 dead transitions. [2025-03-04 02:06:14,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 104 transitions, 555 flow [2025-03-04 02:06:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:06:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:06:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-03-04 02:06:14,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2025-03-04 02:06:14,445 INFO L175 Difference]: Start difference. First operand has 76 places, 54 transitions, 193 flow. Second operand 6 states and 135 transitions. [2025-03-04 02:06:14,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 104 transitions, 555 flow [2025-03-04 02:06:14,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 104 transitions, 541 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-04 02:06:14,450 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 224 flow [2025-03-04 02:06:14,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2025-03-04 02:06:14,451 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2025-03-04 02:06:14,451 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 224 flow [2025-03-04 02:06:14,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 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) [2025-03-04 02:06:14,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:06:14,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:06:14,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:06:14,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:06:14,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:06:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash 150306487, now seen corresponding path program 5 times [2025-03-04 02:06:14,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:06:14,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601837012] [2025-03-04 02:06:14,453 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:06:14,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:06:14,461 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-03-04 02:06:14,501 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 02:06:14,501 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:06:14,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:06:14,501 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:06:14,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 02:06:14,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 02:06:14,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:06:14,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:06:14,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:06:14,597 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:06:14,598 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-03-04 02:06:14,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-04 02:06:14,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-04 02:06:14,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 02:06:14,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-04 02:06:14,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-04 02:06:14,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-04 02:06:14,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:06:14,600 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2025-03-04 02:06:14,687 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:06:14,690 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:06:14,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:06:14 BasicIcfg [2025-03-04 02:06:14,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:06:14,695 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:06:14,695 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:06:14,695 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:06:14,696 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:05:53" (3/4) ... [2025-03-04 02:06:14,696 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 02:06:14,787 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-04 02:06:14,821 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:06:14,823 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:06:14,823 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:06:14,824 INFO L158 Benchmark]: Toolchain (without parser) took 22525.74ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 126.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-03-04 02:06:14,824 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:06:14,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.89ms. Allocated memory is still 167.8MB. Free memory was 126.4MB in the beginning and 102.3MB in the end (delta: 24.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:06:14,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.94ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 99.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:06:14,827 INFO L158 Benchmark]: Boogie Preprocessor took 43.26ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 96.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:06:14,827 INFO L158 Benchmark]: IcfgBuilder took 602.94ms. Allocated memory is still 167.8MB. Free memory was 96.4MB in the beginning and 124.3MB in the end (delta: -28.0MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2025-03-04 02:06:14,827 INFO L158 Benchmark]: TraceAbstraction took 21280.26ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 123.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-03-04 02:06:14,828 INFO L158 Benchmark]: Witness Printer took 128.51ms. Allocated memory is still 3.1GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 02:06:14,828 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.21ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.89ms. Allocated memory is still 167.8MB. Free memory was 126.4MB in the beginning and 102.3MB in the end (delta: 24.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.94ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 99.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.26ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 96.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 602.94ms. Allocated memory is still 167.8MB. Free memory was 96.4MB in the beginning and 124.3MB in the end (delta: -28.0MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. * TraceAbstraction took 21280.26ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 123.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 128.51ms. Allocated memory is still 3.1GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L853] 0 pthread_t t489; [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t490; [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=-3, t490=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t491; [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=-3, t490=-2, t491=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L859] 0 pthread_t t492; [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=-3, t490=-2, t491=-1, t492=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L802] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L822] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L828] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489=-3, t490=-2, t491=-1, t492=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489=-3, t490=-2, t491=-1, t492=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489=-3, t490=-2, t491=-1, t492=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - 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: 856]: 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: 858]: 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: 860]: 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: 854]: 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, 83 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: 21.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 917 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 907 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1910 IncrementalHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 12 mSDtfsCounter, 1910 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=5, InterpolantAutomatonStates: 55, 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.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 1484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-04 02:06:14,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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