./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe035_power.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe035_power.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 6415bffc70cf05f8f6460106962f2f9c59b321fd2fc94a45894cc3c1f3d85b66 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:11:47,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:11:47,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:11:47,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:11:47,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:11:47,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:11:47,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:11:47,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:11:47,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:11:47,826 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:11:47,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:11:47,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:11:47,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:11:47,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:11:47,826 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:11:47,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:11:47,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:11:47,826 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:11:47,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:11:47,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:11:47,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:11:47,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:11:47,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:11:47,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:11:47,827 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:11:47,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:11:47,827 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:11:47,827 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:11:47,827 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:11:47,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:11:47,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:11:47,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:11:47,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:11:47,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:11:47,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:11:47,830 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:11:47,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:11:47,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:11:47,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:11:47,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:11:47,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:11:47,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:11:47,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:11:47,831 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 -> 6415bffc70cf05f8f6460106962f2f9c59b321fd2fc94a45894cc3c1f3d85b66 [2025-03-04 02:11:48,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:11:48,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:11:48,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:11:48,073 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:11:48,073 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:11:48,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe035_power.i [2025-03-04 02:11:49,199 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50859e2fc/40883baa64b04634974ab21794a88528/FLAGa1f53ace1 [2025-03-04 02:11:49,500 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:11:49,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe035_power.i [2025-03-04 02:11:49,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50859e2fc/40883baa64b04634974ab21794a88528/FLAGa1f53ace1 [2025-03-04 02:11:49,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50859e2fc/40883baa64b04634974ab21794a88528 [2025-03-04 02:11:49,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:11:49,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:11:49,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:11:49,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:11:49,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:11:49,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:11:49" (1/1) ... [2025-03-04 02:11:49,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27738ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:49, skipping insertion in model container [2025-03-04 02:11:49,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:11:49" (1/1) ... [2025-03-04 02:11:49,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:11:49,709 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/safe035_power.i[947,960] [2025-03-04 02:11:49,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:11:49,861 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:11:49,868 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/safe035_power.i[947,960] [2025-03-04 02:11:49,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:11:49,939 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:11:49,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:49 WrapperNode [2025-03-04 02:11:49,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:11:49,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:11:49,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:11:49,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:11:49,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:49" (1/1) ... [2025-03-04 02:11:49,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:49" (1/1) ... [2025-03-04 02:11:50,000 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2025-03-04 02:11:50,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:11:50,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:11:50,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:11:50,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:11:50,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:49" (1/1) ... [2025-03-04 02:11:50,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:49" (1/1) ... [2025-03-04 02:11:50,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:49" (1/1) ... [2025-03-04 02:11:50,038 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:11:50,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:49" (1/1) ... [2025-03-04 02:11:50,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:49" (1/1) ... [2025-03-04 02:11:50,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:49" (1/1) ... [2025-03-04 02:11:50,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:49" (1/1) ... [2025-03-04 02:11:50,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:49" (1/1) ... [2025-03-04 02:11:50,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:49" (1/1) ... [2025-03-04 02:11:50,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:11:50,069 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:11:50,070 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:11:50,070 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:11:50,071 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:49" (1/1) ... [2025-03-04 02:11:50,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:11:50,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:11:50,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:11:50,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:11:50,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:11:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:11:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 02:11:50,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 02:11:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 02:11:50,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 02:11:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 02:11:50,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 02:11:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:11:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:11:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:11:50,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:11:50,124 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:11:50,245 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:11:50,247 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:11:50,641 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:11:50,642 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:11:50,910 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:11:50,911 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:11:50,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:11:50 BoogieIcfgContainer [2025-03-04 02:11:50,912 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:11:50,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:11:50,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:11:50,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:11:50,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:11:49" (1/3) ... [2025-03-04 02:11:50,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f6a164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:11:50, skipping insertion in model container [2025-03-04 02:11:50,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:49" (2/3) ... [2025-03-04 02:11:50,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f6a164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:11:50, skipping insertion in model container [2025-03-04 02:11:50,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:11:50" (3/3) ... [2025-03-04 02:11:50,920 INFO L128 eAbstractionObserver]: Analyzing ICFG safe035_power.i [2025-03-04 02:11:50,931 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:11:50,933 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe035_power.i that has 4 procedures, 42 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-04 02:11:50,935 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:11:51,009 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:11:51,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 96 flow [2025-03-04 02:11:51,062 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2025-03-04 02:11:51,065 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:11:51,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 1/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2025-03-04 02:11:51,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 96 flow [2025-03-04 02:11:51,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 39 transitions, 87 flow [2025-03-04 02:11:51,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:11:51,082 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;@2802bff3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:11:51,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 02:11:51,091 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:11:51,091 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-03-04 02:11:51,091 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:11:51,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:51,092 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:51,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:51,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:51,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1231877584, now seen corresponding path program 1 times [2025-03-04 02:11:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:51,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286906902] [2025-03-04 02:11:51,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:51,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:51,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:11:51,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:11:51,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:51,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:11:51,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:51,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286906902] [2025-03-04 02:11:51,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286906902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:51,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:51,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 02:11:51,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268725900] [2025-03-04 02:11:51,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:51,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:11:51,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:51,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:11:51,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:11:51,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-04 02:11:51,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:51,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:51,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-04 02:11:51,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:52,811 INFO L124 PetriNetUnfolderBase]: 6894/9909 cut-off events. [2025-03-04 02:11:52,811 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 02:11:52,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19779 conditions, 9909 events. 6894/9909 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 53635 event pairs, 804 based on Foata normal form. 343/10190 useless extension candidates. Maximal degree in co-relation 19768. Up to 8443 conditions per place. [2025-03-04 02:11:52,852 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 46 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2025-03-04 02:11:52,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 221 flow [2025-03-04 02:11:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:11:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:11:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-03-04 02:11:52,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2025-03-04 02:11:52,861 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 80 transitions. [2025-03-04 02:11:52,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 221 flow [2025-03-04 02:11:52,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 218 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:11:52,867 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2025-03-04 02:11:52,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-03-04 02:11:52,874 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2025-03-04 02:11:52,874 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2025-03-04 02:11:52,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:52,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:52,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:52,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:11:52,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:52,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:52,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1841974509, now seen corresponding path program 1 times [2025-03-04 02:11:52,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:52,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788807018] [2025-03-04 02:11:52,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:52,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:52,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:11:52,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:11:52,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:52,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:53,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:11:53,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:53,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788807018] [2025-03-04 02:11:53,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788807018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:53,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:53,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:11:53,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088709204] [2025-03-04 02:11:53,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:53,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:11:53,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:53,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:11:53,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:11:53,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-04 02:11:53,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-04 02:11:53,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:53,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-04 02:11:53,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:53,876 INFO L124 PetriNetUnfolderBase]: 4801/7698 cut-off events. [2025-03-04 02:11:53,877 INFO L125 PetriNetUnfolderBase]: For 267/267 co-relation queries the response was YES. [2025-03-04 02:11:53,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15116 conditions, 7698 events. 4801/7698 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 47257 event pairs, 994 based on Foata normal form. 343/7810 useless extension candidates. Maximal degree in co-relation 15106. Up to 3626 conditions per place. [2025-03-04 02:11:53,913 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 63 selfloop transitions, 5 changer transitions 1/75 dead transitions. [2025-03-04 02:11:53,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 75 transitions, 306 flow [2025-03-04 02:11:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:11:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:11:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-03-04 02:11:53,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6369047619047619 [2025-03-04 02:11:53,914 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 107 transitions. [2025-03-04 02:11:53,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 75 transitions, 306 flow [2025-03-04 02:11:53,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 75 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:11:53,917 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow [2025-03-04 02:11:53,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2025-03-04 02:11:53,918 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2025-03-04 02:11:53,918 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow [2025-03-04 02:11:53,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-04 02:11:53,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:53,919 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-04 02:11:53,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:11:53,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:53,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:53,919 INFO L85 PathProgramCache]: Analyzing trace with hash -596810666, now seen corresponding path program 1 times [2025-03-04 02:11:53,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:53,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560042904] [2025-03-04 02:11:53,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:53,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:53,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:11:54,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:11:54,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:54,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:11:54,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:54,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560042904] [2025-03-04 02:11:54,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560042904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:54,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:54,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:11:54,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673426040] [2025-03-04 02:11:54,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:54,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:11:54,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:54,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:11:54,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:11:54,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-04 02:11:54,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:54,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:54,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-04 02:11:54,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:54,913 INFO L124 PetriNetUnfolderBase]: 2701/4273 cut-off events. [2025-03-04 02:11:54,913 INFO L125 PetriNetUnfolderBase]: For 785/785 co-relation queries the response was YES. [2025-03-04 02:11:54,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9651 conditions, 4273 events. 2701/4273 cut-off events. For 785/785 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 22255 event pairs, 651 based on Foata normal form. 218/4410 useless extension candidates. Maximal degree in co-relation 9639. Up to 1515 conditions per place. [2025-03-04 02:11:54,937 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 81 selfloop transitions, 8 changer transitions 1/96 dead transitions. [2025-03-04 02:11:54,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 96 transitions, 427 flow [2025-03-04 02:11:54,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:11:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:11:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-03-04 02:11:54,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6523809523809524 [2025-03-04 02:11:54,940 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 137 transitions. [2025-03-04 02:11:54,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 96 transitions, 427 flow [2025-03-04 02:11:54,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 96 transitions, 417 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 02:11:54,945 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow [2025-03-04 02:11:54,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2025-03-04 02:11:54,945 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2025-03-04 02:11:54,945 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow [2025-03-04 02:11:54,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:54,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:54,946 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-04 02:11:54,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:11:54,946 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:54,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1876170389, now seen corresponding path program 1 times [2025-03-04 02:11:54,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:54,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763578258] [2025-03-04 02:11:54,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:54,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:54,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:11:55,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:11:55,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:55,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:11:55,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:55,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763578258] [2025-03-04 02:11:55,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763578258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:55,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:55,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:11:55,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168791339] [2025-03-04 02:11:55,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:55,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:11:55,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:55,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:11:55,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:11:55,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-04 02:11:55,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:55,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:55,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-04 02:11:55,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:55,698 INFO L124 PetriNetUnfolderBase]: 1786/2728 cut-off events. [2025-03-04 02:11:55,699 INFO L125 PetriNetUnfolderBase]: For 1492/1492 co-relation queries the response was YES. [2025-03-04 02:11:55,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6675 conditions, 2728 events. 1786/2728 cut-off events. For 1492/1492 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 12554 event pairs, 594 based on Foata normal form. 68/2775 useless extension candidates. Maximal degree in co-relation 6661. Up to 1050 conditions per place. [2025-03-04 02:11:55,708 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 67 selfloop transitions, 11 changer transitions 1/85 dead transitions. [2025-03-04 02:11:55,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 406 flow [2025-03-04 02:11:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:11:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:11:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-03-04 02:11:55,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-03-04 02:11:55,710 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 135 transitions. [2025-03-04 02:11:55,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 406 flow [2025-03-04 02:11:55,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 85 transitions, 381 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 02:11:55,722 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2025-03-04 02:11:55,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2025-03-04 02:11:55,723 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2025-03-04 02:11:55,723 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2025-03-04 02:11:55,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:55,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:55,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:55,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:11:55,723 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:55,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:55,724 INFO L85 PathProgramCache]: Analyzing trace with hash 348117869, now seen corresponding path program 1 times [2025-03-04 02:11:55,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:55,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776432085] [2025-03-04 02:11:55,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:55,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:55,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 02:11:55,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:11:55,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:55,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:11:56,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:56,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776432085] [2025-03-04 02:11:56,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776432085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:56,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:56,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:11:56,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58716379] [2025-03-04 02:11:56,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:56,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:11:56,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:56,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:11:56,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:11:56,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:11:56,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:56,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:56,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:11:56,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:11:56,763 INFO L124 PetriNetUnfolderBase]: 2462/3764 cut-off events. [2025-03-04 02:11:56,764 INFO L125 PetriNetUnfolderBase]: For 2424/2424 co-relation queries the response was YES. [2025-03-04 02:11:56,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9408 conditions, 3764 events. 2462/3764 cut-off events. For 2424/2424 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 18543 event pairs, 220 based on Foata normal form. 8/3764 useless extension candidates. Maximal degree in co-relation 9393. Up to 2154 conditions per place. [2025-03-04 02:11:56,776 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 50 selfloop transitions, 1 changer transitions 37/93 dead transitions. [2025-03-04 02:11:56,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 544 flow [2025-03-04 02:11:56,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:11:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:11:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2025-03-04 02:11:56,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2025-03-04 02:11:56,780 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 6 states and 123 transitions. [2025-03-04 02:11:56,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 544 flow [2025-03-04 02:11:56,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 93 transitions, 419 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-04 02:11:56,792 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 121 flow [2025-03-04 02:11:56,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2025-03-04 02:11:56,794 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2025-03-04 02:11:56,795 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 121 flow [2025-03-04 02:11:56,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:11:56,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:56,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:56,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:11:56,795 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:11:56,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1706679815, now seen corresponding path program 2 times [2025-03-04 02:11:56,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:56,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782375578] [2025-03-04 02:11:56,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:11:56,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:56,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-03-04 02:11:57,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:11:57,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:11:57,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:00,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:00,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782375578] [2025-03-04 02:12:00,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782375578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:00,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:00,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 02:12:00,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109491145] [2025-03-04 02:12:00,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:00,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:12:00,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:00,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:12:00,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:12:00,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:12:00,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 121 flow. Second operand has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:00,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:00,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:12:00,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:01,605 INFO L124 PetriNetUnfolderBase]: 3510/5463 cut-off events. [2025-03-04 02:12:01,606 INFO L125 PetriNetUnfolderBase]: For 987/987 co-relation queries the response was YES. [2025-03-04 02:12:01,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12096 conditions, 5463 events. 3510/5463 cut-off events. For 987/987 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 29179 event pairs, 512 based on Foata normal form. 16/5468 useless extension candidates. Maximal degree in co-relation 12082. Up to 1421 conditions per place. [2025-03-04 02:12:01,615 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 43 selfloop transitions, 9 changer transitions 164/221 dead transitions. [2025-03-04 02:12:01,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 221 transitions, 1053 flow [2025-03-04 02:12:01,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:12:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:12:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 320 transitions. [2025-03-04 02:12:01,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4481792717086835 [2025-03-04 02:12:01,617 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 121 flow. Second operand 17 states and 320 transitions. [2025-03-04 02:12:01,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 221 transitions, 1053 flow [2025-03-04 02:12:01,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 221 transitions, 1032 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-04 02:12:01,622 INFO L231 Difference]: Finished difference. Result has 75 places, 47 transitions, 188 flow [2025-03-04 02:12:01,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=188, PETRI_PLACES=75, PETRI_TRANSITIONS=47} [2025-03-04 02:12:01,623 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 27 predicate places. [2025-03-04 02:12:01,624 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 47 transitions, 188 flow [2025-03-04 02:12:01,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:01,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:01,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:01,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:12:01,624 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:12:01,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:01,625 INFO L85 PathProgramCache]: Analyzing trace with hash 626843639, now seen corresponding path program 3 times [2025-03-04 02:12:01,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:01,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493619941] [2025-03-04 02:12:01,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:12:01,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:01,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 1 equivalence classes. [2025-03-04 02:12:01,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:12:01,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:12:01,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:04,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:04,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493619941] [2025-03-04 02:12:04,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493619941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:04,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:04,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 02:12:04,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993938067] [2025-03-04 02:12:04,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:04,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:12:04,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:04,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:12:04,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:12:04,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 02:12:04,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 47 transitions, 188 flow. Second operand has 14 states, 14 states have (on average 10.0) internal successors, (140), 14 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:04,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:04,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 02:12:04,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:05,396 INFO L124 PetriNetUnfolderBase]: 1565/2490 cut-off events. [2025-03-04 02:12:05,397 INFO L125 PetriNetUnfolderBase]: For 1959/1959 co-relation queries the response was YES. [2025-03-04 02:12:05,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7486 conditions, 2490 events. 1565/2490 cut-off events. For 1959/1959 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12053 event pairs, 343 based on Foata normal form. 8/2495 useless extension candidates. Maximal degree in co-relation 7472. Up to 977 conditions per place. [2025-03-04 02:12:05,405 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 0 selfloop transitions, 0 changer transitions 112/112 dead transitions. [2025-03-04 02:12:05,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 112 transitions, 667 flow [2025-03-04 02:12:05,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:12:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:12:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2025-03-04 02:12:05,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-04 02:12:05,406 INFO L175 Difference]: Start difference. First operand has 75 places, 47 transitions, 188 flow. Second operand 10 states and 165 transitions. [2025-03-04 02:12:05,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 112 transitions, 667 flow [2025-03-04 02:12:05,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 112 transitions, 621 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-04 02:12:05,412 INFO L231 Difference]: Finished difference. Result has 65 places, 0 transitions, 0 flow [2025-03-04 02:12:05,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=65, PETRI_TRANSITIONS=0} [2025-03-04 02:12:05,413 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2025-03-04 02:12:05,413 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 0 transitions, 0 flow [2025-03-04 02:12:05,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.0) internal successors, (140), 14 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-04 02:12:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-04 02:12:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-04 02:12:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-04 02:12:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-04 02:12:05,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-04 02:12:05,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:12:05,416 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-03-04 02:12:05,420 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:12:05,420 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:12:05,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:12:05 BasicIcfg [2025-03-04 02:12:05,424 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:12:05,425 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:12:05,425 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:12:05,425 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:12:05,426 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:11:50" (3/4) ... [2025-03-04 02:12:05,427 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:12:05,429 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-04 02:12:05,429 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-04 02:12:05,429 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P2 [2025-03-04 02:12:05,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2025-03-04 02:12:05,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-04 02:12:05,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 02:12:05,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 02:12:05,491 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:12:05,491 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:12:05,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:12:05,492 INFO L158 Benchmark]: Toolchain (without parser) took 15956.72ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 111.1MB in the beginning and 931.4MB in the end (delta: -820.4MB). Peak memory consumption was 514.7MB. Max. memory is 16.1GB. [2025-03-04 02:12:05,493 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:12:05,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.07ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 83.3MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 02:12:05,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.15ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 79.8MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:12:05,494 INFO L158 Benchmark]: Boogie Preprocessor took 68.00ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 74.9MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:12:05,494 INFO L158 Benchmark]: IcfgBuilder took 842.42ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 54.0MB in the end (delta: 20.9MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2025-03-04 02:12:05,495 INFO L158 Benchmark]: TraceAbstraction took 14511.14ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 53.2MB in the beginning and 939.8MB in the end (delta: -886.6MB). Peak memory consumption was 449.0MB. Max. memory is 16.1GB. [2025-03-04 02:12:05,495 INFO L158 Benchmark]: Witness Printer took 66.84ms. Allocated memory is still 1.5GB. Free memory was 939.8MB in the beginning and 931.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:12:05,497 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.23ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.07ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 83.3MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.15ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 79.8MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.00ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 74.9MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 842.42ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 54.0MB in the end (delta: 20.9MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14511.14ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 53.2MB in the beginning and 939.8MB in the end (delta: -886.6MB). Peak memory consumption was 449.0MB. Max. memory is 16.1GB. * Witness Printer took 66.84ms. Allocated memory is still 1.5GB. Free memory was 939.8MB in the beginning and 931.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - 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, 70 locations, 6 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: 14.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 528 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 521 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2118 IncrementalHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 7 mSDtfsCounter, 2118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=6, InterpolantAutomatonStates: 51, 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.8s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 1270 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 02:12:05,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE