./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe011_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/safe011_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 c5d6625a918041bec3ddf6b8a37ec84fd94f58444755be51392d35f521d3d51e --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:53:03,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:53:03,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:53:03,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:53:03,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:53:03,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:53:03,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:53:03,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:53:03,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:53:03,852 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:53:03,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:53:03,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:53:03,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:53:03,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:53:03,853 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:53:03,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:53:03,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:53:03,854 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:53:03,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:53:03,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:53:03,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:53:03,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:53:03,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:53:03,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:53:03,855 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:53:03,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:53:03,855 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:53:03,855 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:53:03,855 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:53:03,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:53:03,855 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:53:03,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:53:03,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:53:03,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:53:03,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:53:03,855 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:53:03,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:53:03,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:53:03,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:53:03,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:53:03,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:53:03,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:53:03,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:53:03,856 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 -> c5d6625a918041bec3ddf6b8a37ec84fd94f58444755be51392d35f521d3d51e [2025-03-14 00:53:04,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:53:04,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:53:04,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:53:04,094 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:53:04,094 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:53:04,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe011_tso.i [2025-03-14 00:53:05,275 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945033f8a/498e503f453f405f8f88b2150674eff6/FLAG39cb87424 [2025-03-14 00:53:05,588 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:53:05,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_tso.i [2025-03-14 00:53:05,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945033f8a/498e503f453f405f8f88b2150674eff6/FLAG39cb87424 [2025-03-14 00:53:05,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945033f8a/498e503f453f405f8f88b2150674eff6 [2025-03-14 00:53:05,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:53:05,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:53:05,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:53:05,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:53:05,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:53:05,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:53:05" (1/1) ... [2025-03-14 00:53:05,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4a528c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:05, skipping insertion in model container [2025-03-14 00:53:05,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:53:05" (1/1) ... [2025-03-14 00:53:05,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:53:06,001 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/safe011_tso.i[945,958] [2025-03-14 00:53:06,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:53:06,082 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:53:06,090 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/safe011_tso.i[945,958] [2025-03-14 00:53:06,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:53:06,151 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:53:06,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:06 WrapperNode [2025-03-14 00:53:06,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:53:06,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:53:06,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:53:06,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:53:06,157 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:53:06" (1/1) ... [2025-03-14 00:53:06,164 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:53:06" (1/1) ... [2025-03-14 00:53:06,176 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2025-03-14 00:53:06,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:53:06,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:53:06,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:53:06,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:53:06,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:06" (1/1) ... [2025-03-14 00:53:06,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:06" (1/1) ... [2025-03-14 00:53:06,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:06" (1/1) ... [2025-03-14 00:53:06,193 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:53:06,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:06" (1/1) ... [2025-03-14 00:53:06,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:06" (1/1) ... [2025-03-14 00:53:06,197 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:06" (1/1) ... [2025-03-14 00:53:06,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:06" (1/1) ... [2025-03-14 00:53:06,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:06" (1/1) ... [2025-03-14 00:53:06,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:06" (1/1) ... [2025-03-14 00:53:06,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:53:06,203 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:53:06,203 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:53:06,203 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:53:06,204 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:06" (1/1) ... [2025-03-14 00:53:06,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:53:06,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:53:06,228 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:53:06,231 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:53:06,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 00:53:06,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:53:06,247 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-14 00:53:06,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-14 00:53:06,248 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-14 00:53:06,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-14 00:53:06,248 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-14 00:53:06,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-14 00:53:06,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:53:06,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 00:53:06,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:53:06,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:53:06,249 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:53:06,338 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:53:06,340 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:53:06,481 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:53:06,482 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:53:06,483 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:53:06,558 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:53:06,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:53:06 BoogieIcfgContainer [2025-03-14 00:53:06,559 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:53:06,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:53:06,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:53:06,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:53:06,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:53:05" (1/3) ... [2025-03-14 00:53:06,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a17e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:53:06, skipping insertion in model container [2025-03-14 00:53:06,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:53:06" (2/3) ... [2025-03-14 00:53:06,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a17e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:53:06, skipping insertion in model container [2025-03-14 00:53:06,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:53:06" (3/3) ... [2025-03-14 00:53:06,567 INFO L128 eAbstractionObserver]: Analyzing ICFG safe011_tso.i [2025-03-14 00:53:06,577 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:53:06,578 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe011_tso.i that has 4 procedures, 38 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-14 00:53:06,578 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:53:06,626 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:53:06,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 88 flow [2025-03-14 00:53:06,684 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2025-03-14 00:53:06,687 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:53:06,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-14 00:53:06,693 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 38 transitions, 88 flow [2025-03-14 00:53:06,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2025-03-14 00:53:06,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:53:06,714 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;@d48af63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:53:06,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 00:53:06,721 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:53:06,722 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-14 00:53:06,722 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:53:06,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:06,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:53:06,723 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:53:06,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:06,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2002080932, now seen corresponding path program 1 times [2025-03-14 00:53:06,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:06,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216316337] [2025-03-14 00:53:06,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:06,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:06,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:53:06,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:53:06,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:06,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:07,158 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:53:07,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:07,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216316337] [2025-03-14 00:53:07,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216316337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:07,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:07,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:53:07,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058137695] [2025-03-14 00:53:07,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:07,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:53:07,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:07,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:53:07,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:53:07,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:53:07,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 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:53:07,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:07,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:53:07,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:08,328 INFO L124 PetriNetUnfolderBase]: 8917/13086 cut-off events. [2025-03-14 00:53:08,328 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-03-14 00:53:08,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26096 conditions, 13086 events. 8917/13086 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 77399 event pairs, 2557 based on Foata normal form. 384/13462 useless extension candidates. Maximal degree in co-relation 26085. Up to 5385 conditions per place. [2025-03-14 00:53:08,398 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 47 selfloop transitions, 6 changer transitions 63/120 dead transitions. [2025-03-14 00:53:08,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 120 transitions, 487 flow [2025-03-14 00:53:08,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:53:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:53:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2025-03-14 00:53:08,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6278195488721805 [2025-03-14 00:53:08,411 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 7 states and 167 transitions. [2025-03-14 00:53:08,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 120 transitions, 487 flow [2025-03-14 00:53:08,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 120 transitions, 482 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 00:53:08,422 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 144 flow [2025-03-14 00:53:08,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=144, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2025-03-14 00:53:08,427 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2025-03-14 00:53:08,427 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 144 flow [2025-03-14 00:53:08,428 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:53:08,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:08,428 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:53:08,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:53:08,428 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:53:08,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:08,429 INFO L85 PathProgramCache]: Analyzing trace with hash 273773789, now seen corresponding path program 1 times [2025-03-14 00:53:08,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:08,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890211893] [2025-03-14 00:53:08,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:08,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:08,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 00:53:08,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 00:53:08,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:08,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:08,638 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:53:08,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:08,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890211893] [2025-03-14 00:53:08,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890211893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:08,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:08,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:53:08,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412338784] [2025-03-14 00:53:08,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:08,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:08,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:08,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:08,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:08,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:53:08,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 144 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:53:08,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:08,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:53:08,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:09,555 INFO L124 PetriNetUnfolderBase]: 8527/12597 cut-off events. [2025-03-14 00:53:09,556 INFO L125 PetriNetUnfolderBase]: For 11692/11697 co-relation queries the response was YES. [2025-03-14 00:53:09,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33915 conditions, 12597 events. 8527/12597 cut-off events. For 11692/11697 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 75227 event pairs, 1237 based on Foata normal form. 382/12977 useless extension candidates. Maximal degree in co-relation 33899. Up to 5165 conditions per place. [2025-03-14 00:53:09,617 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 61 selfloop transitions, 10 changer transitions 86/161 dead transitions. [2025-03-14 00:53:09,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 161 transitions, 958 flow [2025-03-14 00:53:09,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:53:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:53:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 220 transitions. [2025-03-14 00:53:09,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2025-03-14 00:53:09,619 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 144 flow. Second operand 10 states and 220 transitions. [2025-03-14 00:53:09,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 161 transitions, 958 flow [2025-03-14 00:53:09,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 161 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:53:09,660 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 252 flow [2025-03-14 00:53:09,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=252, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2025-03-14 00:53:09,662 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2025-03-14 00:53:09,662 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 252 flow [2025-03-14 00:53:09,662 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:53:09,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:09,662 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:53:09,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:53:09,662 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:53:09,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:09,664 INFO L85 PathProgramCache]: Analyzing trace with hash 451089821, now seen corresponding path program 1 times [2025-03-14 00:53:09,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:09,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032293187] [2025-03-14 00:53:09,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:09,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:09,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 00:53:09,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 00:53:09,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:09,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:09,778 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:53:09,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:09,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032293187] [2025-03-14 00:53:09,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032293187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:09,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:09,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:53:09,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553637253] [2025-03-14 00:53:09,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:09,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:09,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:09,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:09,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:09,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:53:09,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 252 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:53:09,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:09,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:53:09,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:10,603 INFO L124 PetriNetUnfolderBase]: 7646/11264 cut-off events. [2025-03-14 00:53:10,603 INFO L125 PetriNetUnfolderBase]: For 28307/28316 co-relation queries the response was YES. [2025-03-14 00:53:10,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34848 conditions, 11264 events. 7646/11264 cut-off events. For 28307/28316 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 63347 event pairs, 893 based on Foata normal form. 242/11503 useless extension candidates. Maximal degree in co-relation 34823. Up to 4337 conditions per place. [2025-03-14 00:53:10,673 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 62 selfloop transitions, 12 changer transitions 78/156 dead transitions. [2025-03-14 00:53:10,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 156 transitions, 1014 flow [2025-03-14 00:53:10,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:53:10,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:53:10,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 211 transitions. [2025-03-14 00:53:10,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5552631578947368 [2025-03-14 00:53:10,675 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 252 flow. Second operand 10 states and 211 transitions. [2025-03-14 00:53:10,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 156 transitions, 1014 flow [2025-03-14 00:53:10,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 156 transitions, 982 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-03-14 00:53:10,770 INFO L231 Difference]: Finished difference. Result has 75 places, 49 transitions, 358 flow [2025-03-14 00:53:10,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=358, PETRI_PLACES=75, PETRI_TRANSITIONS=49} [2025-03-14 00:53:10,771 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2025-03-14 00:53:10,771 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 49 transitions, 358 flow [2025-03-14 00:53:10,771 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:53:10,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:10,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:53:10,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:53:10,771 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:53:10,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:10,772 INFO L85 PathProgramCache]: Analyzing trace with hash 790837896, now seen corresponding path program 1 times [2025-03-14 00:53:10,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:10,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160018863] [2025-03-14 00:53:10,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:10,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:10,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:53:10,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 00:53:10,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:10,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:10,916 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:53:10,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:10,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160018863] [2025-03-14 00:53:10,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160018863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:10,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:10,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:53:10,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179115213] [2025-03-14 00:53:10,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:10,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:10,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:10,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:10,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:10,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:53:10,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 49 transitions, 358 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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:53:10,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:10,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:53:10,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:11,682 INFO L124 PetriNetUnfolderBase]: 7154/10547 cut-off events. [2025-03-14 00:53:11,682 INFO L125 PetriNetUnfolderBase]: For 39105/39105 co-relation queries the response was YES. [2025-03-14 00:53:11,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35417 conditions, 10547 events. 7154/10547 cut-off events. For 39105/39105 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 59948 event pairs, 1211 based on Foata normal form. 170/10716 useless extension candidates. Maximal degree in co-relation 35381. Up to 4638 conditions per place. [2025-03-14 00:53:11,733 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 65 selfloop transitions, 17 changer transitions 60/146 dead transitions. [2025-03-14 00:53:11,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 146 transitions, 1086 flow [2025-03-14 00:53:11,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:53:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:53:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions. [2025-03-14 00:53:11,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.531578947368421 [2025-03-14 00:53:11,738 INFO L175 Difference]: Start difference. First operand has 75 places, 49 transitions, 358 flow. Second operand 10 states and 202 transitions. [2025-03-14 00:53:11,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 146 transitions, 1086 flow [2025-03-14 00:53:12,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 146 transitions, 1019 flow, removed 31 selfloop flow, removed 9 redundant places. [2025-03-14 00:53:12,009 INFO L231 Difference]: Finished difference. Result has 76 places, 52 transitions, 415 flow [2025-03-14 00:53:12,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=415, PETRI_PLACES=76, PETRI_TRANSITIONS=52} [2025-03-14 00:53:12,011 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2025-03-14 00:53:12,011 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 52 transitions, 415 flow [2025-03-14 00:53:12,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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:53:12,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:12,012 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:53:12,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:53:12,012 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:53:12,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:12,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1068449322, now seen corresponding path program 1 times [2025-03-14 00:53:12,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:12,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644183330] [2025-03-14 00:53:12,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:12,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:12,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 00:53:12,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 00:53:12,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:12,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:12,119 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:53:12,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:12,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644183330] [2025-03-14 00:53:12,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644183330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:12,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:12,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:53:12,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330617153] [2025-03-14 00:53:12,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:12,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:53:12,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:12,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:53:12,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:53:12,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:53:12,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 52 transitions, 415 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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:53:12,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:12,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:53:12,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:13,006 INFO L124 PetriNetUnfolderBase]: 9031/13467 cut-off events. [2025-03-14 00:53:13,006 INFO L125 PetriNetUnfolderBase]: For 51865/51881 co-relation queries the response was YES. [2025-03-14 00:53:13,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44426 conditions, 13467 events. 9031/13467 cut-off events. For 51865/51881 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 79912 event pairs, 3951 based on Foata normal form. 310/13775 useless extension candidates. Maximal degree in co-relation 44390. Up to 7412 conditions per place. [2025-03-14 00:53:13,127 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 60 selfloop transitions, 8 changer transitions 52/124 dead transitions. [2025-03-14 00:53:13,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 124 transitions, 967 flow [2025-03-14 00:53:13,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:53:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:53:13,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2025-03-14 00:53:13,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5676691729323309 [2025-03-14 00:53:13,136 INFO L175 Difference]: Start difference. First operand has 76 places, 52 transitions, 415 flow. Second operand 7 states and 151 transitions. [2025-03-14 00:53:13,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 124 transitions, 967 flow [2025-03-14 00:53:13,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 124 transitions, 896 flow, removed 25 selfloop flow, removed 9 redundant places. [2025-03-14 00:53:13,215 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 402 flow [2025-03-14 00:53:13,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2025-03-14 00:53:13,216 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2025-03-14 00:53:13,217 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 402 flow [2025-03-14 00:53:13,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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:53:13,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:13,217 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:53:13,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:53:13,220 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:53:13,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:13,221 INFO L85 PathProgramCache]: Analyzing trace with hash 21283482, now seen corresponding path program 1 times [2025-03-14 00:53:13,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:13,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441276919] [2025-03-14 00:53:13,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:13,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:13,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 00:53:13,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 00:53:13,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:13,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:13,338 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:53:13,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:13,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441276919] [2025-03-14 00:53:13,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441276919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:13,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:13,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:53:13,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133674981] [2025-03-14 00:53:13,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:13,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:13,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:13,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:13,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:13,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:53:13,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 402 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:53:13,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:13,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:53:13,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:14,416 INFO L124 PetriNetUnfolderBase]: 10978/16209 cut-off events. [2025-03-14 00:53:14,416 INFO L125 PetriNetUnfolderBase]: For 48937/48937 co-relation queries the response was YES. [2025-03-14 00:53:14,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49460 conditions, 16209 events. 10978/16209 cut-off events. For 48937/48937 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 97371 event pairs, 1587 based on Foata normal form. 300/16506 useless extension candidates. Maximal degree in co-relation 49426. Up to 7298 conditions per place. [2025-03-14 00:53:14,467 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 64 selfloop transitions, 17 changer transitions 68/153 dead transitions. [2025-03-14 00:53:14,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 153 transitions, 1088 flow [2025-03-14 00:53:14,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:53:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:53:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions. [2025-03-14 00:53:14,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5473684210526316 [2025-03-14 00:53:14,468 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 402 flow. Second operand 10 states and 208 transitions. [2025-03-14 00:53:14,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 153 transitions, 1088 flow [2025-03-14 00:53:14,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 153 transitions, 1026 flow, removed 24 selfloop flow, removed 6 redundant places. [2025-03-14 00:53:14,610 INFO L231 Difference]: Finished difference. Result has 78 places, 49 transitions, 412 flow [2025-03-14 00:53:14,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=412, PETRI_PLACES=78, PETRI_TRANSITIONS=49} [2025-03-14 00:53:14,611 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2025-03-14 00:53:14,611 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 49 transitions, 412 flow [2025-03-14 00:53:14,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:53:14,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:14,611 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] [2025-03-14 00:53:14,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:53:14,611 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:53:14,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:14,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1283267587, now seen corresponding path program 1 times [2025-03-14 00:53:14,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:14,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321651065] [2025-03-14 00:53:14,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:14,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:14,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 00:53:14,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 00:53:14,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:14,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:14,701 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:53:14,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:14,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321651065] [2025-03-14 00:53:14,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321651065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:14,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:14,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:53:14,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799768164] [2025-03-14 00:53:14,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:14,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:14,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:14,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:14,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:14,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-03-14 00:53:14,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 49 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:53:14,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:14,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-03-14 00:53:14,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:15,801 INFO L124 PetriNetUnfolderBase]: 12158/18182 cut-off events. [2025-03-14 00:53:15,801 INFO L125 PetriNetUnfolderBase]: For 64253/64262 co-relation queries the response was YES. [2025-03-14 00:53:15,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55292 conditions, 18182 events. 12158/18182 cut-off events. For 64253/64262 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 114841 event pairs, 2529 based on Foata normal form. 407/18586 useless extension candidates. Maximal degree in co-relation 55255. Up to 6876 conditions per place. [2025-03-14 00:53:15,911 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 54 selfloop transitions, 3 changer transitions 81/142 dead transitions. [2025-03-14 00:53:15,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 142 transitions, 1320 flow [2025-03-14 00:53:15,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 00:53:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 00:53:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2025-03-14 00:53:15,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5328947368421053 [2025-03-14 00:53:15,913 INFO L175 Difference]: Start difference. First operand has 78 places, 49 transitions, 412 flow. Second operand 8 states and 162 transitions. [2025-03-14 00:53:15,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 142 transitions, 1320 flow [2025-03-14 00:53:16,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 142 transitions, 1250 flow, removed 35 selfloop flow, removed 7 redundant places. [2025-03-14 00:53:16,075 INFO L231 Difference]: Finished difference. Result has 78 places, 40 transitions, 288 flow [2025-03-14 00:53:16,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=288, PETRI_PLACES=78, PETRI_TRANSITIONS=40} [2025-03-14 00:53:16,076 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2025-03-14 00:53:16,076 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 40 transitions, 288 flow [2025-03-14 00:53:16,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:53:16,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:16,076 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:53:16,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:53:16,076 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:53:16,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:16,077 INFO L85 PathProgramCache]: Analyzing trace with hash 2132325499, now seen corresponding path program 1 times [2025-03-14 00:53:16,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:16,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329793625] [2025-03-14 00:53:16,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:16,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:16,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 00:53:16,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 00:53:16,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:16,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:16,239 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:53:16,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:16,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329793625] [2025-03-14 00:53:16,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329793625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:16,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:16,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:53:16,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87061111] [2025-03-14 00:53:16,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:16,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:53:16,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:16,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:53:16,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:53:16,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-14 00:53:16,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 40 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:53:16,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:16,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-14 00:53:16,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:16,528 INFO L124 PetriNetUnfolderBase]: 4002/6480 cut-off events. [2025-03-14 00:53:16,528 INFO L125 PetriNetUnfolderBase]: For 18393/18399 co-relation queries the response was YES. [2025-03-14 00:53:16,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18782 conditions, 6480 events. 4002/6480 cut-off events. For 18393/18399 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 39462 event pairs, 753 based on Foata normal form. 317/6795 useless extension candidates. Maximal degree in co-relation 18744. Up to 3347 conditions per place. [2025-03-14 00:53:16,552 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 62 selfloop transitions, 5 changer transitions 9/81 dead transitions. [2025-03-14 00:53:16,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 81 transitions, 752 flow [2025-03-14 00:53:16,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:53:16,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:53:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-03-14 00:53:16,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6447368421052632 [2025-03-14 00:53:16,553 INFO L175 Difference]: Start difference. First operand has 78 places, 40 transitions, 288 flow. Second operand 4 states and 98 transitions. [2025-03-14 00:53:16,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 81 transitions, 752 flow [2025-03-14 00:53:16,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 559 flow, removed 24 selfloop flow, removed 18 redundant places. [2025-03-14 00:53:16,570 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 231 flow [2025-03-14 00:53:16,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2025-03-14 00:53:16,570 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2025-03-14 00:53:16,570 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 231 flow [2025-03-14 00:53:16,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:53:16,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:16,570 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] [2025-03-14 00:53:16,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:53:16,571 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:53:16,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:16,571 INFO L85 PathProgramCache]: Analyzing trace with hash -665297604, now seen corresponding path program 1 times [2025-03-14 00:53:16,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:16,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591145295] [2025-03-14 00:53:16,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:16,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:16,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 00:53:16,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 00:53:16,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:16,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:16,675 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:53:16,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:16,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591145295] [2025-03-14 00:53:16,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591145295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:16,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:16,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:53:16,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602705955] [2025-03-14 00:53:16,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:16,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:53:16,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:16,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:53:16,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:53:16,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-14 00:53:16,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:53:16,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:16,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-14 00:53:16,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:16,870 INFO L124 PetriNetUnfolderBase]: 2499/3997 cut-off events. [2025-03-14 00:53:16,870 INFO L125 PetriNetUnfolderBase]: For 4841/4847 co-relation queries the response was YES. [2025-03-14 00:53:16,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11257 conditions, 3997 events. 2499/3997 cut-off events. For 4841/4847 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 21276 event pairs, 325 based on Foata normal form. 253/4248 useless extension candidates. Maximal degree in co-relation 11231. Up to 1237 conditions per place. [2025-03-14 00:53:16,880 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 56 selfloop transitions, 8 changer transitions 26/95 dead transitions. [2025-03-14 00:53:16,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 95 transitions, 680 flow [2025-03-14 00:53:16,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:53:16,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:53:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-03-14 00:53:16,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6368421052631579 [2025-03-14 00:53:16,881 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 231 flow. Second operand 5 states and 121 transitions. [2025-03-14 00:53:16,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 95 transitions, 680 flow [2025-03-14 00:53:16,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 647 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-14 00:53:16,888 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 220 flow [2025-03-14 00:53:16,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2025-03-14 00:53:16,888 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2025-03-14 00:53:16,889 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 220 flow [2025-03-14 00:53:16,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:53:16,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:53:16,889 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:53:16,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:53:16,889 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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:53:16,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:53:16,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1421974649, now seen corresponding path program 1 times [2025-03-14 00:53:16,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:53:16,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986736253] [2025-03-14 00:53:16,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:53:16,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:53:16,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 00:53:16,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 00:53:16,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:53:16,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:53:16,961 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:53:16,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:53:16,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986736253] [2025-03-14 00:53:16,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986736253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:53:16,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:53:16,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:53:16,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850258638] [2025-03-14 00:53:16,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:53:16,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:53:16,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:53:16,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:53:16,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:53:16,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-14 00:53:16,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 41 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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:53:16,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:53:16,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-14 00:53:16,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:53:17,174 INFO L124 PetriNetUnfolderBase]: 1034/1667 cut-off events. [2025-03-14 00:53:17,174 INFO L125 PetriNetUnfolderBase]: For 2552/2557 co-relation queries the response was YES. [2025-03-14 00:53:17,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5040 conditions, 1667 events. 1034/1667 cut-off events. For 2552/2557 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7529 event pairs, 170 based on Foata normal form. 81/1747 useless extension candidates. Maximal degree in co-relation 5026. Up to 592 conditions per place. [2025-03-14 00:53:17,178 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 0 selfloop transitions, 0 changer transitions 73/73 dead transitions. [2025-03-14 00:53:17,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 73 transitions, 490 flow [2025-03-14 00:53:17,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:53:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:53:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2025-03-14 00:53:17,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5307017543859649 [2025-03-14 00:53:17,180 INFO L175 Difference]: Start difference. First operand has 63 places, 41 transitions, 220 flow. Second operand 6 states and 121 transitions. [2025-03-14 00:53:17,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 73 transitions, 490 flow [2025-03-14 00:53:17,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 418 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-03-14 00:53:17,184 INFO L231 Difference]: Finished difference. Result has 56 places, 0 transitions, 0 flow [2025-03-14 00:53:17,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=6, PETRI_FLOW=0, PETRI_PLACES=56, PETRI_TRANSITIONS=0} [2025-03-14 00:53:17,185 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2025-03-14 00:53:17,185 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 0 transitions, 0 flow [2025-03-14 00:53:17,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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:53:17,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-14 00:53:17,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-14 00:53:17,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-14 00:53:17,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-14 00:53:17,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 00:53:17,190 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:53:17,192 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:53:17,192 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:53:17,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:53:17 BasicIcfg [2025-03-14 00:53:17,196 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:53:17,197 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:53:17,197 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:53:17,197 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:53:17,197 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:53:06" (3/4) ... [2025-03-14 00:53:17,199 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 00:53:17,204 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-14 00:53:17,204 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-14 00:53:17,204 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P2 [2025-03-14 00:53:17,207 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2025-03-14 00:53:17,207 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-14 00:53:17,207 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 00:53:17,207 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 00:53:17,257 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:53:17,258 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:53:17,258 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:53:17,258 INFO L158 Benchmark]: Toolchain (without parser) took 11402.32ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 128.5MB in the beginning and 604.0MB in the end (delta: -475.5MB). Peak memory consumption was 393.4MB. Max. memory is 16.1GB. [2025-03-14 00:53:17,258 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:53:17,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.38ms. Allocated memory is still 167.8MB. Free memory was 128.5MB in the beginning and 108.3MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 00:53:17,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.09ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 106.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:53:17,259 INFO L158 Benchmark]: Boogie Preprocessor took 24.16ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 104.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:53:17,259 INFO L158 Benchmark]: IcfgBuilder took 355.84ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 83.7MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 00:53:17,259 INFO L158 Benchmark]: TraceAbstraction took 10635.99ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 83.2MB in the beginning and 608.2MB in the end (delta: -524.9MB). Peak memory consumption was 741.6MB. Max. memory is 16.1GB. [2025-03-14 00:53:17,259 INFO L158 Benchmark]: Witness Printer took 60.97ms. Allocated memory is still 1.0GB. Free memory was 608.2MB in the beginning and 604.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:53:17,260 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.38ms. Allocated memory is still 167.8MB. Free memory was 128.5MB in the beginning and 108.3MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.09ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 106.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.16ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 104.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 355.84ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 83.7MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10635.99ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 83.2MB in the beginning and 608.2MB in the end (delta: -524.9MB). Peak memory consumption was 741.6MB. Max. memory is 16.1GB. * Witness Printer took 60.97ms. Allocated memory is still 1.0GB. Free memory was 608.2MB in the beginning and 604.0MB in the end (delta: 4.2MB). There was no memory consumed. 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, 62 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: 10.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 846 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 838 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1872 IncrementalHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 10 mSDtfsCounter, 1872 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=415occurred in iteration=4, InterpolantAutomatonStates: 77, 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, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 686 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:53:17,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE