./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe024_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe024_tso.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f830c559346dfed293d38cb3f451f57bf45496349320c2696ae4150a4c0c44e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:54:00,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:54:00,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:54:00,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:54:00,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:54:00,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:54:00,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:54:00,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:54:00,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:54:00,159 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:54:00,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:54:00,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:54:00,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:54:00,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:54:00,159 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:54:00,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:54:00,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:54:00,159 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:54:00,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:54:00,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:54:00,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:54:00,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:54:00,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:54:00,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:54:00,160 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:54:00,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:54:00,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:54:00,161 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f830c559346dfed293d38cb3f451f57bf45496349320c2696ae4150a4c0c44e9 [2025-03-14 00:54:00,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:54:00,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:54:00,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:54:00,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:54:00,394 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:54:00,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe024_tso.i [2025-03-14 00:54:01,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00ad27d89/d54a2420f0ff4cd389ec9d2ce287cd5f/FLAGd06dd9d4d [2025-03-14 00:54:01,768 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:54:01,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe024_tso.i [2025-03-14 00:54:01,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00ad27d89/d54a2420f0ff4cd389ec9d2ce287cd5f/FLAGd06dd9d4d [2025-03-14 00:54:02,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00ad27d89/d54a2420f0ff4cd389ec9d2ce287cd5f [2025-03-14 00:54:02,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:54:02,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:54:02,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:54:02,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:54:02,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:54:02,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:54:02" (1/1) ... [2025-03-14 00:54:02,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235e7df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:02, skipping insertion in model container [2025-03-14 00:54:02,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:54:02" (1/1) ... [2025-03-14 00:54:02,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:54:02,233 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe024_tso.i[945,958] [2025-03-14 00:54:02,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:54:02,379 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:54:02,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe024_tso.i[945,958] [2025-03-14 00:54:02,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:54:02,439 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:54:02,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:02 WrapperNode [2025-03-14 00:54:02,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:54:02,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:54:02,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:54:02,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:54:02,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:02" (1/1) ... [2025-03-14 00:54:02,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:02" (1/1) ... [2025-03-14 00:54:02,471 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2025-03-14 00:54:02,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:54:02,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:54:02,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:54:02,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:54:02,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:02" (1/1) ... [2025-03-14 00:54:02,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:02" (1/1) ... [2025-03-14 00:54:02,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:02" (1/1) ... [2025-03-14 00:54:02,485 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-14 00:54:02,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:02" (1/1) ... [2025-03-14 00:54:02,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:02" (1/1) ... [2025-03-14 00:54:02,488 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:02" (1/1) ... [2025-03-14 00:54:02,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:02" (1/1) ... [2025-03-14 00:54:02,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:02" (1/1) ... [2025-03-14 00:54:02,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:02" (1/1) ... [2025-03-14 00:54:02,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:54:02,491 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:54:02,492 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:54:02,492 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:54:02,492 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:02" (1/1) ... [2025-03-14 00:54:02,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:54:02,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:54:02,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 00:54:02,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 00:54:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 00:54:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:54:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-14 00:54:02,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-14 00:54:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-14 00:54:02,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-14 00:54:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-14 00:54:02,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-14 00:54:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:54:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 00:54:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:54:02,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:54:02,539 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:54:02,621 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:54:02,622 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:54:02,727 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:54:02,728 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:54:02,728 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:54:02,825 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:54:02,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:02 BoogieIcfgContainer [2025-03-14 00:54:02,825 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:54:02,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:54:02,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:54:02,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:54:02,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:54:02" (1/3) ... [2025-03-14 00:54:02,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b39a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:54:02, skipping insertion in model container [2025-03-14 00:54:02,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:02" (2/3) ... [2025-03-14 00:54:02,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b39a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:54:02, skipping insertion in model container [2025-03-14 00:54:02,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:02" (3/3) ... [2025-03-14 00:54:02,833 INFO L128 eAbstractionObserver]: Analyzing ICFG safe024_tso.i [2025-03-14 00:54:02,844 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:54:02,846 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe024_tso.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-14 00:54:02,846 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:54:02,879 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:54:02,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2025-03-14 00:54:02,924 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2025-03-14 00:54:02,925 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:54:02,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-03-14 00:54:02,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2025-03-14 00:54:02,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2025-03-14 00:54:02,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:54:02,948 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63121459, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:54:02,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 00:54:02,960 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:54:02,962 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-14 00:54:02,963 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:54:02,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:02,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:02,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:02,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:02,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1827766562, now seen corresponding path program 1 times [2025-03-14 00:54:02,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:02,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565748333] [2025-03-14 00:54:02,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:03,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:54:03,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:54:03,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:03,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:03,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:03,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565748333] [2025-03-14 00:54:03,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565748333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:03,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:03,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:54:03,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957397614] [2025-03-14 00:54:03,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:03,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:54:03,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:03,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:54:03,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:54:03,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:54:03,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-03-14 00:54:03,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:03,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:54:03,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:04,327 INFO L124 PetriNetUnfolderBase]: 5876/8684 cut-off events. [2025-03-14 00:54:04,328 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-14 00:54:04,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17230 conditions, 8684 events. 5876/8684 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 48639 event pairs, 1622 based on Foata normal form. 252/8927 useless extension candidates. Maximal degree in co-relation 17219. Up to 6591 conditions per place. [2025-03-14 00:54:04,381 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 43 selfloop transitions, 3 changer transitions 53/103 dead transitions. [2025-03-14 00:54:04,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 103 transitions, 419 flow [2025-03-14 00:54:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:54:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:54:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2025-03-14 00:54:04,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5494505494505495 [2025-03-14 00:54:04,396 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 7 states and 150 transitions. [2025-03-14 00:54:04,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 103 transitions, 419 flow [2025-03-14 00:54:04,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 103 transitions, 414 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 00:54:04,405 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 107 flow [2025-03-14 00:54:04,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=107, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2025-03-14 00:54:04,412 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2025-03-14 00:54:04,412 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 107 flow [2025-03-14 00:54:04,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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-03-14 00:54:04,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:04,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:04,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:54:04,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:04,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:04,414 INFO L85 PathProgramCache]: Analyzing trace with hash -6813883, now seen corresponding path program 1 times [2025-03-14 00:54:04,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:04,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791539044] [2025-03-14 00:54:04,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:04,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:04,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 00:54:04,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 00:54:04,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:04,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:04,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:04,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791539044] [2025-03-14 00:54:04,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791539044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:04,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:04,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:54:04,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839109674] [2025-03-14 00:54:04,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:04,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:04,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:04,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:04,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:04,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:54:04,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 107 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:04,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:04,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:54:04,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:05,499 INFO L124 PetriNetUnfolderBase]: 6363/9267 cut-off events. [2025-03-14 00:54:05,500 INFO L125 PetriNetUnfolderBase]: For 4664/4670 co-relation queries the response was YES. [2025-03-14 00:54:05,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22034 conditions, 9267 events. 6363/9267 cut-off events. For 4664/4670 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 51181 event pairs, 753 based on Foata normal form. 238/9496 useless extension candidates. Maximal degree in co-relation 22019. Up to 4781 conditions per place. [2025-03-14 00:54:05,546 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 79 selfloop transitions, 11 changer transitions 94/188 dead transitions. [2025-03-14 00:54:05,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 188 transitions, 913 flow [2025-03-14 00:54:05,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 00:54:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 00:54:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 277 transitions. [2025-03-14 00:54:05,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5463510848126233 [2025-03-14 00:54:05,550 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 107 flow. Second operand 13 states and 277 transitions. [2025-03-14 00:54:05,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 188 transitions, 913 flow [2025-03-14 00:54:05,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 188 transitions, 884 flow, removed 12 selfloop flow, removed 3 redundant places. [2025-03-14 00:54:05,617 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 224 flow [2025-03-14 00:54:05,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=224, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2025-03-14 00:54:05,618 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2025-03-14 00:54:05,618 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 224 flow [2025-03-14 00:54:05,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:05,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:05,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:05,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:54:05,620 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:05,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:05,621 INFO L85 PathProgramCache]: Analyzing trace with hash -722525346, now seen corresponding path program 1 times [2025-03-14 00:54:05,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:05,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12146482] [2025-03-14 00:54:05,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:05,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:05,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 00:54:05,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 00:54:05,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:05,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:05,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:05,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12146482] [2025-03-14 00:54:05,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12146482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:05,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:05,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:54:05,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482736402] [2025-03-14 00:54:05,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:05,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:54:05,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:05,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:54:05,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:54:05,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:54:05,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 43 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:05,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:05,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:54:05,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:06,913 INFO L124 PetriNetUnfolderBase]: 7381/10771 cut-off events. [2025-03-14 00:54:06,913 INFO L125 PetriNetUnfolderBase]: For 31252/31252 co-relation queries the response was YES. [2025-03-14 00:54:06,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33488 conditions, 10771 events. 7381/10771 cut-off events. For 31252/31252 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 59095 event pairs, 1660 based on Foata normal form. 320/11078 useless extension candidates. Maximal degree in co-relation 33463. Up to 3817 conditions per place. [2025-03-14 00:54:06,965 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 51 selfloop transitions, 5 changer transitions 101/161 dead transitions. [2025-03-14 00:54:06,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 161 transitions, 1086 flow [2025-03-14 00:54:06,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:54:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:54:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215 transitions. [2025-03-14 00:54:06,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2025-03-14 00:54:06,969 INFO L175 Difference]: Start difference. First operand has 67 places, 43 transitions, 224 flow. Second operand 10 states and 215 transitions. [2025-03-14 00:54:06,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 161 transitions, 1086 flow [2025-03-14 00:54:07,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 161 transitions, 966 flow, removed 55 selfloop flow, removed 7 redundant places. [2025-03-14 00:54:07,066 INFO L231 Difference]: Finished difference. Result has 69 places, 37 transitions, 179 flow [2025-03-14 00:54:07,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=179, PETRI_PLACES=69, PETRI_TRANSITIONS=37} [2025-03-14 00:54:07,067 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2025-03-14 00:54:07,068 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 37 transitions, 179 flow [2025-03-14 00:54:07,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:07,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:07,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:07,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:54:07,068 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:07,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:07,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2000438329, now seen corresponding path program 1 times [2025-03-14 00:54:07,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:07,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88372729] [2025-03-14 00:54:07,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:07,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:07,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 00:54:07,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 00:54:07,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:07,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:07,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:07,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:07,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88372729] [2025-03-14 00:54:07,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88372729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:07,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:07,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:54:07,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628975189] [2025-03-14 00:54:07,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:07,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:54:07,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:07,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:54:07,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:54:07,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-14 00:54:07,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 37 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:07,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:07,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-14 00:54:07,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:07,497 INFO L124 PetriNetUnfolderBase]: 2563/4055 cut-off events. [2025-03-14 00:54:07,497 INFO L125 PetriNetUnfolderBase]: For 9652/9652 co-relation queries the response was YES. [2025-03-14 00:54:07,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12289 conditions, 4055 events. 2563/4055 cut-off events. For 9652/9652 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 21514 event pairs, 399 based on Foata normal form. 182/4234 useless extension candidates. Maximal degree in co-relation 12261. Up to 2031 conditions per place. [2025-03-14 00:54:07,524 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 65 selfloop transitions, 5 changer transitions 1/76 dead transitions. [2025-03-14 00:54:07,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 76 transitions, 499 flow [2025-03-14 00:54:07,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:54:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:54:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-03-14 00:54:07,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6474358974358975 [2025-03-14 00:54:07,526 INFO L175 Difference]: Start difference. First operand has 69 places, 37 transitions, 179 flow. Second operand 4 states and 101 transitions. [2025-03-14 00:54:07,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 76 transitions, 499 flow [2025-03-14 00:54:07,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 443 flow, removed 16 selfloop flow, removed 11 redundant places. [2025-03-14 00:54:07,546 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 181 flow [2025-03-14 00:54:07,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2025-03-14 00:54:07,547 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2025-03-14 00:54:07,547 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 181 flow [2025-03-14 00:54:07,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:07,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:07,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:07,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:54:07,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:07,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:07,548 INFO L85 PathProgramCache]: Analyzing trace with hash 988807004, now seen corresponding path program 1 times [2025-03-14 00:54:07,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:07,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213523823] [2025-03-14 00:54:07,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:07,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:07,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 00:54:07,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 00:54:07,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:07,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:07,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:07,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213523823] [2025-03-14 00:54:07,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213523823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:07,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:07,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:54:07,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778711864] [2025-03-14 00:54:07,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:07,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:54:07,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:07,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:54:07,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:54:07,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-14 00:54:07,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:07,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:07,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-14 00:54:07,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:07,842 INFO L124 PetriNetUnfolderBase]: 1581/2535 cut-off events. [2025-03-14 00:54:07,842 INFO L125 PetriNetUnfolderBase]: For 3722/3722 co-relation queries the response was YES. [2025-03-14 00:54:07,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7478 conditions, 2535 events. 1581/2535 cut-off events. For 3722/3722 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 12009 event pairs, 253 based on Foata normal form. 132/2664 useless extension candidates. Maximal degree in co-relation 7457. Up to 804 conditions per place. [2025-03-14 00:54:07,854 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 75 selfloop transitions, 8 changer transitions 1/89 dead transitions. [2025-03-14 00:54:07,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 89 transitions, 552 flow [2025-03-14 00:54:07,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:54:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:54:07,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-03-14 00:54:07,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2025-03-14 00:54:07,856 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 181 flow. Second operand 5 states and 125 transitions. [2025-03-14 00:54:07,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 89 transitions, 552 flow [2025-03-14 00:54:07,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 89 transitions, 526 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-14 00:54:07,861 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 212 flow [2025-03-14 00:54:07,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2025-03-14 00:54:07,862 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2025-03-14 00:54:07,862 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 212 flow [2025-03-14 00:54:07,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:07,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:07,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:07,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:54:07,863 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:07,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:07,865 INFO L85 PathProgramCache]: Analyzing trace with hash 166425722, now seen corresponding path program 1 times [2025-03-14 00:54:07,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:07,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149986370] [2025-03-14 00:54:07,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:07,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:07,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 00:54:07,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 00:54:07,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:07,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:07,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:07,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:07,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149986370] [2025-03-14 00:54:07,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149986370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:07,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:07,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:54:07,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642008966] [2025-03-14 00:54:07,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:07,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:07,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:07,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:07,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:07,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-14 00:54:07,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:07,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:07,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-14 00:54:07,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:08,143 INFO L124 PetriNetUnfolderBase]: 997/1579 cut-off events. [2025-03-14 00:54:08,143 INFO L125 PetriNetUnfolderBase]: For 2438/2438 co-relation queries the response was YES. [2025-03-14 00:54:08,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4800 conditions, 1579 events. 997/1579 cut-off events. For 2438/2438 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6681 event pairs, 223 based on Foata normal form. 52/1628 useless extension candidates. Maximal degree in co-relation 4779. Up to 572 conditions per place. [2025-03-14 00:54:08,150 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 65 selfloop transitions, 11 changer transitions 1/82 dead transitions. [2025-03-14 00:54:08,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 509 flow [2025-03-14 00:54:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:54:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:54:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-03-14 00:54:08,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5427350427350427 [2025-03-14 00:54:08,152 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 212 flow. Second operand 6 states and 127 transitions. [2025-03-14 00:54:08,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 82 transitions, 509 flow [2025-03-14 00:54:08,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 464 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-03-14 00:54:08,159 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 210 flow [2025-03-14 00:54:08,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2025-03-14 00:54:08,160 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2025-03-14 00:54:08,160 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 210 flow [2025-03-14 00:54:08,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:08,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:08,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:08,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:54:08,161 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:08,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1835169665, now seen corresponding path program 1 times [2025-03-14 00:54:08,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:08,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978577278] [2025-03-14 00:54:08,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:08,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:08,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 00:54:08,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 00:54:08,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:08,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:08,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:08,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:08,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978577278] [2025-03-14 00:54:08,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978577278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:08,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:08,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:54:08,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938123781] [2025-03-14 00:54:08,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:08,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:08,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:08,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:08,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:08,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:54:08,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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-03-14 00:54:08,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:08,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:54:08,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:08,538 INFO L124 PetriNetUnfolderBase]: 1329/2084 cut-off events. [2025-03-14 00:54:08,538 INFO L125 PetriNetUnfolderBase]: For 2958/2958 co-relation queries the response was YES. [2025-03-14 00:54:08,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6237 conditions, 2084 events. 1329/2084 cut-off events. For 2958/2958 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9038 event pairs, 315 based on Foata normal form. 8/2091 useless extension candidates. Maximal degree in co-relation 6216. Up to 1148 conditions per place. [2025-03-14 00:54:08,546 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 61 selfloop transitions, 7 changer transitions 27/99 dead transitions. [2025-03-14 00:54:08,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 99 transitions, 649 flow [2025-03-14 00:54:08,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:54:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:54:08,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2025-03-14 00:54:08,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4725274725274725 [2025-03-14 00:54:08,547 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 210 flow. Second operand 7 states and 129 transitions. [2025-03-14 00:54:08,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 99 transitions, 649 flow [2025-03-14 00:54:08,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 99 transitions, 504 flow, removed 28 selfloop flow, removed 10 redundant places. [2025-03-14 00:54:08,555 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 180 flow [2025-03-14 00:54:08,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2025-03-14 00:54:08,556 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2025-03-14 00:54:08,556 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 180 flow [2025-03-14 00:54:08,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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-03-14 00:54:08,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:08,557 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:08,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:54:08,558 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:08,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:08,558 INFO L85 PathProgramCache]: Analyzing trace with hash 576320143, now seen corresponding path program 2 times [2025-03-14 00:54:08,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:08,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513737799] [2025-03-14 00:54:08,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:54:08,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:08,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-14 00:54:08,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 00:54:08,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:54:08,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:08,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:08,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:08,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513737799] [2025-03-14 00:54:08,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513737799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:08,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:08,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 00:54:08,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716097601] [2025-03-14 00:54:08,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:08,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:54:08,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:08,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:54:08,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:54:08,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:54:08,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 180 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:08,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:08,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:54:08,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:08,925 INFO L124 PetriNetUnfolderBase]: 1397/2200 cut-off events. [2025-03-14 00:54:08,925 INFO L125 PetriNetUnfolderBase]: For 1420/1420 co-relation queries the response was YES. [2025-03-14 00:54:08,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5613 conditions, 2200 events. 1397/2200 cut-off events. For 1420/1420 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9667 event pairs, 167 based on Foata normal form. 8/2207 useless extension candidates. Maximal degree in co-relation 5594. Up to 1064 conditions per place. [2025-03-14 00:54:08,932 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 45 selfloop transitions, 3 changer transitions 43/95 dead transitions. [2025-03-14 00:54:08,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 95 transitions, 510 flow [2025-03-14 00:54:08,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 00:54:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 00:54:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2025-03-14 00:54:08,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42948717948717946 [2025-03-14 00:54:08,933 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 180 flow. Second operand 8 states and 134 transitions. [2025-03-14 00:54:08,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 95 transitions, 510 flow [2025-03-14 00:54:08,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 497 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-14 00:54:08,936 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 147 flow [2025-03-14 00:54:08,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=147, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2025-03-14 00:54:08,938 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2025-03-14 00:54:08,938 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 147 flow [2025-03-14 00:54:08,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:08,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:08,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:08,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:54:08,939 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:08,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:08,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1770275875, now seen corresponding path program 3 times [2025-03-14 00:54:08,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:08,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919302034] [2025-03-14 00:54:08,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:54:08,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:08,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-03-14 00:54:08,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 00:54:08,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 00:54:08,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:09,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919302034] [2025-03-14 00:54:09,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919302034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:09,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:09,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:54:09,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654916518] [2025-03-14 00:54:09,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:09,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:09,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:09,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:09,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:09,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:54:09,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 39 transitions, 147 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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-03-14 00:54:09,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:09,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:54:09,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:09,224 INFO L124 PetriNetUnfolderBase]: 569/919 cut-off events. [2025-03-14 00:54:09,224 INFO L125 PetriNetUnfolderBase]: For 628/628 co-relation queries the response was YES. [2025-03-14 00:54:09,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2364 conditions, 919 events. 569/919 cut-off events. For 628/628 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3350 event pairs, 164 based on Foata normal form. 8/926 useless extension candidates. Maximal degree in co-relation 2352. Up to 551 conditions per place. [2025-03-14 00:54:09,227 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 0 selfloop transitions, 0 changer transitions 55/55 dead transitions. [2025-03-14 00:54:09,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 291 flow [2025-03-14 00:54:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:54:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:54:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2025-03-14 00:54:09,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3443223443223443 [2025-03-14 00:54:09,229 INFO L175 Difference]: Start difference. First operand has 64 places, 39 transitions, 147 flow. Second operand 7 states and 94 transitions. [2025-03-14 00:54:09,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 291 flow [2025-03-14 00:54:09,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 268 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-03-14 00:54:09,231 INFO L231 Difference]: Finished difference. Result has 56 places, 0 transitions, 0 flow [2025-03-14 00:54:09,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=56, PETRI_TRANSITIONS=0} [2025-03-14 00:54:09,233 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2025-03-14 00:54:09,233 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 0 transitions, 0 flow [2025-03-14 00:54:09,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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-03-14 00:54:09,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-14 00:54:09,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-14 00:54:09,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-14 00:54:09,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-14 00:54:09,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:54:09,237 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:09,241 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:54:09,241 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:54:09,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:54:09 BasicIcfg [2025-03-14 00:54:09,248 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:54:09,249 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:54:09,249 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:54:09,250 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:54:09,250 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:02" (3/4) ... [2025-03-14 00:54:09,252 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 00:54:09,255 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-14 00:54:09,255 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-14 00:54:09,255 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P2 [2025-03-14 00:54:09,259 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2025-03-14 00:54:09,260 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-14 00:54:09,260 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 00:54:09,260 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 00:54:09,314 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:54:09,314 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:54:09,314 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:54:09,315 INFO L158 Benchmark]: Toolchain (without parser) took 7223.19ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 111.6MB in the beginning and 246.3MB in the end (delta: -134.7MB). Peak memory consumption was 335.0MB. Max. memory is 16.1GB. [2025-03-14 00:54:09,315 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:54:09,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.33ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 91.3MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 00:54:09,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.20ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:54:09,317 INFO L158 Benchmark]: Boogie Preprocessor took 19.34ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 88.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:54:09,317 INFO L158 Benchmark]: IcfgBuilder took 333.83ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 65.8MB in the end (delta: 22.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:54:09,318 INFO L158 Benchmark]: TraceAbstraction took 6421.48ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 65.5MB in the beginning and 250.6MB in the end (delta: -185.1MB). Peak memory consumption was 293.0MB. Max. memory is 16.1GB. [2025-03-14 00:54:09,318 INFO L158 Benchmark]: Witness Printer took 65.15ms. Allocated memory is still 612.4MB. Free memory was 250.6MB in the beginning and 246.3MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:54:09,320 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.50ms. Allocated memory is still 201.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.33ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 91.3MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.20ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.34ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 88.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 333.83ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 65.8MB in the end (delta: 22.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6421.48ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 65.5MB in the beginning and 250.6MB in the end (delta: -185.1MB). Peak memory consumption was 293.0MB. Max. memory is 16.1GB. * Witness Printer took 65.15ms. Allocated memory is still 612.4MB. Free memory was 250.6MB in the beginning and 246.3MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 4 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.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 779 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 773 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1533 IncrementalHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 6 mSDtfsCounter, 1533 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=2, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 902 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 00:54:09,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE