./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi002_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/rfi002_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 48e6a57243e80a87d178da358ff4ad1dd63b86003507ef0dec3764d15038130a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:19:59,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:19:59,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:19:59,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:19:59,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:19:59,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:19:59,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:19:59,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:19:59,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:19:59,904 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:19:59,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:19:59,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:19:59,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:19:59,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:19:59,906 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:19:59,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:19:59,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:19:59,906 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:19:59,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:19:59,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:19:59,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:19:59,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:19:59,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:19:59,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:19:59,907 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:19:59,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:19:59,907 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:19:59,907 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:19:59,907 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:19:59,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:19:59,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:19:59,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:19:59,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:19:59,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:19:59,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:19:59,908 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:19:59,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:19:59,908 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:19:59,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:19:59,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:19:59,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:19:59,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:19:59,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:19:59,908 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 -> 48e6a57243e80a87d178da358ff4ad1dd63b86003507ef0dec3764d15038130a [2025-03-08 17:20:00,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:20:00,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:20:00,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:20:00,172 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:20:00,172 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:20:00,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi002_tso.i [2025-03-08 17:20:01,285 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a707da0ba/2a33444e7a0546bc8c6cdb34bdf2ec64/FLAG922e9b7a6 [2025-03-08 17:20:01,590 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:20:01,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi002_tso.i [2025-03-08 17:20:01,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a707da0ba/2a33444e7a0546bc8c6cdb34bdf2ec64/FLAG922e9b7a6 [2025-03-08 17:20:01,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a707da0ba/2a33444e7a0546bc8c6cdb34bdf2ec64 [2025-03-08 17:20:01,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:20:01,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:20:01,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:20:01,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:20:01,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:20:01,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:20:01" (1/1) ... [2025-03-08 17:20:01,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2427776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:20:01, skipping insertion in model container [2025-03-08 17:20:01,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:20:01" (1/1) ... [2025-03-08 17:20:01,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:20:01,795 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/rfi002_tso.i[987,1000] [2025-03-08 17:20:01,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:20:02,011 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:20:02,020 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/rfi002_tso.i[987,1000] [2025-03-08 17:20:02,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:20:02,090 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:20:02,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:20:02 WrapperNode [2025-03-08 17:20:02,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:20:02,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:20:02,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:20:02,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:20:02,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:20:02" (1/1) ... [2025-03-08 17:20:02,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:20:02" (1/1) ... [2025-03-08 17:20:02,140 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 206 [2025-03-08 17:20:02,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:20:02,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:20:02,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:20:02,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:20:02,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:20:02" (1/1) ... [2025-03-08 17:20:02,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:20:02" (1/1) ... [2025-03-08 17:20:02,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:20:02" (1/1) ... [2025-03-08 17:20:02,173 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-08 17:20:02,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:20:02" (1/1) ... [2025-03-08 17:20:02,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:20:02" (1/1) ... [2025-03-08 17:20:02,183 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:20:02" (1/1) ... [2025-03-08 17:20:02,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:20:02" (1/1) ... [2025-03-08 17:20:02,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:20:02" (1/1) ... [2025-03-08 17:20:02,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:20:02" (1/1) ... [2025-03-08 17:20:02,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:20:02,197 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:20:02,197 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:20:02,197 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:20:02,198 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:20:02" (1/1) ... [2025-03-08 17:20:02,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:20:02,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:20:02,221 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-08 17:20:02,223 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-08 17:20:02,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 17:20:02,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:20:02,241 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-08 17:20:02,241 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-08 17:20:02,241 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-08 17:20:02,241 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-08 17:20:02,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:20:02,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 17:20:02,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:20:02,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:20:02,243 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:20:02,334 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:20:02,336 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:20:02,717 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:20:02,717 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:20:02,983 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:20:02,983 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:20:02,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:20:02 BoogieIcfgContainer [2025-03-08 17:20:02,984 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:20:02,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:20:02,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:20:02,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:20:03,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:20:01" (1/3) ... [2025-03-08 17:20:03,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f0be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:20:03, skipping insertion in model container [2025-03-08 17:20:03,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:20:02" (2/3) ... [2025-03-08 17:20:03,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f0be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:20:03, skipping insertion in model container [2025-03-08 17:20:03,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:20:02" (3/3) ... [2025-03-08 17:20:03,005 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi002_tso.i [2025-03-08 17:20:03,016 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:20:03,018 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi002_tso.i that has 3 procedures, 34 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-08 17:20:03,018 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:20:03,065 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:20:03,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 34 transitions, 76 flow [2025-03-08 17:20:03,115 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2025-03-08 17:20:03,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:20:03,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 1/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-03-08 17:20:03,121 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 34 transitions, 76 flow [2025-03-08 17:20:03,124 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 32 transitions, 70 flow [2025-03-08 17:20:03,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:20:03,145 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;@75f3cf20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:20:03,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-08 17:20:03,151 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:20:03,152 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-08 17:20:03,152 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:20:03,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:20:03,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 17:20:03,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:20:03,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:20:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1757227738, now seen corresponding path program 1 times [2025-03-08 17:20:03,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:20:03,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052930639] [2025-03-08 17:20:03,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:20:03,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:20:03,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 17:20:03,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 17:20:03,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:20:03,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:20:03,546 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-08 17:20:03,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:20:03,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052930639] [2025-03-08 17:20:03,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052930639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:20:03,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:20:03,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 17:20:03,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225663327] [2025-03-08 17:20:03,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:20:03,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:20:03,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:20:03,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:20:03,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:20:03,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-08 17:20:03,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-08 17:20:03,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:20:03,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-08 17:20:03,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:20:03,961 INFO L124 PetriNetUnfolderBase]: 830/1373 cut-off events. [2025-03-08 17:20:03,961 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-08 17:20:03,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 1373 events. 830/1373 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6565 event pairs, 54 based on Foata normal form. 63/1370 useless extension candidates. Maximal degree in co-relation 2732. Up to 1225 conditions per place. [2025-03-08 17:20:03,972 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 36 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-03-08 17:20:03,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 168 flow [2025-03-08 17:20:03,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:20:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:20:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-08 17:20:03,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2025-03-08 17:20:03,986 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 70 flow. Second operand 3 states and 62 transitions. [2025-03-08 17:20:03,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 168 flow [2025-03-08 17:20:03,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:20:03,992 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2025-03-08 17:20:03,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2025-03-08 17:20:03,998 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-03-08 17:20:03,999 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2025-03-08 17:20:03,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-08 17:20:04,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:20:04,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:20:04,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:20:04,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:20:04,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:20:04,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1360515523, now seen corresponding path program 1 times [2025-03-08 17:20:04,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:20:04,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121457902] [2025-03-08 17:20:04,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:20:04,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:20:04,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 17:20:04,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 17:20:04,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:20:04,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:20:04,199 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-08 17:20:04,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:20:04,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121457902] [2025-03-08 17:20:04,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121457902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:20:04,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:20:04,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 17:20:04,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594397113] [2025-03-08 17:20:04,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:20:04,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:20:04,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:20:04,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:20:04,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:20:04,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-08 17:20:04,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-08 17:20:04,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:20:04,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-08 17:20:04,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:20:04,506 INFO L124 PetriNetUnfolderBase]: 733/1241 cut-off events. [2025-03-08 17:20:04,506 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-08 17:20:04,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2513 conditions, 1241 events. 733/1241 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6048 event pairs, 151 based on Foata normal form. 0/1224 useless extension candidates. Maximal degree in co-relation 2503. Up to 919 conditions per place. [2025-03-08 17:20:04,517 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 33 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2025-03-08 17:20:04,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 166 flow [2025-03-08 17:20:04,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:20:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:20:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-03-08 17:20:04,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2025-03-08 17:20:04,519 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 3 states and 59 transitions. [2025-03-08 17:20:04,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 166 flow [2025-03-08 17:20:04,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:20:04,521 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2025-03-08 17:20:04,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-03-08 17:20:04,522 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-03-08 17:20:04,522 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2025-03-08 17:20:04,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-08 17:20:04,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:20:04,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:20:04,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:20:04,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:20:04,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:20:04,524 INFO L85 PathProgramCache]: Analyzing trace with hash -506310228, now seen corresponding path program 1 times [2025-03-08 17:20:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:20:04,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969029655] [2025-03-08 17:20:04,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:20:04,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:20:04,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 17:20:04,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 17:20:04,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:20:04,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:20:05,114 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-08 17:20:05,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:20:05,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969029655] [2025-03-08 17:20:05,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969029655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:20:05,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:20:05,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:20:05,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602693473] [2025-03-08 17:20:05,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:20:05,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:20:05,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:20:05,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:20:05,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:20:05,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-08 17:20:05,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-08 17:20:05,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:20:05,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-08 17:20:05,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:20:05,638 INFO L124 PetriNetUnfolderBase]: 930/1571 cut-off events. [2025-03-08 17:20:05,639 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-08 17:20:05,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3180 conditions, 1571 events. 930/1571 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7534 event pairs, 236 based on Foata normal form. 0/1533 useless extension candidates. Maximal degree in co-relation 3170. Up to 745 conditions per place. [2025-03-08 17:20:05,644 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 32 selfloop transitions, 2 changer transitions 54/91 dead transitions. [2025-03-08 17:20:05,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 91 transitions, 370 flow [2025-03-08 17:20:05,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:20:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:20:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2025-03-08 17:20:05,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47794117647058826 [2025-03-08 17:20:05,645 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 8 states and 130 transitions. [2025-03-08 17:20:05,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 91 transitions, 370 flow [2025-03-08 17:20:05,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 91 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:20:05,649 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 74 flow [2025-03-08 17:20:05,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2025-03-08 17:20:05,650 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2025-03-08 17:20:05,650 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 74 flow [2025-03-08 17:20:05,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-08 17:20:05,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:20:05,650 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:20:05,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:20:05,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:20:05,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:20:05,651 INFO L85 PathProgramCache]: Analyzing trace with hash 644453697, now seen corresponding path program 1 times [2025-03-08 17:20:05,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:20:05,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126101531] [2025-03-08 17:20:05,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:20:05,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:20:05,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 17:20:05,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 17:20:05,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:20:05,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:20:05,935 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-08 17:20:05,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:20:05,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126101531] [2025-03-08 17:20:05,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126101531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:20:05,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:20:05,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:20:05,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091286523] [2025-03-08 17:20:05,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:20:05,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:20:05,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:20:05,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:20:05,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:20:05,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-08 17:20:05,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-08 17:20:05,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:20:05,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-08 17:20:05,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:20:06,259 INFO L124 PetriNetUnfolderBase]: 631/1079 cut-off events. [2025-03-08 17:20:06,259 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2025-03-08 17:20:06,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 1079 events. 631/1079 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4808 event pairs, 211 based on Foata normal form. 35/1111 useless extension candidates. Maximal degree in co-relation 2400. Up to 598 conditions per place. [2025-03-08 17:20:06,263 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 35 selfloop transitions, 2 changer transitions 31/71 dead transitions. [2025-03-08 17:20:06,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 71 transitions, 313 flow [2025-03-08 17:20:06,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:20:06,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:20:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2025-03-08 17:20:06,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2025-03-08 17:20:06,265 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 74 flow. Second operand 7 states and 105 transitions. [2025-03-08 17:20:06,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 71 transitions, 313 flow [2025-03-08 17:20:06,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 71 transitions, 291 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-08 17:20:06,268 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 78 flow [2025-03-08 17:20:06,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2025-03-08 17:20:06,268 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-03-08 17:20:06,268 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 78 flow [2025-03-08 17:20:06,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-08 17:20:06,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:20:06,269 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-08 17:20:06,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:20:06,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:20:06,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:20:06,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1475761505, now seen corresponding path program 1 times [2025-03-08 17:20:06,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:20:06,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749237852] [2025-03-08 17:20:06,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:20:06,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:20:06,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 17:20:06,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 17:20:06,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:20:06,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:20:07,015 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-08 17:20:07,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:20:07,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749237852] [2025-03-08 17:20:07,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749237852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:20:07,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:20:07,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:20:07,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692169250] [2025-03-08 17:20:07,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:20:07,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:20:07,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:20:07,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:20:07,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:20:07,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-08 17:20:07,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 78 flow. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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-08 17:20:07,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:20:07,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-08 17:20:07,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:20:07,344 INFO L124 PetriNetUnfolderBase]: 390/709 cut-off events. [2025-03-08 17:20:07,344 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-03-08 17:20:07,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1603 conditions, 709 events. 390/709 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2867 event pairs, 6 based on Foata normal form. 56/763 useless extension candidates. Maximal degree in co-relation 1587. Up to 289 conditions per place. [2025-03-08 17:20:07,347 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 53 selfloop transitions, 8 changer transitions 3/67 dead transitions. [2025-03-08 17:20:07,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 301 flow [2025-03-08 17:20:07,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:20:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:20:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-03-08 17:20:07,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-03-08 17:20:07,348 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 78 flow. Second operand 6 states and 98 transitions. [2025-03-08 17:20:07,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 301 flow [2025-03-08 17:20:07,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 67 transitions, 283 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-08 17:20:07,350 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 128 flow [2025-03-08 17:20:07,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-03-08 17:20:07,350 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2025-03-08 17:20:07,350 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 128 flow [2025-03-08 17:20:07,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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-08 17:20:07,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:20:07,351 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] [2025-03-08 17:20:07,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:20:07,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:20:07,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:20:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash 356476642, now seen corresponding path program 1 times [2025-03-08 17:20:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:20:07,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23448039] [2025-03-08 17:20:07,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:20:07,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:20:07,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 17:20:07,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 17:20:07,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:20:07,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:20:08,941 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-08 17:20:08,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:20:08,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23448039] [2025-03-08 17:20:08,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23448039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:20:08,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:20:08,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 17:20:08,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10736593] [2025-03-08 17:20:08,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:20:08,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:20:08,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:20:08,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:20:08,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:20:08,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-08 17:20:08,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 128 flow. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:20:08,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:20:08,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-08 17:20:08,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:20:09,661 INFO L124 PetriNetUnfolderBase]: 415/755 cut-off events. [2025-03-08 17:20:09,661 INFO L125 PetriNetUnfolderBase]: For 387/387 co-relation queries the response was YES. [2025-03-08 17:20:09,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1991 conditions, 755 events. 415/755 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3081 event pairs, 59 based on Foata normal form. 10/762 useless extension candidates. Maximal degree in co-relation 1975. Up to 516 conditions per place. [2025-03-08 17:20:09,664 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 52 selfloop transitions, 28 changer transitions 15/98 dead transitions. [2025-03-08 17:20:09,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 98 transitions, 523 flow [2025-03-08 17:20:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 17:20:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 17:20:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 158 transitions. [2025-03-08 17:20:09,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3574660633484163 [2025-03-08 17:20:09,667 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 128 flow. Second operand 13 states and 158 transitions. [2025-03-08 17:20:09,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 98 transitions, 523 flow [2025-03-08 17:20:09,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 98 transitions, 501 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-08 17:20:09,670 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 303 flow [2025-03-08 17:20:09,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=303, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2025-03-08 17:20:09,670 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2025-03-08 17:20:09,670 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 303 flow [2025-03-08 17:20:09,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:20:09,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:20:09,671 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] [2025-03-08 17:20:09,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:20:09,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:20:09,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:20:09,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1369311074, now seen corresponding path program 2 times [2025-03-08 17:20:09,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:20:09,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321788446] [2025-03-08 17:20:09,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:20:09,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:20:09,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-03-08 17:20:09,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 17:20:09,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:20:09,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:20:09,912 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-08 17:20:09,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:20:09,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321788446] [2025-03-08 17:20:09,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321788446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:20:09,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:20:09,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:20:09,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296716999] [2025-03-08 17:20:09,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:20:09,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:20:09,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:20:09,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:20:09,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:20:09,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-08 17:20:09,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 303 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-08 17:20:09,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:20:09,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-08 17:20:09,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:20:10,062 INFO L124 PetriNetUnfolderBase]: 264/492 cut-off events. [2025-03-08 17:20:10,062 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2025-03-08 17:20:10,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 492 events. 264/492 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1807 event pairs, 74 based on Foata normal form. 32/521 useless extension candidates. Maximal degree in co-relation 1489. Up to 207 conditions per place. [2025-03-08 17:20:10,065 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 61 selfloop transitions, 7 changer transitions 1/73 dead transitions. [2025-03-08 17:20:10,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 487 flow [2025-03-08 17:20:10,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:20:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:20:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-03-08 17:20:10,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-03-08 17:20:10,066 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 303 flow. Second operand 5 states and 80 transitions. [2025-03-08 17:20:10,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 487 flow [2025-03-08 17:20:10,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 429 flow, removed 12 selfloop flow, removed 9 redundant places. [2025-03-08 17:20:10,070 INFO L231 Difference]: Finished difference. Result has 54 places, 54 transitions, 256 flow [2025-03-08 17:20:10,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=54, PETRI_TRANSITIONS=54} [2025-03-08 17:20:10,071 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2025-03-08 17:20:10,072 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 256 flow [2025-03-08 17:20:10,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-08 17:20:10,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:20:10,072 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] [2025-03-08 17:20:10,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:20:10,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:20:10,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:20:10,073 INFO L85 PathProgramCache]: Analyzing trace with hash -400817618, now seen corresponding path program 1 times [2025-03-08 17:20:10,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:20:10,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164753427] [2025-03-08 17:20:10,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:20:10,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:20:10,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:20:10,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:20:10,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:20:10,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:20:10,747 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-08 17:20:10,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:20:10,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164753427] [2025-03-08 17:20:10,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164753427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:20:10,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:20:10,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:20:10,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355585004] [2025-03-08 17:20:10,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:20:10,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:20:10,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:20:10,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:20:10,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:20:10,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-08 17:20:10,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 256 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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-08 17:20:10,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:20:10,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-08 17:20:10,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:20:11,013 INFO L124 PetriNetUnfolderBase]: 291/549 cut-off events. [2025-03-08 17:20:11,013 INFO L125 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2025-03-08 17:20:11,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 549 events. 291/549 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2075 event pairs, 64 based on Foata normal form. 4/550 useless extension candidates. Maximal degree in co-relation 1587. Up to 234 conditions per place. [2025-03-08 17:20:11,017 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 36 selfloop transitions, 13 changer transitions 31/83 dead transitions. [2025-03-08 17:20:11,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 534 flow [2025-03-08 17:20:11,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:20:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:20:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2025-03-08 17:20:11,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3949579831932773 [2025-03-08 17:20:11,018 INFO L175 Difference]: Start difference. First operand has 54 places, 54 transitions, 256 flow. Second operand 7 states and 94 transitions. [2025-03-08 17:20:11,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 534 flow [2025-03-08 17:20:11,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 83 transitions, 463 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-03-08 17:20:11,023 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 234 flow [2025-03-08 17:20:11,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=234, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2025-03-08 17:20:11,024 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2025-03-08 17:20:11,025 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 234 flow [2025-03-08 17:20:11,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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-08 17:20:11,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:20:11,025 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] [2025-03-08 17:20:11,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:20:11,025 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:20:11,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:20:11,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1806554718, now seen corresponding path program 2 times [2025-03-08 17:20:11,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:20:11,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778150672] [2025-03-08 17:20:11,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:20:11,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:20:11,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:20:11,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:20:11,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:20:11,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:20:11,648 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-08 17:20:11,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:20:11,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778150672] [2025-03-08 17:20:11,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778150672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:20:11,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:20:11,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:20:11,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408657827] [2025-03-08 17:20:11,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:20:11,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:20:11,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:20:11,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:20:11,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:20:11,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-08 17:20:11,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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-08 17:20:11,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:20:11,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-08 17:20:11,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:20:11,960 INFO L124 PetriNetUnfolderBase]: 233/453 cut-off events. [2025-03-08 17:20:11,960 INFO L125 PetriNetUnfolderBase]: For 237/237 co-relation queries the response was YES. [2025-03-08 17:20:11,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1269 conditions, 453 events. 233/453 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1567 event pairs, 76 based on Foata normal form. 4/454 useless extension candidates. Maximal degree in co-relation 1249. Up to 170 conditions per place. [2025-03-08 17:20:11,962 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 36 selfloop transitions, 11 changer transitions 32/82 dead transitions. [2025-03-08 17:20:11,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 82 transitions, 503 flow [2025-03-08 17:20:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:20:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:20:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2025-03-08 17:20:11,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-03-08 17:20:11,963 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 234 flow. Second operand 8 states and 102 transitions. [2025-03-08 17:20:11,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 82 transitions, 503 flow [2025-03-08 17:20:11,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 82 transitions, 469 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-03-08 17:20:11,966 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 223 flow [2025-03-08 17:20:11,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=223, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2025-03-08 17:20:11,967 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2025-03-08 17:20:11,967 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 223 flow [2025-03-08 17:20:11,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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-08 17:20:11,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:20:11,967 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] [2025-03-08 17:20:11,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:20:11,968 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:20:11,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:20:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1269313802, now seen corresponding path program 3 times [2025-03-08 17:20:11,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:20:11,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075394119] [2025-03-08 17:20:11,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:20:11,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:20:11,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:20:12,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:20:12,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:20:12,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:20:12,855 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-08 17:20:12,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:20:12,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075394119] [2025-03-08 17:20:12,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075394119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:20:12,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:20:12,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:20:12,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571649909] [2025-03-08 17:20:12,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:20:12,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:20:12,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:20:12,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:20:12,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:20:12,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-08 17:20:12,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 223 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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-08 17:20:12,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:20:12,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-08 17:20:12,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:20:13,128 INFO L124 PetriNetUnfolderBase]: 191/381 cut-off events. [2025-03-08 17:20:13,128 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-03-08 17:20:13,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 381 events. 191/381 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1249 event pairs, 62 based on Foata normal form. 4/382 useless extension candidates. Maximal degree in co-relation 1069. Up to 153 conditions per place. [2025-03-08 17:20:13,130 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 33 selfloop transitions, 8 changer transitions 34/78 dead transitions. [2025-03-08 17:20:13,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 485 flow [2025-03-08 17:20:13,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:20:13,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:20:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2025-03-08 17:20:13,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3464052287581699 [2025-03-08 17:20:13,131 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 223 flow. Second operand 9 states and 106 transitions. [2025-03-08 17:20:13,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 485 flow [2025-03-08 17:20:13,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 78 transitions, 442 flow, removed 7 selfloop flow, removed 9 redundant places. [2025-03-08 17:20:13,133 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 193 flow [2025-03-08 17:20:13,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=193, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2025-03-08 17:20:13,134 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2025-03-08 17:20:13,134 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 193 flow [2025-03-08 17:20:13,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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-08 17:20:13,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:20:13,134 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] [2025-03-08 17:20:13,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:20:13,134 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 17:20:13,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:20:13,134 INFO L85 PathProgramCache]: Analyzing trace with hash 31331516, now seen corresponding path program 4 times [2025-03-08 17:20:13,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:20:13,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918859550] [2025-03-08 17:20:13,135 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:20:13,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:20:13,146 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-08 17:20:13,300 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:20:13,301 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:20:13,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:20:14,913 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-08 17:20:14,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:20:14,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918859550] [2025-03-08 17:20:14,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918859550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:20:14,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:20:14,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 17:20:14,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448809397] [2025-03-08 17:20:14,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:20:14,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:20:14,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:20:14,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:20:14,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:20:14,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2025-03-08 17:20:14,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 193 flow. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-08 17:20:14,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:20:14,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2025-03-08 17:20:14,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:20:15,122 INFO L124 PetriNetUnfolderBase]: 105/209 cut-off events. [2025-03-08 17:20:15,122 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2025-03-08 17:20:15,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 209 events. 105/209 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 526 event pairs, 27 based on Foata normal form. 4/210 useless extension candidates. Maximal degree in co-relation 625. Up to 102 conditions per place. [2025-03-08 17:20:15,123 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 0 selfloop transitions, 0 changer transitions 45/45 dead transitions. [2025-03-08 17:20:15,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 45 transitions, 291 flow [2025-03-08 17:20:15,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:20:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:20:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2025-03-08 17:20:15,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31512605042016806 [2025-03-08 17:20:15,125 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 193 flow. Second operand 7 states and 75 transitions. [2025-03-08 17:20:15,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 45 transitions, 291 flow [2025-03-08 17:20:15,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 255 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-08 17:20:15,126 INFO L231 Difference]: Finished difference. Result has 51 places, 0 transitions, 0 flow [2025-03-08 17:20:15,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=51, PETRI_TRANSITIONS=0} [2025-03-08 17:20:15,126 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2025-03-08 17:20:15,126 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 0 transitions, 0 flow [2025-03-08 17:20:15,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-08 17:20:15,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-03-08 17:20:15,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-08 17:20:15,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-03-08 17:20:15,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-08 17:20:15,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-08 17:20:15,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-03-08 17:20:15,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-08 17:20:15,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:20:15,130 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2025-03-08 17:20:15,133 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 17:20:15,133 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:20:15,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:20:15 BasicIcfg [2025-03-08 17:20:15,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:20:15,139 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:20:15,139 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:20:15,140 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:20:15,140 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:20:02" (3/4) ... [2025-03-08 17:20:15,141 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 17:20:15,143 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-08 17:20:15,143 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-08 17:20:15,147 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 52 nodes and edges [2025-03-08 17:20:15,147 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-08 17:20:15,147 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-08 17:20:15,148 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 17:20:15,207 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 17:20:15,208 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 17:20:15,208 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:20:15,208 INFO L158 Benchmark]: Toolchain (without parser) took 13583.34ms. Allocated memory was 142.6MB in the beginning and 746.6MB in the end (delta: 604.0MB). Free memory was 103.4MB in the beginning and 476.6MB in the end (delta: -373.2MB). Peak memory consumption was 228.7MB. Max. memory is 16.1GB. [2025-03-08 17:20:15,209 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:20:15,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.54ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 74.9MB in the end (delta: 28.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 17:20:15,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.42ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 71.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:20:15,210 INFO L158 Benchmark]: Boogie Preprocessor took 51.94ms. Allocated memory is still 142.6MB. Free memory was 71.6MB in the beginning and 66.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:20:15,210 INFO L158 Benchmark]: IcfgBuilder took 786.90ms. Allocated memory is still 142.6MB. Free memory was 66.7MB in the beginning and 36.6MB in the end (delta: 30.1MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2025-03-08 17:20:15,211 INFO L158 Benchmark]: TraceAbstraction took 12152.72ms. Allocated memory was 142.6MB in the beginning and 746.6MB in the end (delta: 604.0MB). Free memory was 35.9MB in the beginning and 480.8MB in the end (delta: -444.9MB). Peak memory consumption was 163.2MB. Max. memory is 16.1GB. [2025-03-08 17:20:15,211 INFO L158 Benchmark]: Witness Printer took 68.53ms. Allocated memory is still 746.6MB. Free memory was 480.8MB in the beginning and 476.6MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:20:15,212 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.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 464.54ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 74.9MB in the end (delta: 28.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.42ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 71.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.94ms. Allocated memory is still 142.6MB. Free memory was 71.6MB in the beginning and 66.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 786.90ms. Allocated memory is still 142.6MB. Free memory was 66.7MB in the beginning and 36.6MB in the end (delta: 30.1MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12152.72ms. Allocated memory was 142.6MB in the beginning and 746.6MB in the end (delta: 604.0MB). Free memory was 35.9MB in the beginning and 480.8MB in the end (delta: -444.9MB). Peak memory consumption was 163.2MB. Max. memory is 16.1GB. * Witness Printer took 68.53ms. Allocated memory is still 746.6MB. Free memory was 480.8MB in the beginning and 476.6MB 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: 19]: 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: 19]: 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: 19]: 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 5 procedures, 55 locations, 53 edges, 7 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: 12.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 457 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1725 IncrementalHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 8 mSDtfsCounter, 1725 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=6, InterpolantAutomatonStates: 76, 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.7s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 1756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 17:20:15,233 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