/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:12:45,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:12:45,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:12:45,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:12:45,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:12:45,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:12:45,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:12:45,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:12:45,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:12:45,498 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:12:45,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:12:45,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:12:45,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:12:45,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:12:45,500 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:12:45,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:12:45,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:12:45,500 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:12:45,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:12:45,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:12:45,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:12:45,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:12:45,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:12:45,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:12:45,501 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:12:45,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:12:45,501 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:12:45,501 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:12:45,501 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:12:45,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:12:45,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:12:45,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:12:45,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:12:45,501 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:12:45,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:12:45,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:12:45,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:12:45,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:12:45,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:12:45,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:12:45,502 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:12:45,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:12:45,502 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:12:45,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:12:45,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:12:45,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:12:45,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:12:45,502 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:12:45,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:12:45,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:12:45,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:12:45,721 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:12:45,722 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:12:45,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2025-04-14 00:12:47,020 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6923cfa28/12b4bceabd7e4f288658881df6661e89/FLAG1928fefa5 [2025-04-14 00:12:47,278 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:12:47,279 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2025-04-14 00:12:47,296 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6923cfa28/12b4bceabd7e4f288658881df6661e89/FLAG1928fefa5 [2025-04-14 00:12:48,072 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6923cfa28/12b4bceabd7e4f288658881df6661e89 [2025-04-14 00:12:48,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:12:48,087 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:12:48,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:12:48,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:12:48,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:12:48,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:12:48" (1/1) ... [2025-04-14 00:12:48,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df56093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:12:48, skipping insertion in model container [2025-04-14 00:12:48,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:12:48" (1/1) ... [2025-04-14 00:12:48,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:12:48,342 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] [2025-04-14 00:12:48,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:12:48,558 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:12:48,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] [2025-04-14 00:12:48,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:12:48,677 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:12:48,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:12:48 WrapperNode [2025-04-14 00:12:48,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:12:48,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:12:48,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:12:48,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:12:48,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:12:48" (1/1) ... [2025-04-14 00:12:48,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:12:48" (1/1) ... [2025-04-14 00:12:48,727 INFO L138 Inliner]: procedures = 364, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 111 [2025-04-14 00:12:48,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:12:48,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:12:48,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:12:48,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:12:48,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:12:48" (1/1) ... [2025-04-14 00:12:48,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:12:48" (1/1) ... [2025-04-14 00:12:48,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:12:48" (1/1) ... [2025-04-14 00:12:48,753 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-04-14 00:12:48,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:12:48" (1/1) ... [2025-04-14 00:12:48,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:12:48" (1/1) ... [2025-04-14 00:12:48,760 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:12:48" (1/1) ... [2025-04-14 00:12:48,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:12:48" (1/1) ... [2025-04-14 00:12:48,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:12:48" (1/1) ... [2025-04-14 00:12:48,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:12:48" (1/1) ... [2025-04-14 00:12:48,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:12:48,767 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:12:48,767 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:12:48,767 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:12:48,767 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:12:48" (1/1) ... [2025-04-14 00:12:48,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:12:48,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:12:48,793 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-04-14 00:12:48,795 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-04-14 00:12:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:12:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:12:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2025-04-14 00:12:48,810 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2025-04-14 00:12:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:12:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:12:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:12:48,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:12:48,812 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:12:48,906 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:12:48,907 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:12:49,066 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:12:49,067 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:12:49,067 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:12:49,390 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:12:49,396 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:12:49,398 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:12:49,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:12:49 BoogieIcfgContainer [2025-04-14 00:12:49,400 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:12:49,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:12:49,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:12:49,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:12:49,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:12:48" (1/3) ... [2025-04-14 00:12:49,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4fe13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:12:49, skipping insertion in model container [2025-04-14 00:12:49,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:12:48" (2/3) ... [2025-04-14 00:12:49,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4fe13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:12:49, skipping insertion in model container [2025-04-14 00:12:49,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:12:49" (3/3) ... [2025-04-14 00:12:49,406 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2025-04-14 00:12:49,417 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:12:49,418 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-3.i that has 2 procedures, 15 locations, 17 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 00:12:49,419 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:12:49,450 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-14 00:12:49,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 18 transitions, 43 flow [2025-04-14 00:12:49,496 INFO L116 PetriNetUnfolderBase]: 4/17 cut-off events. [2025-04-14 00:12:49,498 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 00:12:49,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 17 events. 4/17 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2025-04-14 00:12:49,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 18 places, 18 transitions, 43 flow [2025-04-14 00:12:49,505 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 16 places, 16 transitions, 38 flow [2025-04-14 00:12:49,513 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:12:49,521 INFO L340 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;@430aa72b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:12:49,522 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 00:12:49,528 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:12:49,529 INFO L116 PetriNetUnfolderBase]: 2/12 cut-off events. [2025-04-14 00:12:49,529 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 00:12:49,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:12:49,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 00:12:49,529 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:12:49,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:12:49,533 INFO L85 PathProgramCache]: Analyzing trace with hash 338314584, now seen corresponding path program 1 times [2025-04-14 00:12:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:12:49,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301570095] [2025-04-14 00:12:49,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:12:49,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:12:49,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:12:49,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:12:49,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:12:49,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:12:49,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:12:49,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301570095] [2025-04-14 00:12:49,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301570095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:12:49,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:12:49,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:12:49,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779659717] [2025-04-14 00:12:49,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:12:49,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 00:12:49,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:12:49,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 00:12:49,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 00:12:49,834 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2025-04-14 00:12:49,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 16 transitions, 38 flow. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-04-14 00:12:49,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:12:49,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2025-04-14 00:12:49,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:12:49,880 INFO L116 PetriNetUnfolderBase]: 25/52 cut-off events. [2025-04-14 00:12:49,881 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 00:12:49,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 52 events. 25/52 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 83 event pairs, 15 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 96. Up to 53 conditions per place. [2025-04-14 00:12:49,882 INFO L140 encePairwiseOnDemand]: 16/18 looper letters, 14 selfloop transitions, 0 changer transitions 0/14 dead transitions. [2025-04-14 00:12:49,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 14 transitions, 62 flow [2025-04-14 00:12:49,884 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 00:12:49,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 00:12:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 18 transitions. [2025-04-14 00:12:49,894 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 00:12:49,895 INFO L175 Difference]: Start difference. First operand has 16 places, 16 transitions, 38 flow. Second operand 2 states and 18 transitions. [2025-04-14 00:12:49,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 14 transitions, 62 flow [2025-04-14 00:12:49,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 14 transitions, 58 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:12:49,899 INFO L231 Difference]: Finished difference. Result has 15 places, 14 transitions, 30 flow [2025-04-14 00:12:49,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=30, PETRI_PLACES=15, PETRI_TRANSITIONS=14} [2025-04-14 00:12:49,906 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, -1 predicate places. [2025-04-14 00:12:49,906 INFO L485 AbstractCegarLoop]: Abstraction has has 15 places, 14 transitions, 30 flow [2025-04-14 00:12:49,906 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-04-14 00:12:49,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:12:49,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:12:49,907 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:12:49,907 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:12:49,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:12:49,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1574642882, now seen corresponding path program 1 times [2025-04-14 00:12:49,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:12:49,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716946393] [2025-04-14 00:12:49,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:12:49,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:12:49,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:12:49,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:12:49,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:12:49,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:12:50,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:12:50,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716946393] [2025-04-14 00:12:50,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716946393] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:12:50,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:12:50,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:12:50,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008262299] [2025-04-14 00:12:50,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:12:50,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:12:50,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:12:50,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:12:50,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:12:50,058 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2025-04-14 00:12:50,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 14 transitions, 30 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-04-14 00:12:50,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:12:50,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2025-04-14 00:12:50,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:12:50,125 INFO L116 PetriNetUnfolderBase]: 37/76 cut-off events. [2025-04-14 00:12:50,125 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:12:50,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 76 events. 37/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 172 event pairs, 15 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 153. Up to 53 conditions per place. [2025-04-14 00:12:50,126 INFO L140 encePairwiseOnDemand]: 15/18 looper letters, 20 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2025-04-14 00:12:50,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 22 transitions, 90 flow [2025-04-14 00:12:50,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:12:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:12:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2025-04-14 00:12:50,128 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-04-14 00:12:50,128 INFO L175 Difference]: Start difference. First operand has 15 places, 14 transitions, 30 flow. Second operand 3 states and 26 transitions. [2025-04-14 00:12:50,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 22 transitions, 90 flow [2025-04-14 00:12:50,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 22 transitions, 90 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:12:50,129 INFO L231 Difference]: Finished difference. Result has 18 places, 15 transitions, 42 flow [2025-04-14 00:12:50,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=18, PETRI_TRANSITIONS=15} [2025-04-14 00:12:50,130 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, 2 predicate places. [2025-04-14 00:12:50,130 INFO L485 AbstractCegarLoop]: Abstraction has has 18 places, 15 transitions, 42 flow [2025-04-14 00:12:50,130 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-04-14 00:12:50,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:12:50,131 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:12:50,131 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:12:50,131 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:12:50,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:12:50,132 INFO L85 PathProgramCache]: Analyzing trace with hash -918913760, now seen corresponding path program 1 times [2025-04-14 00:12:50,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:12:50,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297943564] [2025-04-14 00:12:50,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:12:50,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:12:50,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:12:50,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:12:50,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:12:50,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:12:50,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:12:50,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297943564] [2025-04-14 00:12:50,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297943564] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:12:50,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:12:50,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:12:50,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166756659] [2025-04-14 00:12:50,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:12:50,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:12:50,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:12:50,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:12:50,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:12:50,260 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2025-04-14 00:12:50,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 15 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-04-14 00:12:50,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:12:50,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2025-04-14 00:12:50,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:12:50,323 INFO L116 PetriNetUnfolderBase]: 61/124 cut-off events. [2025-04-14 00:12:50,323 INFO L117 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-04-14 00:12:50,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 124 events. 61/124 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 314 event pairs, 25 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 299. Up to 77 conditions per place. [2025-04-14 00:12:50,324 INFO L140 encePairwiseOnDemand]: 15/18 looper letters, 22 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2025-04-14 00:12:50,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 24 transitions, 118 flow [2025-04-14 00:12:50,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:12:50,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:12:50,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2025-04-14 00:12:50,326 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-04-14 00:12:50,326 INFO L175 Difference]: Start difference. First operand has 18 places, 15 transitions, 42 flow. Second operand 3 states and 26 transitions. [2025-04-14 00:12:50,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 24 transitions, 118 flow [2025-04-14 00:12:50,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 24 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:12:50,327 INFO L231 Difference]: Finished difference. Result has 20 places, 16 transitions, 52 flow [2025-04-14 00:12:50,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=20, PETRI_TRANSITIONS=16} [2025-04-14 00:12:50,327 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, 4 predicate places. [2025-04-14 00:12:50,327 INFO L485 AbstractCegarLoop]: Abstraction has has 20 places, 16 transitions, 52 flow [2025-04-14 00:12:50,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-04-14 00:12:50,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:12:50,327 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:12:50,328 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:12:50,328 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:12:50,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:12:50,328 INFO L85 PathProgramCache]: Analyzing trace with hash -686408822, now seen corresponding path program 1 times [2025-04-14 00:12:50,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:12:50,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658104805] [2025-04-14 00:12:50,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:12:50,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:12:50,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:12:50,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:12:50,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:12:50,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:50,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:12:50,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:12:50,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658104805] [2025-04-14 00:12:50,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658104805] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:12:50,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725438425] [2025-04-14 00:12:50,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:12:50,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:12:50,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:12:50,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:12:50,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 00:12:50,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:12:50,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:12:50,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:12:50,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:50,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-14 00:12:50,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:12:50,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:12:50,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:12:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:12:50,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725438425] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:12:50,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:12:50,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-04-14 00:12:50,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532785150] [2025-04-14 00:12:50,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:12:50,648 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:12:50,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:12:50,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:12:50,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:12:50,649 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2025-04-14 00:12:50,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 52 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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-04-14 00:12:50,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:12:50,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2025-04-14 00:12:50,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:12:50,852 INFO L116 PetriNetUnfolderBase]: 169/340 cut-off events. [2025-04-14 00:12:50,852 INFO L117 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2025-04-14 00:12:50,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 340 events. 169/340 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1170 event pairs, 15 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 851. Up to 85 conditions per place. [2025-04-14 00:12:50,857 INFO L140 encePairwiseOnDemand]: 12/18 looper letters, 80 selfloop transitions, 30 changer transitions 0/110 dead transitions. [2025-04-14 00:12:50,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 110 transitions, 544 flow [2025-04-14 00:12:50,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:12:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:12:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 140 transitions. [2025-04-14 00:12:50,860 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2025-04-14 00:12:50,860 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 52 flow. Second operand 16 states and 140 transitions. [2025-04-14 00:12:50,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 110 transitions, 544 flow [2025-04-14 00:12:50,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 110 transitions, 534 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:12:50,863 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 310 flow [2025-04-14 00:12:50,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=310, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2025-04-14 00:12:50,865 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, 29 predicate places. [2025-04-14 00:12:50,865 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 310 flow [2025-04-14 00:12:50,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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-04-14 00:12:50,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:12:50,866 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:12:50,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 00:12:51,066 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:12:51,067 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:12:51,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:12:51,068 INFO L85 PathProgramCache]: Analyzing trace with hash 874836278, now seen corresponding path program 2 times [2025-04-14 00:12:51,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:12:51,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658274356] [2025-04-14 00:12:51,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:12:51,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:12:51,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:12:51,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:12:51,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:12:51,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:12:51,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:12:51,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658274356] [2025-04-14 00:12:51,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658274356] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:12:51,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782688578] [2025-04-14 00:12:51,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:12:51,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:12:51,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:12:51,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:12:51,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 00:12:51,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:12:51,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:12:51,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:12:51,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:51,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 00:12:51,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:12:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:12:51,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:12:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:12:51,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782688578] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:12:51,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:12:51,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-14 00:12:51,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936665715] [2025-04-14 00:12:51,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:12:51,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 00:12:51,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:12:51,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 00:12:51,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-14 00:12:51,538 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2025-04-14 00:12:51,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 310 flow. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 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-04-14 00:12:51,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:12:51,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2025-04-14 00:12:51,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:12:51,736 INFO L116 PetriNetUnfolderBase]: 337/676 cut-off events. [2025-04-14 00:12:51,736 INFO L117 PetriNetUnfolderBase]: For 5472/5472 co-relation queries the response was YES. [2025-04-14 00:12:51,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2364 conditions, 676 events. 337/676 cut-off events. For 5472/5472 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2419 event pairs, 41 based on Foata normal form. 84/736 useless extension candidates. Maximal degree in co-relation 2347. Up to 169 conditions per place. [2025-04-14 00:12:51,742 INFO L140 encePairwiseOnDemand]: 15/18 looper letters, 107 selfloop transitions, 33 changer transitions 0/140 dead transitions. [2025-04-14 00:12:51,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 140 transitions, 1178 flow [2025-04-14 00:12:51,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 00:12:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 00:12:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2025-04-14 00:12:51,743 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-04-14 00:12:51,743 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 310 flow. Second operand 12 states and 112 transitions. [2025-04-14 00:12:51,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 140 transitions, 1178 flow [2025-04-14 00:12:51,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 140 transitions, 1110 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-04-14 00:12:51,757 INFO L231 Difference]: Finished difference. Result has 60 places, 62 transitions, 494 flow [2025-04-14 00:12:51,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=494, PETRI_PLACES=60, PETRI_TRANSITIONS=62} [2025-04-14 00:12:51,758 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, 44 predicate places. [2025-04-14 00:12:51,758 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 494 flow [2025-04-14 00:12:51,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 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-04-14 00:12:51,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:12:51,758 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 10, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:12:51,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 00:12:51,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:12:51,963 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:12:51,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:12:51,964 INFO L85 PathProgramCache]: Analyzing trace with hash -970388528, now seen corresponding path program 3 times [2025-04-14 00:12:51,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:12:51,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738978584] [2025-04-14 00:12:51,964 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:12:51,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:12:51,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 11 equivalence classes. [2025-04-14 00:12:51,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 40 statements. [2025-04-14 00:12:51,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:12:51,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-04-14 00:12:52,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:12:52,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738978584] [2025-04-14 00:12:52,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738978584] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:12:52,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045140534] [2025-04-14 00:12:52,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:12:52,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:12:52,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:12:52,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:12:52,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 00:12:52,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 11 equivalence classes. [2025-04-14 00:12:52,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 40 statements. [2025-04-14 00:12:52,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 00:12:52,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:52,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 00:12:52,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:12:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-04-14 00:12:52,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:12:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-04-14 00:12:52,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045140534] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:12:52,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:12:52,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-14 00:12:52,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162455833] [2025-04-14 00:12:52,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:12:52,300 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:12:52,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:12:52,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:12:52,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:12:52,301 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2025-04-14 00:12:52,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 494 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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-04-14 00:12:52,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:12:52,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2025-04-14 00:12:52,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:12:52,544 INFO L116 PetriNetUnfolderBase]: 721/1444 cut-off events. [2025-04-14 00:12:52,544 INFO L117 PetriNetUnfolderBase]: For 8326/8326 co-relation queries the response was YES. [2025-04-14 00:12:52,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5627 conditions, 1444 events. 721/1444 cut-off events. For 8326/8326 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6250 event pairs, 131 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 5603. Up to 360 conditions per place. [2025-04-14 00:12:52,555 INFO L140 encePairwiseOnDemand]: 15/18 looper letters, 125 selfloop transitions, 19 changer transitions 0/144 dead transitions. [2025-04-14 00:12:52,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 144 transitions, 1514 flow [2025-04-14 00:12:52,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:12:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:12:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2025-04-14 00:12:52,556 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2025-04-14 00:12:52,556 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 494 flow. Second operand 8 states and 74 transitions. [2025-04-14 00:12:52,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 144 transitions, 1514 flow [2025-04-14 00:12:52,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 144 transitions, 1374 flow, removed 42 selfloop flow, removed 4 redundant places. [2025-04-14 00:12:52,567 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 550 flow [2025-04-14 00:12:52,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=550, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2025-04-14 00:12:52,568 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, 51 predicate places. [2025-04-14 00:12:52,568 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 550 flow [2025-04-14 00:12:52,568 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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-04-14 00:12:52,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:12:52,568 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 10, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:12:52,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 00:12:52,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:12:52,769 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:12:52,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:12:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash 709839112, now seen corresponding path program 4 times [2025-04-14 00:12:52,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:12:52,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558183256] [2025-04-14 00:12:52,770 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:12:52,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:12:52,791 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-14 00:12:52,808 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-14 00:12:52,809 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:12:52,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:12:53,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:12:53,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558183256] [2025-04-14 00:12:53,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558183256] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:12:53,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841418146] [2025-04-14 00:12:53,429 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:12:53,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:12:53,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:12:53,431 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:12:53,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 00:12:53,530 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-14 00:12:53,554 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-14 00:12:53,556 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:12:53,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:53,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:12:53,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:12:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-14 00:12:53,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:12:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-14 00:12:53,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841418146] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:12:53,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:12:53,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 9, 9] total 44 [2025-04-14 00:12:53,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063496991] [2025-04-14 00:12:53,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:12:53,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-14 00:12:53,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:12:53,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-14 00:12:53,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=1509, Unknown=0, NotChecked=0, Total=1892 [2025-04-14 00:12:53,936 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2025-04-14 00:12:53,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 550 flow. Second operand has 44 states, 44 states have (on average 3.8636363636363638) internal successors, (170), 44 states have internal predecessors, (170), 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-04-14 00:12:53,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:12:53,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2025-04-14 00:12:53,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:30,261 INFO L116 PetriNetUnfolderBase]: 16650/33302 cut-off events. [2025-04-14 00:13:30,261 INFO L117 PetriNetUnfolderBase]: For 335752/335752 co-relation queries the response was YES. [2025-04-14 00:13:30,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140875 conditions, 33302 events. 16650/33302 cut-off events. For 335752/335752 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 294355 event pairs, 23 based on Foata normal form. 340/33642 useless extension candidates. Maximal degree in co-relation 140846. Up to 7959 conditions per place. [2025-04-14 00:13:30,567 INFO L140 encePairwiseOnDemand]: 10/18 looper letters, 4168 selfloop transitions, 2565 changer transitions 0/6733 dead transitions. [2025-04-14 00:13:30,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 794 places, 6733 transitions, 71951 flow [2025-04-14 00:13:30,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 728 states. [2025-04-14 00:13:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2025-04-14 00:13:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 4854 transitions. [2025-04-14 00:13:30,591 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37042124542124544 [2025-04-14 00:13:30,591 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 550 flow. Second operand 728 states and 4854 transitions. [2025-04-14 00:13:30,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 794 places, 6733 transitions, 71951 flow [2025-04-14 00:13:31,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 792 places, 6733 transitions, 70484 flow, removed 522 selfloop flow, removed 2 redundant places. [2025-04-14 00:13:31,407 INFO L231 Difference]: Finished difference. Result has 807 places, 2784 transitions, 14711 flow [2025-04-14 00:13:31,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=728, PETRI_FLOW=14711, PETRI_PLACES=807, PETRI_TRANSITIONS=2784} [2025-04-14 00:13:31,408 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, 791 predicate places. [2025-04-14 00:13:31,408 INFO L485 AbstractCegarLoop]: Abstraction has has 807 places, 2784 transitions, 14711 flow [2025-04-14 00:13:31,408 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.8636363636363638) internal successors, (170), 44 states have internal predecessors, (170), 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-04-14 00:13:31,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:31,408 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 14, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:31,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 00:13:31,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:13:31,609 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:13:31,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1131454082, now seen corresponding path program 5 times [2025-04-14 00:13:31,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:31,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635297696] [2025-04-14 00:13:31,611 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:13:31,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:31,635 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 88 statements into 9 equivalence classes. [2025-04-14 00:13:31,655 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 88 of 88 statements. [2025-04-14 00:13:31,655 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-04-14 00:13:31,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-04-14 00:13:31,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:31,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635297696] [2025-04-14 00:13:31,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635297696] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:13:31,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854732330] [2025-04-14 00:13:31,856 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:13:31,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:13:31,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:13:31,859 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:13:31,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 00:13:32,031 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 88 statements into 9 equivalence classes. [2025-04-14 00:13:32,062 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 88 of 88 statements. [2025-04-14 00:13:32,062 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-04-14 00:13:32,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:32,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 00:13:32,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:13:32,143 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-04-14 00:13:32,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:13:32,334 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-04-14 00:13:32,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854732330] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:13:32,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:13:32,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2025-04-14 00:13:32,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232107559] [2025-04-14 00:13:32,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:13:32,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 00:13:32,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:32,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 00:13:32,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2025-04-14 00:13:32,336 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2025-04-14 00:13:32,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 807 places, 2784 transitions, 14711 flow. Second operand has 21 states, 21 states have (on average 5.0476190476190474) internal successors, (106), 21 states have internal predecessors, (106), 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-04-14 00:13:32,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:32,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2025-04-14 00:13:32,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:47,368 INFO L116 PetriNetUnfolderBase]: 42241/84484 cut-off events. [2025-04-14 00:13:47,369 INFO L117 PetriNetUnfolderBase]: For 2022205/2022205 co-relation queries the response was YES. [2025-04-14 00:13:48,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361144 conditions, 84484 events. 42241/84484 cut-off events. For 2022205/2022205 co-relation queries the response was YES. Maximal size of possible extension queue 1592. Compared 845022 event pairs, 546 based on Foata normal form. 13307/97791 useless extension candidates. Maximal degree in co-relation 361099. Up to 21120 conditions per place. [2025-04-14 00:13:48,404 INFO L140 encePairwiseOnDemand]: 15/18 looper letters, 29285 selfloop transitions, 60 changer transitions 0/29345 dead transitions. [2025-04-14 00:13:48,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 827 places, 29345 transitions, 216769 flow [2025-04-14 00:13:48,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 00:13:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 00:13:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 196 transitions. [2025-04-14 00:13:48,406 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-04-14 00:13:48,406 INFO L175 Difference]: Start difference. First operand has 807 places, 2784 transitions, 14711 flow. Second operand 21 states and 196 transitions. [2025-04-14 00:13:48,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 827 places, 29345 transitions, 216769 flow [2025-04-14 00:13:54,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 822 places, 29345 transitions, 208585 flow, removed 1208 selfloop flow, removed 5 redundant places. [2025-04-14 00:13:55,030 INFO L231 Difference]: Finished difference. Result has 831 places, 2811 transitions, 14510 flow [2025-04-14 00:13:55,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=14096, PETRI_DIFFERENCE_MINUEND_PLACES=802, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2784, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2748, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=14510, PETRI_PLACES=831, PETRI_TRANSITIONS=2811} [2025-04-14 00:13:55,034 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, 815 predicate places. [2025-04-14 00:13:55,034 INFO L485 AbstractCegarLoop]: Abstraction has has 831 places, 2811 transitions, 14510 flow [2025-04-14 00:13:55,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.0476190476190474) internal successors, (106), 21 states have internal predecessors, (106), 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-04-14 00:13:55,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:55,034 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 19, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:55,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 00:13:55,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:13:55,235 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:13:55,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:55,236 INFO L85 PathProgramCache]: Analyzing trace with hash 201173666, now seen corresponding path program 6 times [2025-04-14 00:13:55,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:55,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783505329] [2025-04-14 00:13:55,236 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:13:55,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:55,255 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 106 statements into 16 equivalence classes. [2025-04-14 00:13:55,293 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) and asserted 106 of 106 statements. [2025-04-14 00:13:55,293 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2025-04-14 00:13:55,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-04-14 00:13:55,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:55,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783505329] [2025-04-14 00:13:55,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783505329] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:13:55,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491109585] [2025-04-14 00:13:55,558 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:13:55,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:13:55,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:13:55,560 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:13:55,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 00:13:55,671 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 106 statements into 16 equivalence classes. [2025-04-14 00:13:55,717 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) and asserted 106 of 106 statements. [2025-04-14 00:13:55,717 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2025-04-14 00:13:55,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:55,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 00:13:55,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:13:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-04-14 00:13:55,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:13:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-04-14 00:13:56,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491109585] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:13:56,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:13:56,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 22 [2025-04-14 00:13:56,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610957037] [2025-04-14 00:13:56,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:13:56,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 00:13:56,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:56,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 00:13:56,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-04-14 00:13:56,004 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2025-04-14 00:13:56,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 831 places, 2811 transitions, 14510 flow. Second operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 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-04-14 00:13:56,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:56,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2025-04-14 00:13:56,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:14:15,203 INFO L116 PetriNetUnfolderBase]: 43081/86164 cut-off events. [2025-04-14 00:14:15,204 INFO L117 PetriNetUnfolderBase]: For 871138/871138 co-relation queries the response was YES. [2025-04-14 00:14:16,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409363 conditions, 86164 events. 43081/86164 cut-off events. For 871138/871138 co-relation queries the response was YES. Maximal size of possible extension queue 1580. Compared 846182 event pairs, 2071 based on Foata normal form. 210/86374 useless extension candidates. Maximal degree in co-relation 409309. Up to 21540 conditions per place. [2025-04-14 00:14:16,481 INFO L140 encePairwiseOnDemand]: 15/18 looper letters, 2734 selfloop transitions, 478 changer transitions 0/3212 dead transitions. [2025-04-14 00:14:16,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 851 places, 3212 transitions, 25788 flow [2025-04-14 00:14:16,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 00:14:16,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 00:14:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 192 transitions. [2025-04-14 00:14:16,482 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2025-04-14 00:14:16,482 INFO L175 Difference]: Start difference. First operand has 831 places, 2811 transitions, 14510 flow. Second operand 21 states and 192 transitions. [2025-04-14 00:14:16,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 851 places, 3212 transitions, 25788 flow [2025-04-14 00:14:24,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 840 places, 3212 transitions, 24588 flow, removed 380 selfloop flow, removed 11 redundant places. [2025-04-14 00:14:24,258 INFO L231 Difference]: Finished difference. Result has 845 places, 2816 transitions, 15388 flow [2025-04-14 00:14:24,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=14330, PETRI_DIFFERENCE_MINUEND_PLACES=820, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2811, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=474, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=15388, PETRI_PLACES=845, PETRI_TRANSITIONS=2816} [2025-04-14 00:14:24,261 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, 829 predicate places. [2025-04-14 00:14:24,261 INFO L485 AbstractCegarLoop]: Abstraction has has 845 places, 2816 transitions, 15388 flow [2025-04-14 00:14:24,262 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 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-04-14 00:14:24,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:14:24,262 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:14:24,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 00:14:24,462 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:14:24,462 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:14:24,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:14:24,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1608793994, now seen corresponding path program 7 times [2025-04-14 00:14:24,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:14:24,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776215764] [2025-04-14 00:14:24,464 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:14:24,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:14:24,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-04-14 00:14:24,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-04-14 00:14:24,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:24,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:14:24,508 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:14:24,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-04-14 00:14:24,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-04-14 00:14:24,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:24,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:14:24,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:14:24,574 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:14:24,575 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-04-14 00:14:24,578 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-14 00:14:24,579 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:14:24,579 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2025-04-14 00:14:24,812 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:14:24,812 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:14:24,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:14:24 BasicIcfg [2025-04-14 00:14:24,817 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:14:24,817 INFO L158 Benchmark]: Toolchain (without parser) took 96730.06ms. Allocated memory was 142.6MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 98.0MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2025-04-14 00:14:24,817 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:14:24,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.43ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 57.6MB in the end (delta: 40.4MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-14 00:14:24,818 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.78ms. Allocated memory is still 142.6MB. Free memory was 57.6MB in the beginning and 54.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:14:24,818 INFO L158 Benchmark]: Boogie Preprocessor took 36.80ms. Allocated memory is still 142.6MB. Free memory was 54.7MB in the beginning and 52.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:14:24,818 INFO L158 Benchmark]: IcfgBuilder took 633.47ms. Allocated memory is still 142.6MB. Free memory was 52.8MB in the beginning and 59.4MB in the end (delta: -6.6MB). Peak memory consumption was 36.5MB. Max. memory is 8.0GB. [2025-04-14 00:14:24,818 INFO L158 Benchmark]: TraceAbstraction took 95415.32ms. Allocated memory was 142.6MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 58.7MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2025-04-14 00:14:24,819 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.18ms. Allocated memory is still 155.2MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 589.43ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 57.6MB in the end (delta: 40.4MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.78ms. Allocated memory is still 142.6MB. Free memory was 57.6MB in the beginning and 54.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.80ms. Allocated memory is still 142.6MB. Free memory was 54.7MB in the beginning and 52.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 633.47ms. Allocated memory is still 142.6MB. Free memory was 52.8MB in the beginning and 59.4MB in the end (delta: -6.6MB). Peak memory consumption was 36.5MB. Max. memory is 8.0GB. * TraceAbstraction took 95415.32ms. Allocated memory was 142.6MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 58.7MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\at(arg, Pre)={0:0}, myglobal=0, mythread=-1] [L1324] 1 int i,j; [L1325] 1 i=0 [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, myglobal=0] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, j=0, myglobal=0] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, j=1, myglobal=1] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=2, myglobal=2] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=3, myglobal=3] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=4, myglobal=4] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=5, myglobal=5] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=6, myglobal=6] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=7, myglobal=7] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=8, myglobal=8] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=9, myglobal=9] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=10, myglobal=10] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=10, myglobal=10] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=10, myglobal=10] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=11, myglobal=11] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=11, myglobal=11] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=11, myglobal=11] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=12, myglobal=12] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=12, myglobal=12] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=12, myglobal=12] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=13, myglobal=13] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=13, myglobal=13] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=13, myglobal=13] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=14, myglobal=14] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=14, myglobal=14] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=14, myglobal=14] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=15, myglobal=15] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=15, myglobal=15] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=15, myglobal=15] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=16, myglobal=16] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=16, myglobal=16] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=16, myglobal=16] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=17, myglobal=17] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=17, myglobal=17] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=17, myglobal=17] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=18, myglobal=18] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=18, myglobal=18] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=18, myglobal=18] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=19, myglobal=19] [L1325] 1 i++ [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=19, myglobal=19] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, i=19, j=19, myglobal=19, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, i=19, j=19, myglobal=20, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, i=19, j=19, myglobal=20, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, i=19, j=19, myglobal=21, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=2, j=19, myglobal=21, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=2, j=19, myglobal=22, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=3, j=19, myglobal=22, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=3, j=19, myglobal=23, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=4, j=19, myglobal=23, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=4, j=19, myglobal=24, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=5, j=19, myglobal=24, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=5, j=19, myglobal=25, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=6, j=19, myglobal=25, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=6, j=19, myglobal=26, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=7, j=19, myglobal=26, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=7, j=19, myglobal=27, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=8, j=19, myglobal=27, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=8, j=19, myglobal=28, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=9, j=19, myglobal=28, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=9, j=19, myglobal=29, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, i=19, j=19, myglobal=29, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, i=19, j=19, myglobal=30, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, i=19, j=19, myglobal=30, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, i=19, j=19, myglobal=31, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, i=19, j=19, myglobal=31, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, i=19, j=19, myglobal=32, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, i=19, j=19, myglobal=32, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, i=19, j=19, myglobal=33, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, i=19, j=19, myglobal=33, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, i=19, j=19, myglobal=34, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, i=19, j=19, myglobal=34, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, i=19, j=19, myglobal=35, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, i=19, j=19, myglobal=35, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, i=19, j=19, myglobal=36, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, i=19, j=19, myglobal=36, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, i=19, j=19, myglobal=37, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, i=19, j=19, myglobal=37, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, i=19, j=19, myglobal=38, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=19, j=19, myglobal=38, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=19, j=19, myglobal=39, mythread=-1] [L1352] 0 i++ [L1352] COND FALSE 0 !(i<20) VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=20, j=19, myglobal=39, mythread=-1] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=40, myglobal=40] [L1325] 1 i++ [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread=-1] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) [L13] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(cond, Pre)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=40, myglobal=40] - UnprovableResult [Line: 1342]: 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, 22 locations, 27 edges, 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: 95.1s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 89.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5929 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5929 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 262 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1546 IncrementalHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 262 mSolverCounterUnsat, 0 mSDtfsCounter, 1546 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1456 GetRequests, 634 SyntacticMatches, 14 SemanticMatches, 808 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264976 ImplicationChecksByTransitivity, 31.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15388occurred in iteration=9, InterpolantAutomatonStates: 814, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 830 NumberOfCodeBlocks, 798 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 1019 ConstructedInterpolants, 0 QuantifiedInterpolants, 2791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1373 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 1584/4036 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-04-14 00:14:24,835 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...