/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -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-13 19:39:26,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:39:26,251 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-13 19:39:26,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:39:26,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:39:26,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:39:26,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:39:26,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:39:26,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:39:26,279 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:39:26,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:39:26,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:39:26,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:39:26,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:39:26,279 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:39:26,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:39:26,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:39:26,280 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:39:26,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:39:26,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:39:26,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:39:26,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:39:26,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:39:26,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:39:26,280 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:39:26,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:39:26,280 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:39:26,280 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:39:26,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:39:26,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:39:26,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:39:26,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:39:26,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:39:26,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:39:26,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:39:26,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:39:26,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:39:26,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:39:26,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:39:26,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:39:26,282 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:39:26,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:39:26,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:39:26,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:39:26,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:39:26,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:39:26,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:39:26,282 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 [2025-04-13 19:39:26,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:39:26,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:39:26,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:39:26,536 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:39:26,537 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:39:26,539 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-13 19:39:27,848 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc48760d/67e487e40d5b4176bad14b927c0895a7/FLAG5b6c3c089 [2025-04-13 19:39:28,125 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:39:28,126 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2025-04-13 19:39:28,144 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc48760d/67e487e40d5b4176bad14b927c0895a7/FLAG5b6c3c089 [2025-04-13 19:39:28,848 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc48760d/67e487e40d5b4176bad14b927c0895a7 [2025-04-13 19:39:28,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:39:28,851 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:39:28,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:39:28,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:39:28,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:39:28,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:39:28" (1/1) ... [2025-04-13 19:39:28,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74305fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:28, skipping insertion in model container [2025-04-13 19:39:28,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:39:28" (1/1) ... [2025-04-13 19:39:28,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:39:29,068 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-13 19:39:29,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:39:29,336 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:39:29,350 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-13 19:39:29,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:39:29,448 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:39:29,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:29 WrapperNode [2025-04-13 19:39:29,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:39:29,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:39:29,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:39:29,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:39:29,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:29" (1/1) ... [2025-04-13 19:39:29,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:29" (1/1) ... [2025-04-13 19:39:29,487 INFO L138 Inliner]: procedures = 364, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 111 [2025-04-13 19:39:29,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:39:29,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:39:29,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:39:29,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:39:29,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:29" (1/1) ... [2025-04-13 19:39:29,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:29" (1/1) ... [2025-04-13 19:39:29,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:29" (1/1) ... [2025-04-13 19:39:29,503 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-13 19:39:29,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:29" (1/1) ... [2025-04-13 19:39:29,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:29" (1/1) ... [2025-04-13 19:39:29,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:29" (1/1) ... [2025-04-13 19:39:29,510 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:29" (1/1) ... [2025-04-13 19:39:29,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:29" (1/1) ... [2025-04-13 19:39:29,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:29" (1/1) ... [2025-04-13 19:39:29,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:29" (1/1) ... [2025-04-13 19:39:29,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:39:29,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:39:29,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:39:29,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:39:29,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:29" (1/1) ... [2025-04-13 19:39:29,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:39:29,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:39:29,546 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-13 19:39:29,548 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-13 19:39:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:39:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:39:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2025-04-13 19:39:29,565 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2025-04-13 19:39:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:39:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:39:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:39:29,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:39:29,566 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:39:29,664 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:39:29,666 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:39:29,780 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:39:29,781 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:39:29,781 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:39:30,078 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:39:30,079 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:39:30,083 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:39:30,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:39:30 BoogieIcfgContainer [2025-04-13 19:39:30,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:39:30,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:39:30,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:39:30,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:39:30,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:39:28" (1/3) ... [2025-04-13 19:39:30,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ade428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:39:30, skipping insertion in model container [2025-04-13 19:39:30,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:39:29" (2/3) ... [2025-04-13 19:39:30,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ade428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:39:30, skipping insertion in model container [2025-04-13 19:39:30,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:39:30" (3/3) ... [2025-04-13 19:39:30,093 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2025-04-13 19:39:30,103 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:39:30,104 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-13 19:39:30,105 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:39:30,136 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-13 19:39:30,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 18 transitions, 43 flow [2025-04-13 19:39:30,178 INFO L116 PetriNetUnfolderBase]: 4/17 cut-off events. [2025-04-13 19:39:30,179 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:39:30,181 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-13 19:39:30,181 INFO L82 GeneralOperation]: Start removeDead. Operand has 18 places, 18 transitions, 43 flow [2025-04-13 19:39:30,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 16 places, 16 transitions, 38 flow [2025-04-13 19:39:30,188 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:39:30,198 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;@564d88da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:39:30,199 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-13 19:39:30,207 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:39:30,208 INFO L116 PetriNetUnfolderBase]: 4/15 cut-off events. [2025-04-13 19:39:30,208 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:39:30,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:39:30,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:39:30,210 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:39:30,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:39:30,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1271191500, now seen corresponding path program 1 times [2025-04-13 19:39:30,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:39:30,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755797852] [2025-04-13 19:39:30,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:39:30,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:39:30,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:39:30,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:39:30,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:39:30,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:30,443 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-13 19:39:30,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:39:30,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755797852] [2025-04-13 19:39:30,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755797852] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:39:30,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:39:30,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:39:30,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141097404] [2025-04-13 19:39:30,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:39:30,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:39:30,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:39:30,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:39:30,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:39:30,472 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2025-04-13 19:39:30,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 16 transitions, 38 flow. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-13 19:39:30,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:39:30,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2025-04-13 19:39:30,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:39:30,517 INFO L116 PetriNetUnfolderBase]: 13/35 cut-off events. [2025-04-13 19:39:30,518 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:39:30,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 35 events. 13/35 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 6 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 55. Up to 29 conditions per place. [2025-04-13 19:39:30,519 INFO L140 encePairwiseOnDemand]: 16/18 looper letters, 11 selfloop transitions, 0 changer transitions 0/14 dead transitions. [2025-04-13 19:39:30,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 14 transitions, 56 flow [2025-04-13 19:39:30,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:39:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:39:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2025-04-13 19:39:30,530 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-04-13 19:39:30,531 INFO L175 Difference]: Start difference. First operand has 16 places, 16 transitions, 38 flow. Second operand 2 states and 21 transitions. [2025-04-13 19:39:30,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 14 transitions, 56 flow [2025-04-13 19:39:30,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 14 transitions, 52 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:39:30,537 INFO L231 Difference]: Finished difference. Result has 15 places, 14 transitions, 30 flow [2025-04-13 19:39:30,539 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-13 19:39:30,544 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, -1 predicate places. [2025-04-13 19:39:30,544 INFO L485 AbstractCegarLoop]: Abstraction has has 15 places, 14 transitions, 30 flow [2025-04-13 19:39:30,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-13 19:39:30,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:39:30,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:39:30,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:39:30,545 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:39:30,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:39:30,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1430638777, now seen corresponding path program 1 times [2025-04-13 19:39:30,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:39:30,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577667297] [2025-04-13 19:39:30,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:39:30,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:39:30,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:39:30,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:39:30,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:39:30,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:30,691 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-13 19:39:30,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:39:30,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577667297] [2025-04-13 19:39:30,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577667297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:39:30,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:39:30,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:39:30,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815487132] [2025-04-13 19:39:30,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:39:30,693 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:39:30,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:39:30,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:39:30,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:39:30,693 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2025-04-13 19:39:30,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 14 transitions, 30 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-13 19:39:30,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:39:30,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2025-04-13 19:39:30,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:39:30,730 INFO L116 PetriNetUnfolderBase]: 17/45 cut-off events. [2025-04-13 19:39:30,730 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:39:30,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 45 events. 17/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 82 event pairs, 3 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 82. Up to 29 conditions per place. [2025-04-13 19:39:30,731 INFO L140 encePairwiseOnDemand]: 15/18 looper letters, 14 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2025-04-13 19:39:30,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 19 transitions, 72 flow [2025-04-13 19:39:30,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:39:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:39:30,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-13 19:39:30,732 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-04-13 19:39:30,732 INFO L175 Difference]: Start difference. First operand has 15 places, 14 transitions, 30 flow. Second operand 3 states and 29 transitions. [2025-04-13 19:39:30,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 19 transitions, 72 flow [2025-04-13 19:39:30,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 19 transitions, 72 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:39:30,734 INFO L231 Difference]: Finished difference. Result has 18 places, 15 transitions, 42 flow [2025-04-13 19:39:30,734 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-13 19:39:30,734 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, 2 predicate places. [2025-04-13 19:39:30,734 INFO L485 AbstractCegarLoop]: Abstraction has has 18 places, 15 transitions, 42 flow [2025-04-13 19:39:30,734 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-13 19:39:30,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:39:30,735 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:39:30,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:39:30,735 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:39:30,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:39:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash -498747554, now seen corresponding path program 1 times [2025-04-13 19:39:30,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:39:30,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509907129] [2025-04-13 19:39:30,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:39:30,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:39:30,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:39:30,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:39:30,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:39:30,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:30,842 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-13 19:39:30,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:39:30,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509907129] [2025-04-13 19:39:30,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509907129] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:39:30,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:39:30,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:39:30,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114781167] [2025-04-13 19:39:30,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:39:30,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:39:30,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:39:30,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:39:30,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:39:30,844 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2025-04-13 19:39:30,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 15 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-13 19:39:30,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:39:30,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2025-04-13 19:39:30,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:39:30,880 INFO L116 PetriNetUnfolderBase]: 25/70 cut-off events. [2025-04-13 19:39:30,880 INFO L117 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-04-13 19:39:30,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 70 events. 25/70 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 9 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 153. Up to 37 conditions per place. [2025-04-13 19:39:30,881 INFO L140 encePairwiseOnDemand]: 15/18 looper letters, 16 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2025-04-13 19:39:30,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 21 transitions, 100 flow [2025-04-13 19:39:30,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:39:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:39:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-13 19:39:30,882 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-04-13 19:39:30,882 INFO L175 Difference]: Start difference. First operand has 18 places, 15 transitions, 42 flow. Second operand 3 states and 29 transitions. [2025-04-13 19:39:30,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 21 transitions, 100 flow [2025-04-13 19:39:30,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 21 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:39:30,883 INFO L231 Difference]: Finished difference. Result has 20 places, 16 transitions, 52 flow [2025-04-13 19:39:30,883 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-13 19:39:30,884 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, 4 predicate places. [2025-04-13 19:39:30,884 INFO L485 AbstractCegarLoop]: Abstraction has has 20 places, 16 transitions, 52 flow [2025-04-13 19:39:30,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-13 19:39:30,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:39:30,884 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:39:30,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:39:30,884 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:39:30,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:39:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1588434408, now seen corresponding path program 1 times [2025-04-13 19:39:30,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:39:30,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729333913] [2025-04-13 19:39:30,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:39:30,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:39:30,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 19:39:30,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 19:39:30,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:39:30,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 19:39:30,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:39:30,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729333913] [2025-04-13 19:39:30,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729333913] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:39:30,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237525032] [2025-04-13 19:39:30,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:39:30,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:39:30,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:39:30,965 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-13 19:39:30,967 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-13 19:39:31,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 19:39:31,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 19:39:31,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:39:31,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:31,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 19:39:31,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:39:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 19:39:31,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:39:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 19:39:31,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237525032] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:39:31,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:39:31,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 19:39:31,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299745906] [2025-04-13 19:39:31,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:39:31,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:39:31,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:39:31,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:39:31,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:39:31,156 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2025-04-13 19:39:31,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 52 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-13 19:39:31,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:39:31,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2025-04-13 19:39:31,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:39:31,246 INFO L116 PetriNetUnfolderBase]: 49/138 cut-off events. [2025-04-13 19:39:31,246 INFO L117 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-04-13 19:39:31,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 138 events. 49/138 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 339 event pairs, 7 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 319. Up to 37 conditions per place. [2025-04-13 19:39:31,248 INFO L140 encePairwiseOnDemand]: 15/18 looper letters, 31 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2025-04-13 19:39:31,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 39 transitions, 208 flow [2025-04-13 19:39:31,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:39:31,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:39:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-04-13 19:39:31,250 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-04-13 19:39:31,250 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 52 flow. Second operand 6 states and 58 transitions. [2025-04-13 19:39:31,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 39 transitions, 208 flow [2025-04-13 19:39:31,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 39 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:39:31,251 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 86 flow [2025-04-13 19:39:31,252 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=86, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2025-04-13 19:39:31,252 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, 11 predicate places. [2025-04-13 19:39:31,252 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 86 flow [2025-04-13 19:39:31,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-13 19:39:31,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:39:31,252 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:39:31,259 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-13 19:39:31,453 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-13 19:39:31,453 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:39:31,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:39:31,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2041947698, now seen corresponding path program 2 times [2025-04-13 19:39:31,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:39:31,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505698004] [2025-04-13 19:39:31,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:39:31,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:39:31,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 19:39:31,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 19:39:31,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:39:31,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 19:39:31,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:39:31,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505698004] [2025-04-13 19:39:31,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505698004] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:39:31,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067737671] [2025-04-13 19:39:31,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:39:31,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:39:31,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:39:31,557 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-13 19:39:31,558 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-13 19:39:31,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 19:39:31,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 19:39:31,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:39:31,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:31,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 19:39:31,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:39:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 19:39:31,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:39:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 19:39:31,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067737671] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:39:31,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:39:31,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-04-13 19:39:31,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854732330] [2025-04-13 19:39:31,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:39:31,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:39:31,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:39:31,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:39:31,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:39:31,785 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2025-04-13 19:39:31,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 86 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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-13 19:39:31,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:39:31,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2025-04-13 19:39:31,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:39:31,874 INFO L116 PetriNetUnfolderBase]: 85/251 cut-off events. [2025-04-13 19:39:31,874 INFO L117 PetriNetUnfolderBase]: For 328/328 co-relation queries the response was YES. [2025-04-13 19:39:31,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 251 events. 85/251 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 993 event pairs, 22 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 641. Up to 77 conditions per place. [2025-04-13 19:39:31,879 INFO L140 encePairwiseOnDemand]: 15/18 looper letters, 46 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-04-13 19:39:31,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 54 transitions, 416 flow [2025-04-13 19:39:31,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:39:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:39:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-04-13 19:39:31,880 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-04-13 19:39:31,880 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 86 flow. Second operand 6 states and 58 transitions. [2025-04-13 19:39:31,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 54 transitions, 416 flow [2025-04-13 19:39:31,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 54 transitions, 376 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-04-13 19:39:31,882 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 114 flow [2025-04-13 19:39:31,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2025-04-13 19:39:31,882 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, 18 predicate places. [2025-04-13 19:39:31,882 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 114 flow [2025-04-13 19:39:31,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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-13 19:39:31,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:39:31,884 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:39:31,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 19:39:32,085 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-13 19:39:32,085 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:39:32,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:39:32,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1134371507, now seen corresponding path program 3 times [2025-04-13 19:39:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:39:32,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301940741] [2025-04-13 19:39:32,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:39:32,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:39:32,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 5 equivalence classes. [2025-04-13 19:39:32,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:39:32,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 19:39:32,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 19:39:32,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:39:32,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301940741] [2025-04-13 19:39:32,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301940741] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:39:32,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146401562] [2025-04-13 19:39:32,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:39:32,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:39:32,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:39:32,226 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-13 19:39:32,228 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-13 19:39:32,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 5 equivalence classes. [2025-04-13 19:39:32,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:39:32,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 19:39:32,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:32,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:39:32,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:39:32,394 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 19:39:32,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:39:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 19:39:32,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146401562] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:39:32,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:39:32,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 19:39:32,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743862034] [2025-04-13 19:39:32,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:39:32,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 19:39:32,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:39:32,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 19:39:32,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 19:39:32,455 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2025-04-13 19:39:32,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 114 flow. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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-13 19:39:32,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:39:32,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2025-04-13 19:39:32,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:39:32,583 INFO L116 PetriNetUnfolderBase]: 169/502 cut-off events. [2025-04-13 19:39:32,584 INFO L117 PetriNetUnfolderBase]: For 1612/1612 co-relation queries the response was YES. [2025-04-13 19:39:32,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 502 events. 169/502 cut-off events. For 1612/1612 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2172 event pairs, 18 based on Foata normal form. 42/541 useless extension candidates. Maximal degree in co-relation 1488. Up to 145 conditions per place. [2025-04-13 19:39:32,588 INFO L140 encePairwiseOnDemand]: 15/18 looper letters, 94 selfloop transitions, 11 changer transitions 0/108 dead transitions. [2025-04-13 19:39:32,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 108 transitions, 900 flow [2025-04-13 19:39:32,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:39:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 19:39:32,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2025-04-13 19:39:32,591 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5324074074074074 [2025-04-13 19:39:32,591 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 114 flow. Second operand 12 states and 115 transitions. [2025-04-13 19:39:32,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 108 transitions, 900 flow [2025-04-13 19:39:32,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 108 transitions, 812 flow, removed 33 selfloop flow, removed 1 redundant places. [2025-04-13 19:39:32,597 INFO L231 Difference]: Finished difference. Result has 50 places, 28 transitions, 190 flow [2025-04-13 19:39:32,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=190, PETRI_PLACES=50, PETRI_TRANSITIONS=28} [2025-04-13 19:39:32,598 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, 34 predicate places. [2025-04-13 19:39:32,598 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 28 transitions, 190 flow [2025-04-13 19:39:32,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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-13 19:39:32,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:39:32,598 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:39:32,604 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-13 19:39:32,799 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-13 19:39:32,799 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:39:32,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:39:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1212763141, now seen corresponding path program 4 times [2025-04-13 19:39:32,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:39:32,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077312408] [2025-04-13 19:39:32,800 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:39:32,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:39:32,816 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 60 statements into 2 equivalence classes. [2025-04-13 19:39:32,831 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-04-13 19:39:32,831 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:39:32,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-04-13 19:39:32,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:39:32,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077312408] [2025-04-13 19:39:32,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077312408] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:39:32,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500681170] [2025-04-13 19:39:32,920 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:39:32,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:39:32,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:39:32,922 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-13 19:39:32,925 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-13 19:39:33,027 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 60 statements into 2 equivalence classes. [2025-04-13 19:39:33,050 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-04-13 19:39:33,050 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:39:33,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:33,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:39:33,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:39:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-04-13 19:39:33,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:39:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-04-13 19:39:33,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500681170] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:39:33,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:39:33,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-04-13 19:39:33,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231639772] [2025-04-13 19:39:33,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:39:33,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 19:39:33,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:39:33,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 19:39:33,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-04-13 19:39:33,131 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2025-04-13 19:39:33,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 28 transitions, 190 flow. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 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-13 19:39:33,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:39:33,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2025-04-13 19:39:33,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:39:33,285 INFO L116 PetriNetUnfolderBase]: 313/914 cut-off events. [2025-04-13 19:39:33,285 INFO L117 PetriNetUnfolderBase]: For 4402/4402 co-relation queries the response was YES. [2025-04-13 19:39:33,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2874 conditions, 914 events. 313/914 cut-off events. For 4402/4402 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5003 event pairs, 46 based on Foata normal form. 144/1058 useless extension candidates. Maximal degree in co-relation 2854. Up to 288 conditions per place. [2025-04-13 19:39:33,291 INFO L140 encePairwiseOnDemand]: 15/18 looper letters, 160 selfloop transitions, 11 changer transitions 0/174 dead transitions. [2025-04-13 19:39:33,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 174 transitions, 1868 flow [2025-04-13 19:39:33,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:39:33,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 19:39:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2025-04-13 19:39:33,295 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5324074074074074 [2025-04-13 19:39:33,295 INFO L175 Difference]: Start difference. First operand has 50 places, 28 transitions, 190 flow. Second operand 12 states and 115 transitions. [2025-04-13 19:39:33,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 174 transitions, 1868 flow [2025-04-13 19:39:33,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 174 transitions, 1472 flow, removed 143 selfloop flow, removed 5 redundant places. [2025-04-13 19:39:33,304 INFO L231 Difference]: Finished difference. Result has 62 places, 34 transitions, 238 flow [2025-04-13 19:39:33,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=238, PETRI_PLACES=62, PETRI_TRANSITIONS=34} [2025-04-13 19:39:33,304 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, 46 predicate places. [2025-04-13 19:39:33,304 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 34 transitions, 238 flow [2025-04-13 19:39:33,306 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 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-13 19:39:33,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:39:33,306 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:39:33,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 19:39:33,506 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-13 19:39:33,507 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:39:33,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:39:33,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1584839387, now seen corresponding path program 5 times [2025-04-13 19:39:33,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:39:33,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563439986] [2025-04-13 19:39:33,507 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:39:33,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:39:33,520 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 72 statements into 11 equivalence classes. [2025-04-13 19:39:33,532 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 72 of 72 statements. [2025-04-13 19:39:33,532 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-13 19:39:33,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-04-13 19:39:33,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:39:33,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563439986] [2025-04-13 19:39:33,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563439986] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:39:33,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560909975] [2025-04-13 19:39:33,700 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:39:33,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:39:33,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:39:33,701 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-13 19:39:33,703 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-13 19:39:33,809 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 72 statements into 11 equivalence classes. [2025-04-13 19:39:33,838 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 72 of 72 statements. [2025-04-13 19:39:33,838 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-13 19:39:33,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:33,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 19:39:33,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:39:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-04-13 19:39:33,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:39:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-04-13 19:39:34,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560909975] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:39:34,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:39:34,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2025-04-13 19:39:34,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79057502] [2025-04-13 19:39:34,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:39:34,045 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 19:39:34,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:39:34,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 19:39:34,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2025-04-13 19:39:34,046 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2025-04-13 19:39:34,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 34 transitions, 238 flow. Second operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 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-13 19:39:34,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:39:34,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2025-04-13 19:39:34,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:39:34,382 INFO L116 PetriNetUnfolderBase]: 529/1571 cut-off events. [2025-04-13 19:39:34,382 INFO L117 PetriNetUnfolderBase]: For 18657/18657 co-relation queries the response was YES. [2025-04-13 19:39:34,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5256 conditions, 1571 events. 529/1571 cut-off events. For 18657/18657 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 9559 event pairs, 13 based on Foata normal form. 216/1785 useless extension candidates. Maximal degree in co-relation 5230. Up to 504 conditions per place. [2025-04-13 19:39:34,395 INFO L140 encePairwiseOnDemand]: 15/18 looper letters, 286 selfloop transitions, 20 changer transitions 0/309 dead transitions. [2025-04-13 19:39:34,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 309 transitions, 2708 flow [2025-04-13 19:39:34,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 19:39:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-13 19:39:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 199 transitions. [2025-04-13 19:39:34,398 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5264550264550265 [2025-04-13 19:39:34,398 INFO L175 Difference]: Start difference. First operand has 62 places, 34 transitions, 238 flow. Second operand 21 states and 199 transitions. [2025-04-13 19:39:34,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 309 transitions, 2708 flow [2025-04-13 19:39:34,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 309 transitions, 2654 flow, removed 22 selfloop flow, removed 5 redundant places. [2025-04-13 19:39:34,414 INFO L231 Difference]: Finished difference. Result has 86 places, 43 transitions, 334 flow [2025-04-13 19:39:34,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=334, PETRI_PLACES=86, PETRI_TRANSITIONS=43} [2025-04-13 19:39:34,416 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, 70 predicate places. [2025-04-13 19:39:34,416 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 43 transitions, 334 flow [2025-04-13 19:39:34,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 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-13 19:39:34,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:39:34,416 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 19, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:39:34,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 19:39:34,616 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-13 19:39:34,617 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:39:34,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:39:34,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2053900848, now seen corresponding path program 6 times [2025-04-13 19:39:34,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:39:34,618 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461726566] [2025-04-13 19:39:34,618 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:39:34,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:39:34,637 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 90 statements into 20 equivalence classes. [2025-04-13 19:39:34,664 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) and asserted 90 of 90 statements. [2025-04-13 19:39:34,664 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2025-04-13 19:39:34,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-04-13 19:39:34,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:39:34,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461726566] [2025-04-13 19:39:34,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461726566] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:39:34,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033917436] [2025-04-13 19:39:34,884 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:39:34,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:39:34,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:39:34,886 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-13 19:39:34,888 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-13 19:39:35,002 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 90 statements into 20 equivalence classes. [2025-04-13 19:39:35,049 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) and asserted 90 of 90 statements. [2025-04-13 19:39:35,049 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2025-04-13 19:39:35,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:39:35,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 19:39:35,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:39:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-04-13 19:39:35,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:39:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-04-13 19:39:35,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033917436] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:39:35,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:39:35,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2025-04-13 19:39:35,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938681120] [2025-04-13 19:39:35,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:39:35,381 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 19:39:35,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:39:35,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 19:39:35,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-04-13 19:39:35,382 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2025-04-13 19:39:35,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 43 transitions, 334 flow. Second operand has 22 states, 22 states have (on average 6.5) internal successors, (143), 22 states have internal predecessors, (143), 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-13 19:39:35,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:39:35,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2025-04-13 19:39:35,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:39:35,827 INFO L116 PetriNetUnfolderBase]: 925/2770 cut-off events. [2025-04-13 19:39:35,827 INFO L117 PetriNetUnfolderBase]: For 28053/28053 co-relation queries the response was YES. [2025-04-13 19:39:35,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9560 conditions, 2770 events. 925/2770 cut-off events. For 28053/28053 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 18490 event pairs, 63 based on Foata normal form. 198/2965 useless extension candidates. Maximal degree in co-relation 9525. Up to 882 conditions per place. [2025-04-13 19:39:35,850 INFO L140 encePairwiseOnDemand]: 15/18 looper letters, 466 selfloop transitions, 20 changer transitions 0/489 dead transitions. [2025-04-13 19:39:35,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 489 transitions, 5654 flow [2025-04-13 19:39:35,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 19:39:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-13 19:39:35,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 199 transitions. [2025-04-13 19:39:35,852 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5264550264550265 [2025-04-13 19:39:35,852 INFO L175 Difference]: Start difference. First operand has 86 places, 43 transitions, 334 flow. Second operand 21 states and 199 transitions. [2025-04-13 19:39:35,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 489 transitions, 5654 flow [2025-04-13 19:39:35,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 489 transitions, 4454 flow, removed 380 selfloop flow, removed 11 redundant places. [2025-04-13 19:39:35,872 INFO L231 Difference]: Finished difference. Result has 104 places, 52 transitions, 406 flow [2025-04-13 19:39:35,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=406, PETRI_PLACES=104, PETRI_TRANSITIONS=52} [2025-04-13 19:39:35,873 INFO L279 CegarLoopForPetriNet]: 16 programPoint places, 88 predicate places. [2025-04-13 19:39:35,873 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 52 transitions, 406 flow [2025-04-13 19:39:35,873 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.5) internal successors, (143), 22 states have internal predecessors, (143), 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-13 19:39:35,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:39:35,873 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:39:35,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 19:39:36,078 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-13 19:39:36,078 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:39:36,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:39:36,079 INFO L85 PathProgramCache]: Analyzing trace with hash -161634190, now seen corresponding path program 7 times [2025-04-13 19:39:36,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:39:36,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786747099] [2025-04-13 19:39:36,079 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:39:36,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:39:36,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-04-13 19:39:36,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-04-13 19:39:36,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:39:36,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:39:36,119 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:39:36,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-04-13 19:39:36,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-04-13 19:39:36,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:39:36,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:39:36,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:39:36,201 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:39:36,201 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-04-13 19:39:36,202 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-13 19:39:36,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:39:36,203 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2025-04-13 19:39:36,298 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:39:36,298 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:39:36,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:39:36 BasicIcfg [2025-04-13 19:39:36,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:39:36,306 INFO L158 Benchmark]: Toolchain (without parser) took 7454.98ms. Allocated memory was 155.2MB in the beginning and 390.1MB in the end (delta: 234.9MB). Free memory was 106.9MB in the beginning and 124.9MB in the end (delta: -18.0MB). Peak memory consumption was 216.5MB. Max. memory is 8.0GB. [2025-04-13 19:39:36,306 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 155.2MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:39:36,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.48ms. Allocated memory is still 155.2MB. Free memory was 106.9MB in the beginning and 66.7MB in the end (delta: 40.3MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-13 19:39:36,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.88ms. Allocated memory is still 155.2MB. Free memory was 66.7MB in the beginning and 63.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:39:36,306 INFO L158 Benchmark]: Boogie Preprocessor took 29.26ms. Allocated memory is still 155.2MB. Free memory was 63.9MB in the beginning and 61.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:39:36,306 INFO L158 Benchmark]: RCFGBuilder took 566.33ms. Allocated memory is still 155.2MB. Free memory was 61.7MB in the beginning and 77.1MB in the end (delta: -15.3MB). Peak memory consumption was 45.5MB. Max. memory is 8.0GB. [2025-04-13 19:39:36,307 INFO L158 Benchmark]: TraceAbstraction took 6220.03ms. Allocated memory was 155.2MB in the beginning and 390.1MB in the end (delta: 234.9MB). Free memory was 76.3MB in the beginning and 124.9MB in the end (delta: -48.6MB). Peak memory consumption was 183.6MB. Max. memory is 8.0GB. [2025-04-13 19:39:36,308 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.24ms. Allocated memory is still 155.2MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 598.48ms. Allocated memory is still 155.2MB. Free memory was 106.9MB in the beginning and 66.7MB in the end (delta: 40.3MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.88ms. Allocated memory is still 155.2MB. Free memory was 66.7MB in the beginning and 63.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.26ms. Allocated memory is still 155.2MB. Free memory was 63.9MB in the beginning and 61.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 566.33ms. Allocated memory is still 155.2MB. Free memory was 61.7MB in the beginning and 77.1MB in the end (delta: -15.3MB). Peak memory consumption was 45.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6220.03ms. Allocated memory was 155.2MB in the beginning and 390.1MB in the end (delta: 234.9MB). Free memory was 76.3MB in the beginning and 124.9MB in the end (delta: -48.6MB). Peak memory consumption was 183.6MB. 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] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=19, myglobal=19] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=20, myglobal=20] [L1325] 1 i++ [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [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}, \result={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=20, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=21, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=21, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=22, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=22, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=23, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=23, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=24, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=24, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=25, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=25, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=26, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=26, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=27, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=27, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=28, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=28, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=29, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=29, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=30, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=30, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=31, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=31, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=32, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=32, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=33, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=33, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=34, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=34, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=35, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=35, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=36, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=36, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=37, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=37, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=38, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=38, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=39, mythread=-1] [L1352] 0 i++ [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=39, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=40, mythread=-1] [L1352] 0 i++ [L1352] COND FALSE 0 !(i<20) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=20, myglobal=40, mythread=-1] [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=20, 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=20, 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: 6.0s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 542 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 542 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 598 IncrementalHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 0 mSDtfsCounter, 598 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 656 GetRequests, 579 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=406occurred in iteration=9, InterpolantAutomatonStates: 86, 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, 1.8s InterpolantComputationTime, 770 NumberOfCodeBlocks, 770 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 929 ConstructedInterpolants, 0 QuantifiedInterpolants, 1971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1338 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 2623/4354 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-13 19:39:36,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...