./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix050.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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/mix050.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 a3c87384db48703a1f350b065ac4130898667537456cdd449d5c78c22c9ba26d --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:51:15,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:51:15,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:51:15,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:51:15,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:51:15,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:51:15,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:51:15,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:51:15,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:51:15,295 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:51:15,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:51:15,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:51:15,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:51:15,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:51:15,296 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:51:15,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:51:15,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:51:15,297 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:51:15,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:51:15,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:51:15,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:51:15,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:51:15,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:51:15,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:51:15,297 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:51:15,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:51:15,297 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:51:15,298 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:51:15,298 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:51:15,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:51:15,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:51:15,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:51:15,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:51:15,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:51:15,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:51:15,298 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:51:15,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:51:15,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:51:15,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:51:15,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:51:15,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:51:15,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:51:15,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:51:15,299 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 -> a3c87384db48703a1f350b065ac4130898667537456cdd449d5c78c22c9ba26d [2025-03-14 00:51:15,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:51:15,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:51:15,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:51:15,538 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:51:15,538 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:51:15,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix050.i [2025-03-14 00:51:16,649 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fd830b93/442ec54ee88842e7bd1b99efb19b0b1f/FLAG45f00e238 [2025-03-14 00:51:16,946 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:51:16,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix050.i [2025-03-14 00:51:16,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fd830b93/442ec54ee88842e7bd1b99efb19b0b1f/FLAG45f00e238 [2025-03-14 00:51:17,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fd830b93/442ec54ee88842e7bd1b99efb19b0b1f [2025-03-14 00:51:17,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:51:17,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:51:17,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:51:17,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:51:17,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:51:17,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:51:17" (1/1) ... [2025-03-14 00:51:17,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d30443a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:51:17, skipping insertion in model container [2025-03-14 00:51:17,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:51:17" (1/1) ... [2025-03-14 00:51:17,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:51:17,366 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/mix050.i[940,953] [2025-03-14 00:51:17,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:51:17,489 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:51:17,498 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/mix050.i[940,953] [2025-03-14 00:51:17,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:51:17,587 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:51:17,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:51:17 WrapperNode [2025-03-14 00:51:17,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:51:17,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:51:17,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:51:17,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:51:17,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:51:17" (1/1) ... [2025-03-14 00:51:17,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:51:17" (1/1) ... [2025-03-14 00:51:17,630 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2025-03-14 00:51:17,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:51:17,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:51:17,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:51:17,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:51:17,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:51:17" (1/1) ... [2025-03-14 00:51:17,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:51:17" (1/1) ... [2025-03-14 00:51:17,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:51:17" (1/1) ... [2025-03-14 00:51:17,669 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-14 00:51:17,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:51:17" (1/1) ... [2025-03-14 00:51:17,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:51:17" (1/1) ... [2025-03-14 00:51:17,684 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:51:17" (1/1) ... [2025-03-14 00:51:17,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:51:17" (1/1) ... [2025-03-14 00:51:17,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:51:17" (1/1) ... [2025-03-14 00:51:17,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:51:17" (1/1) ... [2025-03-14 00:51:17,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:51:17,690 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:51:17,690 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:51:17,691 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:51:17,691 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:51:17" (1/1) ... [2025-03-14 00:51:17,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:51:17,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:51:17,722 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-14 00:51:17,725 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-14 00:51:17,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 00:51:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:51:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-14 00:51:17,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-14 00:51:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-14 00:51:17,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-14 00:51:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-14 00:51:17,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-14 00:51:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-14 00:51:17,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-14 00:51:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:51:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 00:51:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:51:17,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:51:17,745 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:51:17,864 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:51:17,868 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:51:18,119 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:51:18,120 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:51:18,120 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:51:18,355 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:51:18,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:51:18 BoogieIcfgContainer [2025-03-14 00:51:18,356 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:51:18,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:51:18,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:51:18,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:51:18,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:51:17" (1/3) ... [2025-03-14 00:51:18,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cded5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:51:18, skipping insertion in model container [2025-03-14 00:51:18,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:51:17" (2/3) ... [2025-03-14 00:51:18,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cded5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:51:18, skipping insertion in model container [2025-03-14 00:51:18,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:51:18" (3/3) ... [2025-03-14 00:51:18,365 INFO L128 eAbstractionObserver]: Analyzing ICFG mix050.i [2025-03-14 00:51:18,374 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:51:18,376 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix050.i that has 5 procedures, 48 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-14 00:51:18,376 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:51:18,424 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:51:18,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 112 flow [2025-03-14 00:51:18,481 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2025-03-14 00:51:18,483 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:51:18,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2025-03-14 00:51:18,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 48 transitions, 112 flow [2025-03-14 00:51:18,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 44 transitions, 100 flow [2025-03-14 00:51:18,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:51:18,505 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;@2184554b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:51:18,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-14 00:51:18,509 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:51:18,509 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-14 00:51:18,509 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:51:18,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:51:18,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-14 00:51:18,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:51:18,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:51:18,514 INFO L85 PathProgramCache]: Analyzing trace with hash 12728721, now seen corresponding path program 1 times [2025-03-14 00:51:18,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:51:18,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79804026] [2025-03-14 00:51:18,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:51:18,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:51:18,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-14 00:51:18,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-14 00:51:18,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:51:18,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:51:18,830 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-14 00:51:18,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:51:18,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79804026] [2025-03-14 00:51:18,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79804026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:51:18,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:51:18,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-14 00:51:18,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860765855] [2025-03-14 00:51:18,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:51:18,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:51:18,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:51:18,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:51:18,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:51:18,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-03-14 00:51:18,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-14 00:51:18,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:51:18,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-03-14 00:51:18,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:51:22,050 INFO L124 PetriNetUnfolderBase]: 34475/45912 cut-off events. [2025-03-14 00:51:22,051 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2025-03-14 00:51:22,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91796 conditions, 45912 events. 34475/45912 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 1452. Compared 275215 event pairs, 4235 based on Foata normal form. 1260/46942 useless extension candidates. Maximal degree in co-relation 91784. Up to 39311 conditions per place. [2025-03-14 00:51:22,323 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 59 selfloop transitions, 2 changer transitions 2/70 dead transitions. [2025-03-14 00:51:22,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 287 flow [2025-03-14 00:51:22,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:51:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:51:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-03-14 00:51:22,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-03-14 00:51:22,336 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 99 transitions. [2025-03-14 00:51:22,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 287 flow [2025-03-14 00:51:22,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 280 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 00:51:22,349 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 94 flow [2025-03-14 00:51:22,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, 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=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2025-03-14 00:51:22,355 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2025-03-14 00:51:22,355 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 94 flow [2025-03-14 00:51:22,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-14 00:51:22,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:51:22,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:51:22,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:51:22,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:51:22,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:51:22,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1087790054, now seen corresponding path program 1 times [2025-03-14 00:51:22,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:51:22,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153719203] [2025-03-14 00:51:22,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:51:22,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:51:22,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 00:51:22,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 00:51:22,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:51:22,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:51:22,567 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-14 00:51:22,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:51:22,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153719203] [2025-03-14 00:51:22,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153719203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:51:22,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:51:22,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:51:22,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59704896] [2025-03-14 00:51:22,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:51:22,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:51:22,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:51:22,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:51:22,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:51:22,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-03-14 00:51:22,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 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-14 00:51:22,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:51:22,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-03-14 00:51:22,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:51:24,822 INFO L124 PetriNetUnfolderBase]: 28315/41081 cut-off events. [2025-03-14 00:51:24,822 INFO L125 PetriNetUnfolderBase]: For 1494/1494 co-relation queries the response was YES. [2025-03-14 00:51:24,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81017 conditions, 41081 events. 28315/41081 cut-off events. For 1494/1494 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 278403 event pairs, 3739 based on Foata normal form. 1296/41291 useless extension candidates. Maximal degree in co-relation 81007. Up to 21681 conditions per place. [2025-03-14 00:51:25,000 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 71 selfloop transitions, 6 changer transitions 1/85 dead transitions. [2025-03-14 00:51:25,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 348 flow [2025-03-14 00:51:25,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:51:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:51:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2025-03-14 00:51:25,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-03-14 00:51:25,002 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 4 states and 124 transitions. [2025-03-14 00:51:25,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 348 flow [2025-03-14 00:51:25,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 85 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:51:25,006 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 132 flow [2025-03-14 00:51:25,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2025-03-14 00:51:25,007 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2025-03-14 00:51:25,007 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 132 flow [2025-03-14 00:51:25,007 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-14 00:51:25,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:51:25,007 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-14 00:51:25,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:51:25,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:51:25,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:51:25,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1023867263, now seen corresponding path program 1 times [2025-03-14 00:51:25,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:51:25,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973889208] [2025-03-14 00:51:25,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:51:25,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:51:25,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 00:51:25,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 00:51:25,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:51:25,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:51:25,262 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-14 00:51:25,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:51:25,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973889208] [2025-03-14 00:51:25,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973889208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:51:25,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:51:25,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:51:25,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899208744] [2025-03-14 00:51:25,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:51:25,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:51:25,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:51:25,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:51:25,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:51:25,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-03-14 00:51:25,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 132 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-14 00:51:25,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:51:25,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-03-14 00:51:25,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:51:27,027 INFO L124 PetriNetUnfolderBase]: 18843/27257 cut-off events. [2025-03-14 00:51:27,028 INFO L125 PetriNetUnfolderBase]: For 5266/5266 co-relation queries the response was YES. [2025-03-14 00:51:27,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60873 conditions, 27257 events. 18843/27257 cut-off events. For 5266/5266 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 170118 event pairs, 2151 based on Foata normal form. 1040/27723 useless extension candidates. Maximal degree in co-relation 60861. Up to 10161 conditions per place. [2025-03-14 00:51:27,157 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 92 selfloop transitions, 10 changer transitions 1/110 dead transitions. [2025-03-14 00:51:27,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 110 transitions, 497 flow [2025-03-14 00:51:27,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:51:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:51:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-03-14 00:51:27,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-14 00:51:27,159 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 132 flow. Second operand 5 states and 160 transitions. [2025-03-14 00:51:27,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 110 transitions, 497 flow [2025-03-14 00:51:27,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 110 transitions, 486 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-14 00:51:27,169 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 184 flow [2025-03-14 00:51:27,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2025-03-14 00:51:27,171 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2025-03-14 00:51:27,171 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 184 flow [2025-03-14 00:51:27,171 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-14 00:51:27,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:51:27,172 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-14 00:51:27,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:51:27,172 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:51:27,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:51:27,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1494059759, now seen corresponding path program 1 times [2025-03-14 00:51:27,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:51:27,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89466254] [2025-03-14 00:51:27,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:51:27,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:51:27,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 00:51:27,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 00:51:27,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:51:27,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:51:27,449 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-14 00:51:27,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:51:27,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89466254] [2025-03-14 00:51:27,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89466254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:51:27,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:51:27,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 00:51:27,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857101228] [2025-03-14 00:51:27,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:51:27,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:51:27,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:51:27,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:51:27,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:51:27,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-03-14 00:51:27,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-14 00:51:27,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:51:27,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-03-14 00:51:27,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:51:30,622 INFO L124 PetriNetUnfolderBase]: 31861/43970 cut-off events. [2025-03-14 00:51:30,623 INFO L125 PetriNetUnfolderBase]: For 23740/23740 co-relation queries the response was YES. [2025-03-14 00:51:30,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107794 conditions, 43970 events. 31861/43970 cut-off events. For 23740/23740 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 265214 event pairs, 5865 based on Foata normal form. 0/43217 useless extension candidates. Maximal degree in co-relation 107780. Up to 20596 conditions per place. [2025-03-14 00:51:30,783 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 92 selfloop transitions, 2 changer transitions 108/207 dead transitions. [2025-03-14 00:51:30,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 207 transitions, 1120 flow [2025-03-14 00:51:30,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 00:51:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 00:51:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 262 transitions. [2025-03-14 00:51:30,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6064814814814815 [2025-03-14 00:51:30,785 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 184 flow. Second operand 9 states and 262 transitions. [2025-03-14 00:51:30,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 207 transitions, 1120 flow [2025-03-14 00:51:30,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 207 transitions, 1048 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-03-14 00:51:30,866 INFO L231 Difference]: Finished difference. Result has 68 places, 49 transitions, 174 flow [2025-03-14 00:51:30,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=174, PETRI_PLACES=68, PETRI_TRANSITIONS=49} [2025-03-14 00:51:30,867 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2025-03-14 00:51:30,867 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 49 transitions, 174 flow [2025-03-14 00:51:30,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-14 00:51:30,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:51:30,867 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-14 00:51:30,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:51:30,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:51:30,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:51:30,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1452937791, now seen corresponding path program 2 times [2025-03-14 00:51:30,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:51:30,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120491815] [2025-03-14 00:51:30,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:51:30,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:51:30,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-14 00:51:30,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 00:51:30,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:51:30,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:51:31,075 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-14 00:51:31,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:51:31,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120491815] [2025-03-14 00:51:31,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120491815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:51:31,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:51:31,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:51:31,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159985531] [2025-03-14 00:51:31,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:51:31,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:51:31,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:51:31,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:51:31,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:51:31,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-03-14 00:51:31,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 49 transitions, 174 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-14 00:51:31,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:51:31,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-03-14 00:51:31,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:51:32,525 INFO L124 PetriNetUnfolderBase]: 18125/25339 cut-off events. [2025-03-14 00:51:32,526 INFO L125 PetriNetUnfolderBase]: For 11782/11782 co-relation queries the response was YES. [2025-03-14 00:51:32,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61878 conditions, 25339 events. 18125/25339 cut-off events. For 11782/11782 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 143916 event pairs, 2541 based on Foata normal form. 896/26183 useless extension candidates. Maximal degree in co-relation 61861. Up to 7844 conditions per place. [2025-03-14 00:51:32,672 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 110 selfloop transitions, 14 changer transitions 5/135 dead transitions. [2025-03-14 00:51:32,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 135 transitions, 685 flow [2025-03-14 00:51:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:51:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:51:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2025-03-14 00:51:32,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6736111111111112 [2025-03-14 00:51:32,676 INFO L175 Difference]: Start difference. First operand has 68 places, 49 transitions, 174 flow. Second operand 6 states and 194 transitions. [2025-03-14 00:51:32,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 135 transitions, 685 flow [2025-03-14 00:51:32,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 135 transitions, 670 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 00:51:32,691 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 244 flow [2025-03-14 00:51:32,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=244, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2025-03-14 00:51:32,694 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2025-03-14 00:51:32,694 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 244 flow [2025-03-14 00:51:32,695 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-14 00:51:32,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:51:32,695 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-14 00:51:32,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:51:32,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:51:32,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:51:32,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1842391827, now seen corresponding path program 1 times [2025-03-14 00:51:32,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:51:32,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833840826] [2025-03-14 00:51:32,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:51:32,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:51:32,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 00:51:32,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:51:32,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:51:32,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:51:32,975 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-14 00:51:32,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:51:32,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833840826] [2025-03-14 00:51:32,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833840826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:51:32,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:51:32,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 00:51:32,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542328022] [2025-03-14 00:51:32,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:51:32,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:51:32,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:51:32,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:51:32,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:51:32,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-03-14 00:51:32,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-14 00:51:32,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:51:32,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-03-14 00:51:32,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:51:35,739 INFO L124 PetriNetUnfolderBase]: 26165/36391 cut-off events. [2025-03-14 00:51:35,740 INFO L125 PetriNetUnfolderBase]: For 36377/36377 co-relation queries the response was YES. [2025-03-14 00:51:35,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98870 conditions, 36391 events. 26165/36391 cut-off events. For 36377/36377 co-relation queries the response was YES. Maximal size of possible extension queue 985. Compared 213106 event pairs, 3199 based on Foata normal form. 152/36500 useless extension candidates. Maximal degree in co-relation 98853. Up to 18870 conditions per place. [2025-03-14 00:51:35,970 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 84 selfloop transitions, 2 changer transitions 66/157 dead transitions. [2025-03-14 00:51:35,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 157 transitions, 1020 flow [2025-03-14 00:51:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:51:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:51:35,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2025-03-14 00:51:35,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6076388888888888 [2025-03-14 00:51:35,972 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 244 flow. Second operand 6 states and 175 transitions. [2025-03-14 00:51:35,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 157 transitions, 1020 flow [2025-03-14 00:51:36,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 157 transitions, 904 flow, removed 25 selfloop flow, removed 5 redundant places. [2025-03-14 00:51:36,444 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 218 flow [2025-03-14 00:51:36,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2025-03-14 00:51:36,444 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2025-03-14 00:51:36,445 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 218 flow [2025-03-14 00:51:36,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-14 00:51:36,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:51:36,445 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-14 00:51:36,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:51:36,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:51:36,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:51:36,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1815301907, now seen corresponding path program 2 times [2025-03-14 00:51:36,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:51:36,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58116415] [2025-03-14 00:51:36,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:51:36,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:51:36,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-14 00:51:36,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:51:36,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:51:36,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:51:36,693 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-14 00:51:36,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:51:36,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58116415] [2025-03-14 00:51:36,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58116415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:51:36,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:51:36,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:51:36,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168729540] [2025-03-14 00:51:36,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:51:36,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:51:36,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:51:36,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:51:36,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:51:36,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-03-14 00:51:36,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 218 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-14 00:51:36,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:51:36,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-03-14 00:51:36,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:51:38,508 INFO L124 PetriNetUnfolderBase]: 22053/30459 cut-off events. [2025-03-14 00:51:38,509 INFO L125 PetriNetUnfolderBase]: For 20101/20111 co-relation queries the response was YES. [2025-03-14 00:51:38,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78384 conditions, 30459 events. 22053/30459 cut-off events. For 20101/20111 co-relation queries the response was YES. Maximal size of possible extension queue 988. Compared 176492 event pairs, 3089 based on Foata normal form. 488/30906 useless extension candidates. Maximal degree in co-relation 78365. Up to 10180 conditions per place. [2025-03-14 00:51:38,645 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 90 selfloop transitions, 18 changer transitions 13/127 dead transitions. [2025-03-14 00:51:38,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 127 transitions, 666 flow [2025-03-14 00:51:38,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:51:38,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:51:38,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2025-03-14 00:51:38,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5773809523809523 [2025-03-14 00:51:38,647 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 218 flow. Second operand 7 states and 194 transitions. [2025-03-14 00:51:38,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 127 transitions, 666 flow [2025-03-14 00:51:39,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 127 transitions, 658 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-14 00:51:39,258 INFO L231 Difference]: Finished difference. Result has 72 places, 52 transitions, 254 flow [2025-03-14 00:51:39,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=64, 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=254, PETRI_PLACES=72, PETRI_TRANSITIONS=52} [2025-03-14 00:51:39,259 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places. [2025-03-14 00:51:39,259 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 254 flow [2025-03-14 00:51:39,259 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-14 00:51:39,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:51:39,260 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] [2025-03-14 00:51:39,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:51:39,260 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:51:39,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:51:39,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1985072721, now seen corresponding path program 1 times [2025-03-14 00:51:39,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:51:39,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449190209] [2025-03-14 00:51:39,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:51:39,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:51:39,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 00:51:39,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 00:51:39,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:51:39,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:51:39,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-14 00:51:39,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:51:39,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449190209] [2025-03-14 00:51:39,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449190209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:51:39,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:51:39,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:51:39,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122236384] [2025-03-14 00:51:39,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:51:39,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:51:39,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:51:39,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:51:39,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:51:39,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-03-14 00:51:39,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 52 transitions, 254 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-14 00:51:39,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:51:39,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-03-14 00:51:39,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:51:40,944 INFO L124 PetriNetUnfolderBase]: 11529/16309 cut-off events. [2025-03-14 00:51:40,945 INFO L125 PetriNetUnfolderBase]: For 16038/16048 co-relation queries the response was YES. [2025-03-14 00:51:41,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44417 conditions, 16309 events. 11529/16309 cut-off events. For 16038/16048 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 91568 event pairs, 1765 based on Foata normal form. 16/16273 useless extension candidates. Maximal degree in co-relation 44397. Up to 7968 conditions per place. [2025-03-14 00:51:41,063 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 62 selfloop transitions, 1 changer transitions 48/116 dead transitions. [2025-03-14 00:51:41,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 116 transitions, 800 flow [2025-03-14 00:51:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:51:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:51:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-03-14 00:51:41,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2025-03-14 00:51:41,064 INFO L175 Difference]: Start difference. First operand has 72 places, 52 transitions, 254 flow. Second operand 6 states and 136 transitions. [2025-03-14 00:51:41,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 116 transitions, 800 flow [2025-03-14 00:51:41,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 116 transitions, 567 flow, removed 38 selfloop flow, removed 12 redundant places. [2025-03-14 00:51:41,234 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 165 flow [2025-03-14 00:51:41,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2025-03-14 00:51:41,235 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 11 predicate places. [2025-03-14 00:51:41,235 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 165 flow [2025-03-14 00:51:41,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-14 00:51:41,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:51:41,235 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] [2025-03-14 00:51:41,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:51:41,235 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:51:41,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:51:41,236 INFO L85 PathProgramCache]: Analyzing trace with hash -216253835, now seen corresponding path program 2 times [2025-03-14 00:51:41,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:51:41,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69422291] [2025-03-14 00:51:41,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:51:41,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:51:41,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes. [2025-03-14 00:51:41,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 00:51:41,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:51:41,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:51:42,404 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-14 00:51:42,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:51:42,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69422291] [2025-03-14 00:51:42,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69422291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:51:42,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:51:42,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 00:51:42,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846068842] [2025-03-14 00:51:42,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:51:42,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 00:51:42,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:51:42,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 00:51:42,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 00:51:42,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-03-14 00:51:42,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 165 flow. Second operand has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 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-14 00:51:42,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:51:42,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-03-14 00:51:42,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:51:43,710 INFO L124 PetriNetUnfolderBase]: 11617/16720 cut-off events. [2025-03-14 00:51:43,710 INFO L125 PetriNetUnfolderBase]: For 5003/5006 co-relation queries the response was YES. [2025-03-14 00:51:43,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40060 conditions, 16720 events. 11617/16720 cut-off events. For 5003/5006 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 99668 event pairs, 3817 based on Foata normal form. 16/16725 useless extension candidates. Maximal degree in co-relation 40044. Up to 6720 conditions per place. [2025-03-14 00:51:43,836 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 59 selfloop transitions, 3 changer transitions 105/172 dead transitions. [2025-03-14 00:51:43,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 172 transitions, 884 flow [2025-03-14 00:51:43,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 00:51:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 00:51:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions. [2025-03-14 00:51:43,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47453703703703703 [2025-03-14 00:51:43,838 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 165 flow. Second operand 9 states and 205 transitions. [2025-03-14 00:51:43,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 172 transitions, 884 flow [2025-03-14 00:51:43,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 172 transitions, 871 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 00:51:43,843 INFO L231 Difference]: Finished difference. Result has 74 places, 52 transitions, 180 flow [2025-03-14 00:51:43,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=74, PETRI_TRANSITIONS=52} [2025-03-14 00:51:43,843 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 18 predicate places. [2025-03-14 00:51:43,844 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 52 transitions, 180 flow [2025-03-14 00:51:43,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 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-14 00:51:43,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:51:43,844 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] [2025-03-14 00:51:43,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:51:43,844 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:51:43,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:51:43,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1411944731, now seen corresponding path program 3 times [2025-03-14 00:51:43,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:51:43,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840502430] [2025-03-14 00:51:43,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:51:43,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:51:43,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 1 equivalence classes. [2025-03-14 00:51:43,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 00:51:43,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 00:51:43,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:51:43,919 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:51:43,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 00:51:43,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 00:51:43,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:51:43,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:51:44,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:51:44,020 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:51:44,021 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-03-14 00:51:44,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-14 00:51:44,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-14 00:51:44,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-14 00:51:44,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-14 00:51:44,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-14 00:51:44,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-14 00:51:44,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 00:51:44,023 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1] [2025-03-14 00:51:44,105 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:51:44,105 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:51:44,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:51:44 BasicIcfg [2025-03-14 00:51:44,108 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:51:44,109 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:51:44,109 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:51:44,109 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:51:44,110 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:51:18" (3/4) ... [2025-03-14 00:51:44,110 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-14 00:51:44,191 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-14 00:51:44,228 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:51:44,228 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:51:44,228 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:51:44,230 INFO L158 Benchmark]: Toolchain (without parser) took 27012.78ms. Allocated memory was 167.8MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 130.3MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-03-14 00:51:44,230 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:51:44,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.87ms. Allocated memory is still 167.8MB. Free memory was 129.9MB in the beginning and 105.9MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-14 00:51:44,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.09ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 103.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:51:44,232 INFO L158 Benchmark]: Boogie Preprocessor took 55.64ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 100.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:51:44,233 INFO L158 Benchmark]: IcfgBuilder took 665.22ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 106.0MB in the end (delta: -5.6MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2025-03-14 00:51:44,233 INFO L158 Benchmark]: TraceAbstraction took 25750.61ms. Allocated memory was 167.8MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 106.0MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-03-14 00:51:44,233 INFO L158 Benchmark]: Witness Printer took 119.81ms. Allocated memory is still 5.5GB. Free memory was 3.7GB in the beginning and 3.7GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-14 00:51:44,234 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.14ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.87ms. Allocated memory is still 167.8MB. Free memory was 129.9MB in the beginning and 105.9MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.09ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 103.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.64ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 100.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 665.22ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 106.0MB in the end (delta: -5.6MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 25750.61ms. Allocated memory was 167.8MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 106.0MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 119.81ms. Allocated memory is still 5.5GB. Free memory was 3.7GB in the beginning and 3.7GB 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L863] 0 pthread_t t1321; [L864] FCALL, FORK 0 pthread_create(&t1321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1321=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1322; [L866] FCALL, FORK 0 pthread_create(&t1322, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1321=-2, t1322=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t1323; [L868] FCALL, FORK 0 pthread_create(&t1323, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1321=-2, t1322=-1, t1323=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] 0 pthread_t t1324; [L870] FCALL, FORK 0 pthread_create(&t1324, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1321=-2, t1322=-1, t1323=0, t1324=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 a$flush_delayed = weak$$choice2 [L828] 4 a$mem_tmp = a [L829] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L830] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L831] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L832] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L833] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L835] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = a [L837] 4 a = a$flush_delayed ? a$mem_tmp : a [L838] 4 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L841] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L842] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L843] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L844] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L845] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1321=-2, t1322=-1, t1323=0, t1324=1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L877] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L878] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L879] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L880] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1321=-2, t1322=-1, t1323=0, t1324=1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1321=-2, t1322=-1, t1323=0, t1324=1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L885] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, 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: 870]: 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: 868]: 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: 866]: 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: 864]: 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, 81 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: 25.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 968 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 966 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2290 IncrementalHoareTripleChecker+Invalid, 2335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 5 mSDtfsCounter, 2290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=7, 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.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 1333 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-14 00:51:44,251 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