./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-lit/qw2004-2b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-lit/qw2004-2b.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 f17f6182d2330561fe6717b6a061d0dded698483f9e32b37a3b36e1144855a29 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:11:54,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:11:54,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:11:54,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:11:54,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:11:54,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:11:54,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:11:54,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:11:54,925 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:11:54,925 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:11:54,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:11:54,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:11:54,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:11:54,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:11:54,925 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:11:54,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:11:54,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:11:54,927 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:11:54,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:11:54,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:11:54,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:11:54,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:11:54,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:11:54,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:11:54,928 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:11:54,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:11:54,928 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:11:54,928 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:11:54,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:11:54,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:11:54,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:11:54,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:11:54,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:11:54,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:11:54,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:11:54,929 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:11:54,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:11:54,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:11:54,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:11:54,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:11:54,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:11:54,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:11:54,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:11:54,929 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 -> f17f6182d2330561fe6717b6a061d0dded698483f9e32b37a3b36e1144855a29 [2025-03-04 02:11:55,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:11:55,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:11:55,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:11:55,181 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:11:55,182 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:11:55,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/qw2004-2b.i [2025-03-04 02:11:56,375 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/963bb05e7/a36b1a46bc0f42d299a94ade959c2e3b/FLAGc010a2fbd [2025-03-04 02:11:56,632 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:11:56,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2b.i [2025-03-04 02:11:56,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/963bb05e7/a36b1a46bc0f42d299a94ade959c2e3b/FLAGc010a2fbd [2025-03-04 02:11:56,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/963bb05e7/a36b1a46bc0f42d299a94ade959c2e3b [2025-03-04 02:11:56,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:11:56,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:11:56,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:11:56,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:11:56,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:11:56,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:11:56" (1/1) ... [2025-03-04 02:11:56,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d463407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:56, skipping insertion in model container [2025-03-04 02:11:56,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:11:56" (1/1) ... [2025-03-04 02:11:56,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:11:56,927 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-lit/qw2004-2b.i[30003,30016] [2025-03-04 02:11:56,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:11:56,950 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:11:56,981 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-lit/qw2004-2b.i[30003,30016] [2025-03-04 02:11:56,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:11:57,007 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:11:57,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57 WrapperNode [2025-03-04 02:11:57,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:11:57,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:11:57,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:11:57,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:11:57,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,032 INFO L138 Inliner]: procedures = 174, calls = 32, calls flagged for inlining = 9, calls inlined = 10, statements flattened = 114 [2025-03-04 02:11:57,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:11:57,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:11:57,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:11:57,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:11:57,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,040 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,048 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:11:57,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:11:57,056 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:11:57,056 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:11:57,056 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:11:57,057 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:11:57,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:11:57,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:11:57,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:11:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2025-03-04 02:11:57,107 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2025-03-04 02:11:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:11:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:11:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:11:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:11:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:11:57,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:11:57,108 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:11:57,202 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:11:57,203 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:11:57,362 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:11:57,362 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:11:57,456 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:11:57,458 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:11:57,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:11:57 BoogieIcfgContainer [2025-03-04 02:11:57,458 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:11:57,460 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:11:57,460 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:11:57,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:11:57,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:11:56" (1/3) ... [2025-03-04 02:11:57,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5821d010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:11:57, skipping insertion in model container [2025-03-04 02:11:57,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (2/3) ... [2025-03-04 02:11:57,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5821d010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:11:57, skipping insertion in model container [2025-03-04 02:11:57,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:11:57" (3/3) ... [2025-03-04 02:11:57,467 INFO L128 eAbstractionObserver]: Analyzing ICFG qw2004-2b.i [2025-03-04 02:11:57,477 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:11:57,478 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG qw2004-2b.i that has 2 procedures, 36 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 02:11:57,478 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:11:57,514 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:11:57,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 40 transitions, 84 flow [2025-03-04 02:11:57,574 INFO L124 PetriNetUnfolderBase]: 5/39 cut-off events. [2025-03-04 02:11:57,575 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:11:57,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 39 events. 5/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-04 02:11:57,579 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 40 transitions, 84 flow [2025-03-04 02:11:57,582 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 39 transitions, 81 flow [2025-03-04 02:11:57,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:11:57,599 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;@46c8eab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:11:57,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 02:11:57,607 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:11:57,607 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2025-03-04 02:11:57,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:11:57,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:57,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:57,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:11:57,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:57,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1792234709, now seen corresponding path program 1 times [2025-03-04 02:11:57,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:57,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958849674] [2025-03-04 02:11:57,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:57,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:57,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:11:57,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:11:57,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:57,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:11:57,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:57,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958849674] [2025-03-04 02:11:57,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958849674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:57,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:57,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:11:57,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095813900] [2025-03-04 02:11:57,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:57,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:11:57,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:57,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:11:57,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:11:57,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2025-03-04 02:11:57,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:57,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:57,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2025-03-04 02:11:57,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:58,098 INFO L124 PetriNetUnfolderBase]: 172/408 cut-off events. [2025-03-04 02:11:58,099 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:11:58,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 741 conditions, 408 events. 172/408 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1909 event pairs, 72 based on Foata normal form. 9/373 useless extension candidates. Maximal degree in co-relation 732. Up to 227 conditions per place. [2025-03-04 02:11:58,106 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 36 selfloop transitions, 7 changer transitions 12/64 dead transitions. [2025-03-04 02:11:58,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 64 transitions, 237 flow [2025-03-04 02:11:58,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:11:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:11:58,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-03-04 02:11:58,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.585 [2025-03-04 02:11:58,118 INFO L175 Difference]: Start difference. First operand has 38 places, 39 transitions, 81 flow. Second operand 5 states and 117 transitions. [2025-03-04 02:11:58,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 64 transitions, 237 flow [2025-03-04 02:11:58,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:11:58,127 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 112 flow [2025-03-04 02:11:58,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2025-03-04 02:11:58,132 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2025-03-04 02:11:58,132 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 112 flow [2025-03-04 02:11:58,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:58,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:58,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:58,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:11:58,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:11:58,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:58,133 INFO L85 PathProgramCache]: Analyzing trace with hash 148384182, now seen corresponding path program 1 times [2025-03-04 02:11:58,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:58,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733759736] [2025-03-04 02:11:58,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:58,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:58,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:11:58,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:11:58,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:58,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:11:58,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:58,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733759736] [2025-03-04 02:11:58,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733759736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:58,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:58,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:11:58,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728670568] [2025-03-04 02:11:58,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:58,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:11:58,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:58,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:11:58,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:11:58,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2025-03-04 02:11:58,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:58,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:58,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2025-03-04 02:11:58,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:58,372 INFO L124 PetriNetUnfolderBase]: 120/312 cut-off events. [2025-03-04 02:11:58,372 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-04 02:11:58,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 312 events. 120/312 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1393 event pairs, 73 based on Foata normal form. 9/300 useless extension candidates. Maximal degree in co-relation 638. Up to 216 conditions per place. [2025-03-04 02:11:58,377 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 24 selfloop transitions, 0 changer transitions 18/52 dead transitions. [2025-03-04 02:11:58,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 228 flow [2025-03-04 02:11:58,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:11:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:11:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-03-04 02:11:58,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-04 02:11:58,381 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 112 flow. Second operand 4 states and 88 transitions. [2025-03-04 02:11:58,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 228 flow [2025-03-04 02:11:58,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:11:58,383 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 104 flow [2025-03-04 02:11:58,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2025-03-04 02:11:58,383 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2025-03-04 02:11:58,384 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 104 flow [2025-03-04 02:11:58,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:58,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:58,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:58,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:11:58,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:11:58,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:58,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1008415012, now seen corresponding path program 1 times [2025-03-04 02:11:58,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:58,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623786810] [2025-03-04 02:11:58,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:58,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:58,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:11:58,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:11:58,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:58,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:11:58,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:58,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623786810] [2025-03-04 02:11:58,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623786810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:58,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:58,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:11:58,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574271725] [2025-03-04 02:11:58,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:58,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:11:58,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:58,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:11:58,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:11:58,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2025-03-04 02:11:58,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:58,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:58,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2025-03-04 02:11:58,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:58,664 INFO L124 PetriNetUnfolderBase]: 107/259 cut-off events. [2025-03-04 02:11:58,664 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-04 02:11:58,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 259 events. 107/259 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 972 event pairs, 37 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 546. Up to 122 conditions per place. [2025-03-04 02:11:58,666 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 28 selfloop transitions, 5 changer transitions 24/66 dead transitions. [2025-03-04 02:11:58,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 296 flow [2025-03-04 02:11:58,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:11:58,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:11:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-03-04 02:11:58,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-04 02:11:58,670 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 104 flow. Second operand 8 states and 144 transitions. [2025-03-04 02:11:58,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 296 flow [2025-03-04 02:11:58,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 287 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 02:11:58,672 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 132 flow [2025-03-04 02:11:58,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=132, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2025-03-04 02:11:58,674 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2025-03-04 02:11:58,674 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 132 flow [2025-03-04 02:11:58,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:58,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:58,674 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] [2025-03-04 02:11:58,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:11:58,675 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:11:58,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:58,676 INFO L85 PathProgramCache]: Analyzing trace with hash -189949834, now seen corresponding path program 1 times [2025-03-04 02:11:58,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:58,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108652447] [2025-03-04 02:11:58,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:58,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:58,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:11:58,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:11:58,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:58,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:58,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:11:58,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:58,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108652447] [2025-03-04 02:11:58,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108652447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:58,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:58,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:11:58,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401919043] [2025-03-04 02:11:58,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:58,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:11:58,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:58,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:11:58,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:11:58,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-03-04 02:11:58,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:58,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:58,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-03-04 02:11:58,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:58,832 INFO L124 PetriNetUnfolderBase]: 95/265 cut-off events. [2025-03-04 02:11:58,832 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-04 02:11:58,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 265 events. 95/265 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1125 event pairs, 32 based on Foata normal form. 11/262 useless extension candidates. Maximal degree in co-relation 615. Up to 102 conditions per place. [2025-03-04 02:11:58,835 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 26 selfloop transitions, 2 changer transitions 18/55 dead transitions. [2025-03-04 02:11:58,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 292 flow [2025-03-04 02:11:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:11:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:11:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-03-04 02:11:58,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-03-04 02:11:58,837 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 132 flow. Second operand 4 states and 92 transitions. [2025-03-04 02:11:58,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 292 flow [2025-03-04 02:11:58,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 280 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 02:11:58,841 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 112 flow [2025-03-04 02:11:58,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2025-03-04 02:11:58,842 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-03-04 02:11:58,843 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 112 flow [2025-03-04 02:11:58,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:58,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:58,843 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] [2025-03-04 02:11:58,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:11:58,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:11:58,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:58,844 INFO L85 PathProgramCache]: Analyzing trace with hash 897165945, now seen corresponding path program 1 times [2025-03-04 02:11:58,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:58,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629035835] [2025-03-04 02:11:58,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:58,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:58,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:11:58,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:11:58,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:58,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:11:58,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:58,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629035835] [2025-03-04 02:11:58,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629035835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:58,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:58,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:11:58,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337293593] [2025-03-04 02:11:58,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:58,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:11:58,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:58,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:11:58,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:11:58,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2025-03-04 02:11:58,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 31 transitions, 112 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:58,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:58,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2025-03-04 02:11:58,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:59,173 INFO L124 PetriNetUnfolderBase]: 117/316 cut-off events. [2025-03-04 02:11:59,174 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-03-04 02:11:59,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 316 events. 117/316 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1398 event pairs, 39 based on Foata normal form. 3/318 useless extension candidates. Maximal degree in co-relation 725. Up to 156 conditions per place. [2025-03-04 02:11:59,175 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 52 selfloop transitions, 6 changer transitions 18/83 dead transitions. [2025-03-04 02:11:59,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 83 transitions, 423 flow [2025-03-04 02:11:59,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:11:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:11:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2025-03-04 02:11:59,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2025-03-04 02:11:59,177 INFO L175 Difference]: Start difference. First operand has 49 places, 31 transitions, 112 flow. Second operand 11 states and 195 transitions. [2025-03-04 02:11:59,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 83 transitions, 423 flow [2025-03-04 02:11:59,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 389 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-03-04 02:11:59,179 INFO L231 Difference]: Finished difference. Result has 56 places, 34 transitions, 148 flow [2025-03-04 02:11:59,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=148, PETRI_PLACES=56, PETRI_TRANSITIONS=34} [2025-03-04 02:11:59,179 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2025-03-04 02:11:59,180 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 34 transitions, 148 flow [2025-03-04 02:11:59,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:59,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:59,180 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] [2025-03-04 02:11:59,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:11:59,180 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:11:59,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash 935776129, now seen corresponding path program 2 times [2025-03-04 02:11:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:59,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380012279] [2025-03-04 02:11:59,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:11:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:59,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:11:59,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:11:59,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:11:59,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:11:59,194 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:11:59,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:11:59,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:11:59,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:59,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:11:59,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:11:59,221 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:11:59,221 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-04 02:11:59,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-03-04 02:11:59,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:11:59,223 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-03-04 02:11:59,258 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:11:59,258 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:11:59,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:11:59 BasicIcfg [2025-03-04 02:11:59,262 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:11:59,263 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:11:59,263 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:11:59,263 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:11:59,263 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:11:57" (3/4) ... [2025-03-04 02:11:59,264 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 02:11:59,305 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 16. [2025-03-04 02:11:59,348 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:11:59,348 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:11:59,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:11:59,348 INFO L158 Benchmark]: Toolchain (without parser) took 2689.43ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 94.2MB in the end (delta: 34.8MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2025-03-04 02:11:59,349 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:11:59,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.06ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 109.2MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:11:59,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.88ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 107.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:11:59,349 INFO L158 Benchmark]: Boogie Preprocessor took 22.67ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 106.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:11:59,349 INFO L158 Benchmark]: IcfgBuilder took 402.25ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 83.2MB in the end (delta: 22.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:11:59,349 INFO L158 Benchmark]: TraceAbstraction took 1801.79ms. Allocated memory is still 167.8MB. Free memory was 82.8MB in the beginning and 102.6MB in the end (delta: -19.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:11:59,349 INFO L158 Benchmark]: Witness Printer took 85.16ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 94.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:11:59,352 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.29ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.06ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 109.2MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.88ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 107.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.67ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 106.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 402.25ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 83.2MB in the end (delta: 22.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1801.79ms. Allocated memory is still 167.8MB. Free memory was 82.8MB in the beginning and 102.6MB in the end (delta: -19.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 85.16ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 94.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 690]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L697] 0 volatile int stoppingFlag; [L698] 0 volatile int pendingIo; [L699] 0 volatile int stoppingEvent; [L700] 0 volatile int stopped; [L756] 0 pthread_t t; [L757] 0 pendingIo = 1 [L758] 0 stoppingFlag = 0 [L759] 0 stoppingEvent = 0 [L760] 0 stopped = 0 [L761] FCALL, FORK 0 pthread_create(&t, 0, BCSP_PnpStop, 0) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t=-1] [L762] CALL 0 BCSP_PnpAdd(0) [L734] 0 int status; [L735] CALL, EXPR 0 BCSP_IoIncrement() [L703] 0 int lsf = stoppingFlag; VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L705] COND FALSE 0 !(\read(lsf)) VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L745] 1 stoppingFlag = 1 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L747] CALL 1 BCSP_IoDecrement() [L725] 1 int pending; [L726] CALL, EXPR 1 dec() [L709] 0 int lp = pendingIo; VAL [lp=1, lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L719] 1 pendingIo-- [L720] 1 int tmp = pendingIo; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1, tmp=0] [L722] 1 return tmp; [L726] RET, EXPR 1 dec() [L726] 1 pending = dec() [L727] COND TRUE 1 pending == 0 VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1] [L729] 1 stoppingEvent = 1 VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L747] RET 1 BCSP_IoDecrement() [L749] 1 int lse = stoppingEvent; VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L751] CALL 1 assume_abort_if_not(lse) [L686] COND FALSE 1 !(!cond) [L751] RET 1 assume_abort_if_not(lse) [L752] 1 stopped = 1 VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L712] 0 pendingIo = lp + 1 VAL [lp=1, lsf=0, pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1] [L715] 0 return 0; VAL [\result=0, lsf=0, pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1] [L735] RET, EXPR 0 BCSP_IoIncrement() [L735] 0 status = BCSP_IoIncrement() [L736] COND TRUE 0 status == 0 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=2, status=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L737] 0 int local_assertion = !stopped; VAL [\old(arg)={0:0}, arg={0:0}, local_assertion=0, pendingIo=2, status=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L738] CALL 0 __VERIFIER_assert(local_assertion) [L689] COND TRUE 0 !(cond) VAL [\old(cond)=0, cond=0, pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1] [L690] 0 reach_error() VAL [\old(cond)=0, cond=0, pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1] - UnprovableResult [Line: 761]: 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 3 procedures, 50 locations, 2 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: 1.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 144 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 615 IncrementalHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 13 mSDtfsCounter, 615 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=5, InterpolantAutomatonStates: 32, 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.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 186 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-04 02:11:59,365 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