./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 f8ab0bd5 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-?-f8ab0bd-m [2025-03-13 21:33:20,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:33:21,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:33:21,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:33:21,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:33:21,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:33:21,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:33:21,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:33:21,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:33:21,047 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:33:21,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:33:21,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:33:21,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:33:21,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:33:21,047 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:33:21,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:33:21,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:33:21,048 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:33:21,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:33:21,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:33:21,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:33:21,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:33:21,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:33:21,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:33:21,048 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:33:21,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:33:21,049 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:33:21,049 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:33:21,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:33:21,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:33:21,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:33:21,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:33:21,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:33:21,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:33:21,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:33:21,049 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:33:21,049 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:33:21,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:33:21,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:33:21,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:33:21,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:33:21,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:33:21,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:33:21,050 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-13 21:33:21,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:33:21,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:33:21,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:33:21,265 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:33:21,265 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:33:21,267 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-13 21:33:22,384 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cba56058/a74814ee795c4e31b164fcd0a2981958/FLAGbbdf809aa [2025-03-13 21:33:22,674 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:33:22,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi002_tso.i [2025-03-13 21:33:22,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cba56058/a74814ee795c4e31b164fcd0a2981958/FLAGbbdf809aa [2025-03-13 21:33:22,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cba56058/a74814ee795c4e31b164fcd0a2981958 [2025-03-13 21:33:22,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:33:22,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:33:22,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:33:22,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:33:22,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:33:22,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:33:22" (1/1) ... [2025-03-13 21:33:22,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74465230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:22, skipping insertion in model container [2025-03-13 21:33:22,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:33:22" (1/1) ... [2025-03-13 21:33:22,988 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:33:23,092 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-13 21:33:23,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:33:23,311 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:33:23,320 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-13 21:33:23,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:33:23,415 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:33:23,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:23 WrapperNode [2025-03-13 21:33:23,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:33:23,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:33:23,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:33:23,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:33:23,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:23" (1/1) ... [2025-03-13 21:33:23,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:23" (1/1) ... [2025-03-13 21:33:23,462 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 206 [2025-03-13 21:33:23,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:33:23,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:33:23,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:33:23,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:33:23,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:23" (1/1) ... [2025-03-13 21:33:23,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:23" (1/1) ... [2025-03-13 21:33:23,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:23" (1/1) ... [2025-03-13 21:33:23,492 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-13 21:33:23,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:23" (1/1) ... [2025-03-13 21:33:23,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:23" (1/1) ... [2025-03-13 21:33:23,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:23" (1/1) ... [2025-03-13 21:33:23,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:23" (1/1) ... [2025-03-13 21:33:23,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:23" (1/1) ... [2025-03-13 21:33:23,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:23" (1/1) ... [2025-03-13 21:33:23,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:33:23,526 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:33:23,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:33:23,526 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:33:23,527 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:23" (1/1) ... [2025-03-13 21:33:23,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:33:23,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:33:23,557 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-13 21:33:23,559 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-13 21:33:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:33:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:33:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-13 21:33:23,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-13 21:33:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-13 21:33:23,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-13 21:33:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:33:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:33:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:33:23,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:33:23,576 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:33:23,679 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:33:23,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:33:24,054 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:33:24,055 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:33:24,055 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:33:24,427 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:33:24,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:33:24 BoogieIcfgContainer [2025-03-13 21:33:24,427 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:33:24,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:33:24,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:33:24,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:33:24,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:33:22" (1/3) ... [2025-03-13 21:33:24,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23da0420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:33:24, skipping insertion in model container [2025-03-13 21:33:24,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:23" (2/3) ... [2025-03-13 21:33:24,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23da0420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:33:24, skipping insertion in model container [2025-03-13 21:33:24,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:33:24" (3/3) ... [2025-03-13 21:33:24,435 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi002_tso.i [2025-03-13 21:33:24,447 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:33:24,449 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-13 21:33:24,449 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:33:24,495 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:33:24,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 34 transitions, 76 flow [2025-03-13 21:33:24,551 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2025-03-13 21:33:24,552 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:33:24,555 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-13 21:33:24,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 34 transitions, 76 flow [2025-03-13 21:33:24,559 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 32 transitions, 70 flow [2025-03-13 21:33:24,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:33:24,578 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;@673f1367, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:33:24,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-13 21:33:24,587 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:33:24,587 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-13 21:33:24,588 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:33:24,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:24,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-13 21:33:24,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:33:24,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:24,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1757227738, now seen corresponding path program 1 times [2025-03-13 21:33:24,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:24,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079143652] [2025-03-13 21:33:24,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:33:24,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:24,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-13 21:33:24,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-13 21:33:24,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:33:24,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:25,011 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-13 21:33:25,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:25,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079143652] [2025-03-13 21:33:25,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079143652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:25,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:25,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 21:33:25,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765752964] [2025-03-13 21:33:25,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:25,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:33:25,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:25,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:33:25,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:33:25,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-13 21:33:25,044 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-13 21:33:25,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:25,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-13 21:33:25,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:33:25,427 INFO L124 PetriNetUnfolderBase]: 830/1373 cut-off events. [2025-03-13 21:33:25,427 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 21:33:25,431 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-13 21:33:25,440 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 36 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-03-13 21:33:25,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 168 flow [2025-03-13 21:33:25,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:33:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:33:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-13 21:33:25,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2025-03-13 21:33:25,453 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 70 flow. Second operand 3 states and 62 transitions. [2025-03-13 21:33:25,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 168 flow [2025-03-13 21:33:25,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:33:25,457 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2025-03-13 21:33:25,461 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-13 21:33:25,464 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-03-13 21:33:25,465 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2025-03-13 21:33:25,465 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-13 21:33:25,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:25,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:33:25,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:33:25,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:33:25,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:25,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1360515523, now seen corresponding path program 1 times [2025-03-13 21:33:25,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:25,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571516688] [2025-03-13 21:33:25,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:33:25,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:25,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-13 21:33:25,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-13 21:33:25,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:33:25,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:25,685 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-13 21:33:25,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:25,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571516688] [2025-03-13 21:33:25,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571516688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:25,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:25,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 21:33:25,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136182554] [2025-03-13 21:33:25,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:25,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:33:25,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:25,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:33:25,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:33:25,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-13 21:33:25,687 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-13 21:33:25,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:25,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-13 21:33:25,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:33:25,959 INFO L124 PetriNetUnfolderBase]: 733/1241 cut-off events. [2025-03-13 21:33:25,959 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-13 21:33:25,963 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-13 21:33:25,967 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 33 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2025-03-13 21:33:25,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 166 flow [2025-03-13 21:33:25,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:33:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:33:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-03-13 21:33:25,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2025-03-13 21:33:25,970 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 3 states and 59 transitions. [2025-03-13 21:33:25,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 166 flow [2025-03-13 21:33:25,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:33:25,972 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2025-03-13 21:33:25,972 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-13 21:33:25,973 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-03-13 21:33:25,973 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2025-03-13 21:33:25,973 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-13 21:33:25,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:25,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:33:25,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:33:25,974 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-13 21:33:25,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:25,974 INFO L85 PathProgramCache]: Analyzing trace with hash -506310228, now seen corresponding path program 1 times [2025-03-13 21:33:25,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:25,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823556099] [2025-03-13 21:33:25,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:33:25,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:25,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-13 21:33:26,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:33:26,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:33:26,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:26,288 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-13 21:33:26,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:26,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823556099] [2025-03-13 21:33:26,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823556099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:26,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:26,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:33:26,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993889097] [2025-03-13 21:33:26,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:26,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:33:26,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:26,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:33:26,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:33:26,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-13 21:33:26,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-13 21:33:26,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:26,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-13 21:33:26,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:33:26,756 INFO L124 PetriNetUnfolderBase]: 909/1535 cut-off events. [2025-03-13 21:33:26,756 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-03-13 21:33:26,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3127 conditions, 1535 events. 909/1535 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7544 event pairs, 238 based on Foata normal form. 0/1500 useless extension candidates. Maximal degree in co-relation 3117. Up to 697 conditions per place. [2025-03-13 21:33:26,762 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 35 selfloop transitions, 2 changer transitions 56/96 dead transitions. [2025-03-13 21:33:26,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 96 transitions, 400 flow [2025-03-13 21:33:26,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:33:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:33:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2025-03-13 21:33:26,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4963235294117647 [2025-03-13 21:33:26,764 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 8 states and 135 transitions. [2025-03-13 21:33:26,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 96 transitions, 400 flow [2025-03-13 21:33:26,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 96 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:33:26,768 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 74 flow [2025-03-13 21:33:26,769 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-13 21:33:26,770 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2025-03-13 21:33:26,770 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 74 flow [2025-03-13 21:33:26,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-13 21:33:26,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:26,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:33:26,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:33:26,770 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-13 21:33:26,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:26,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1836583152, now seen corresponding path program 1 times [2025-03-13 21:33:26,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:26,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165933672] [2025-03-13 21:33:26,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:33:26,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:26,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:33:26,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:33:26,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:33:26,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:27,081 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-13 21:33:27,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:27,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165933672] [2025-03-13 21:33:27,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165933672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:27,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:27,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:33:27,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105148172] [2025-03-13 21:33:27,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:27,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:33:27,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:27,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:33:27,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:33:27,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-13 21:33:27,086 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-13 21:33:27,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:27,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-13 21:33:27,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:33:27,380 INFO L124 PetriNetUnfolderBase]: 619/1061 cut-off events. [2025-03-13 21:33:27,380 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2025-03-13 21:33:27,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2384 conditions, 1061 events. 619/1061 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4557 event pairs, 200 based on Foata normal form. 32/1090 useless extension candidates. Maximal degree in co-relation 2369. Up to 619 conditions per place. [2025-03-13 21:33:27,384 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 32 selfloop transitions, 2 changer transitions 29/66 dead transitions. [2025-03-13 21:33:27,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 291 flow [2025-03-13 21:33:27,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:33:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:33:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-03-13 21:33:27,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42016806722689076 [2025-03-13 21:33:27,386 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 74 flow. Second operand 7 states and 100 transitions. [2025-03-13 21:33:27,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 291 flow [2025-03-13 21:33:27,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 269 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-13 21:33:27,389 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 78 flow [2025-03-13 21:33:27,389 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-13 21:33:27,389 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-03-13 21:33:27,389 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 78 flow [2025-03-13 21:33:27,389 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-13 21:33:27,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:27,389 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-13 21:33:27,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:33:27,390 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-13 21:33:27,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:27,390 INFO L85 PathProgramCache]: Analyzing trace with hash -2036889913, now seen corresponding path program 1 times [2025-03-13 21:33:27,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:27,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540435685] [2025-03-13 21:33:27,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:33:27,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:27,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:33:27,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:33:27,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:33:27,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:28,720 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-13 21:33:28,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:28,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540435685] [2025-03-13 21:33:28,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540435685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:28,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:28,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:33:28,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565860668] [2025-03-13 21:33:28,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:28,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:33:28,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:28,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:33:28,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:33:28,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-13 21:33:28,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 78 flow. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-13 21:33:28,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:28,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-13 21:33:28,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:33:29,344 INFO L124 PetriNetUnfolderBase]: 766/1297 cut-off events. [2025-03-13 21:33:29,344 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2025-03-13 21:33:29,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2972 conditions, 1297 events. 766/1297 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5762 event pairs, 82 based on Foata normal form. 24/1318 useless extension candidates. Maximal degree in co-relation 2956. Up to 776 conditions per place. [2025-03-13 21:33:29,349 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 57 selfloop transitions, 13 changer transitions 31/104 dead transitions. [2025-03-13 21:33:29,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 104 transitions, 467 flow [2025-03-13 21:33:29,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 21:33:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 21:33:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 169 transitions. [2025-03-13 21:33:29,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2025-03-13 21:33:29,352 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 78 flow. Second operand 13 states and 169 transitions. [2025-03-13 21:33:29,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 104 transitions, 467 flow [2025-03-13 21:33:29,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 104 transitions, 437 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-13 21:33:29,356 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 164 flow [2025-03-13 21:33:29,356 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=164, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2025-03-13 21:33:29,356 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2025-03-13 21:33:29,356 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 164 flow [2025-03-13 21:33:29,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-13 21:33:29,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:29,357 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-13 21:33:29,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:33:29,357 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-13 21:33:29,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:29,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1897776527, now seen corresponding path program 2 times [2025-03-13 21:33:29,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:29,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877991380] [2025-03-13 21:33:29,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:33:29,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:29,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:33:29,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:33:29,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:33:29,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:30,284 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-13 21:33:30,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:30,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877991380] [2025-03-13 21:33:30,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877991380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:30,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:30,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:33:30,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202758035] [2025-03-13 21:33:30,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:30,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:33:30,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:30,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:33:30,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:33:30,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-13 21:33:30,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 164 flow. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 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-13 21:33:30,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:30,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-13 21:33:30,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:33:30,910 INFO L124 PetriNetUnfolderBase]: 849/1431 cut-off events. [2025-03-13 21:33:30,910 INFO L125 PetriNetUnfolderBase]: For 1991/1991 co-relation queries the response was YES. [2025-03-13 21:33:30,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4357 conditions, 1431 events. 849/1431 cut-off events. For 1991/1991 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6417 event pairs, 130 based on Foata normal form. 24/1452 useless extension candidates. Maximal degree in co-relation 4336. Up to 781 conditions per place. [2025-03-13 21:33:30,916 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 59 selfloop transitions, 21 changer transitions 27/110 dead transitions. [2025-03-13 21:33:30,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 110 transitions, 651 flow [2025-03-13 21:33:30,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:33:30,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:33:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 162 transitions. [2025-03-13 21:33:30,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39705882352941174 [2025-03-13 21:33:30,918 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 164 flow. Second operand 12 states and 162 transitions. [2025-03-13 21:33:30,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 110 transitions, 651 flow [2025-03-13 21:33:30,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 110 transitions, 607 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-03-13 21:33:30,924 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 305 flow [2025-03-13 21:33:30,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=305, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2025-03-13 21:33:30,925 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 24 predicate places. [2025-03-13 21:33:30,925 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 305 flow [2025-03-13 21:33:30,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 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-13 21:33:30,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:30,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:33:30,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:33:30,925 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-13 21:33:30,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:30,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1003805325, now seen corresponding path program 1 times [2025-03-13 21:33:30,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:30,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975368309] [2025-03-13 21:33:30,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:33:30,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:30,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:33:30,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:33:30,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:33:30,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:31,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-13 21:33:31,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:31,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975368309] [2025-03-13 21:33:31,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975368309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:31,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:31,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:33:31,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095410954] [2025-03-13 21:33:31,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:31,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:33:31,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:31,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:33:31,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:33:31,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-13 21:33:31,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-13 21:33:31,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:31,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-13 21:33:31,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:33:31,338 INFO L124 PetriNetUnfolderBase]: 557/1003 cut-off events. [2025-03-13 21:33:31,338 INFO L125 PetriNetUnfolderBase]: For 2280/2280 co-relation queries the response was YES. [2025-03-13 21:33:31,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3477 conditions, 1003 events. 557/1003 cut-off events. For 2280/2280 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4547 event pairs, 152 based on Foata normal form. 88/1088 useless extension candidates. Maximal degree in co-relation 3452. Up to 388 conditions per place. [2025-03-13 21:33:31,343 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 73 selfloop transitions, 4 changer transitions 1/82 dead transitions. [2025-03-13 21:33:31,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 82 transitions, 683 flow [2025-03-13 21:33:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:33:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:33:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-03-13 21:33:31,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5955882352941176 [2025-03-13 21:33:31,344 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 305 flow. Second operand 4 states and 81 transitions. [2025-03-13 21:33:31,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 82 transitions, 683 flow [2025-03-13 21:33:31,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 644 flow, removed 19 selfloop flow, removed 3 redundant places. [2025-03-13 21:33:31,351 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 312 flow [2025-03-13 21:33:31,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2025-03-13 21:33:31,351 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2025-03-13 21:33:31,351 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 312 flow [2025-03-13 21:33:31,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-13 21:33:31,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:31,352 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-13 21:33:31,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:33:31,352 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-13 21:33:31,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:31,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1293970706, now seen corresponding path program 1 times [2025-03-13 21:33:31,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:31,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768539965] [2025-03-13 21:33:31,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:33:31,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:31,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:33:31,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:33:31,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:33:31,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:32,565 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-13 21:33:32,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:32,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768539965] [2025-03-13 21:33:32,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768539965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:32,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:32,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:33:32,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558928512] [2025-03-13 21:33:32,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:32,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:33:32,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:32,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:33:32,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:33:32,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-13 21:33:32,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 312 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-13 21:33:32,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:32,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-13 21:33:32,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:33:33,146 INFO L124 PetriNetUnfolderBase]: 565/1023 cut-off events. [2025-03-13 21:33:33,146 INFO L125 PetriNetUnfolderBase]: For 1634/1634 co-relation queries the response was YES. [2025-03-13 21:33:33,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 1023 events. 565/1023 cut-off events. For 1634/1634 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4571 event pairs, 141 based on Foata normal form. 20/1040 useless extension candidates. Maximal degree in co-relation 3569. Up to 505 conditions per place. [2025-03-13 21:33:33,151 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 47 selfloop transitions, 15 changer transitions 27/92 dead transitions. [2025-03-13 21:33:33,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 92 transitions, 697 flow [2025-03-13 21:33:33,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:33:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:33:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2025-03-13 21:33:33,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2025-03-13 21:33:33,153 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 312 flow. Second operand 9 states and 117 transitions. [2025-03-13 21:33:33,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 92 transitions, 697 flow [2025-03-13 21:33:33,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 92 transitions, 657 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-03-13 21:33:33,159 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 385 flow [2025-03-13 21:33:33,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=385, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2025-03-13 21:33:33,160 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 32 predicate places. [2025-03-13 21:33:33,161 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 385 flow [2025-03-13 21:33:33,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-13 21:33:33,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:33,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:33:33,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:33:33,161 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-13 21:33:33,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:33,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1247079759, now seen corresponding path program 1 times [2025-03-13 21:33:33,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:33,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878895648] [2025-03-13 21:33:33,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:33:33,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:33,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:33:33,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:33:33,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:33:33,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:33,756 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-13 21:33:33,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:33,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878895648] [2025-03-13 21:33:33,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878895648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:33,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:33,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:33:33,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386925595] [2025-03-13 21:33:33,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:33,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:33:33,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:33,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:33:33,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:33:33,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-13 21:33:33,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 385 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-13 21:33:33,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:33,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-13 21:33:33,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:33:34,252 INFO L124 PetriNetUnfolderBase]: 735/1333 cut-off events. [2025-03-13 21:33:34,253 INFO L125 PetriNetUnfolderBase]: For 3326/3326 co-relation queries the response was YES. [2025-03-13 21:33:34,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4807 conditions, 1333 events. 735/1333 cut-off events. For 3326/3326 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6521 event pairs, 237 based on Foata normal form. 12/1342 useless extension candidates. Maximal degree in co-relation 4777. Up to 597 conditions per place. [2025-03-13 21:33:34,259 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 51 selfloop transitions, 11 changer transitions 38/103 dead transitions. [2025-03-13 21:33:34,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 103 transitions, 870 flow [2025-03-13 21:33:34,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:33:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:33:34,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2025-03-13 21:33:34,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43014705882352944 [2025-03-13 21:33:34,262 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 385 flow. Second operand 8 states and 117 transitions. [2025-03-13 21:33:34,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 103 transitions, 870 flow [2025-03-13 21:33:34,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 103 transitions, 826 flow, removed 19 selfloop flow, removed 6 redundant places. [2025-03-13 21:33:34,269 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 368 flow [2025-03-13 21:33:34,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=368, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2025-03-13 21:33:34,271 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2025-03-13 21:33:34,271 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 368 flow [2025-03-13 21:33:34,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-13 21:33:34,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:34,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:33:34,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:33:34,271 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-13 21:33:34,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:34,272 INFO L85 PathProgramCache]: Analyzing trace with hash -969541539, now seen corresponding path program 1 times [2025-03-13 21:33:34,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:34,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132071964] [2025-03-13 21:33:34,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:33:34,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:34,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:33:34,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:33:34,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:33:34,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:34,788 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-13 21:33:34,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:34,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132071964] [2025-03-13 21:33:34,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132071964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:34,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:34,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:33:34,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593266429] [2025-03-13 21:33:34,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:34,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:33:34,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:34,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:33:34,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:33:34,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-13 21:33:34,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 368 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-13 21:33:34,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:34,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-13 21:33:34,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:33:35,127 INFO L124 PetriNetUnfolderBase]: 448/840 cut-off events. [2025-03-13 21:33:35,127 INFO L125 PetriNetUnfolderBase]: For 1928/1928 co-relation queries the response was YES. [2025-03-13 21:33:35,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2979 conditions, 840 events. 448/840 cut-off events. For 1928/1928 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3652 event pairs, 242 based on Foata normal form. 8/845 useless extension candidates. Maximal degree in co-relation 2949. Up to 637 conditions per place. [2025-03-13 21:33:35,131 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 38 selfloop transitions, 9 changer transitions 20/70 dead transitions. [2025-03-13 21:33:35,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 597 flow [2025-03-13 21:33:35,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:33:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:33:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2025-03-13 21:33:35,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36554621848739494 [2025-03-13 21:33:35,133 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 368 flow. Second operand 7 states and 87 transitions. [2025-03-13 21:33:35,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 597 flow [2025-03-13 21:33:35,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 567 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-13 21:33:35,137 INFO L231 Difference]: Finished difference. Result has 72 places, 47 transitions, 349 flow [2025-03-13 21:33:35,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=72, PETRI_TRANSITIONS=47} [2025-03-13 21:33:35,138 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 34 predicate places. [2025-03-13 21:33:35,138 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 47 transitions, 349 flow [2025-03-13 21:33:35,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-13 21:33:35,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:35,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:33:35,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:33:35,139 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-13 21:33:35,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:35,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1651375235, now seen corresponding path program 2 times [2025-03-13 21:33:35,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:35,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894090549] [2025-03-13 21:33:35,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:33:35,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:35,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:33:35,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:33:35,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:33:35,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:35,982 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-13 21:33:35,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:35,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894090549] [2025-03-13 21:33:35,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894090549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:35,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:35,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:33:35,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250531210] [2025-03-13 21:33:35,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:35,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:33:35,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:35,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:33:35,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:33:35,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-13 21:33:35,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 47 transitions, 349 flow. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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-13 21:33:35,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:35,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-13 21:33:35,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:33:36,497 INFO L124 PetriNetUnfolderBase]: 604/1109 cut-off events. [2025-03-13 21:33:36,497 INFO L125 PetriNetUnfolderBase]: For 2127/2127 co-relation queries the response was YES. [2025-03-13 21:33:36,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3742 conditions, 1109 events. 604/1109 cut-off events. For 2127/2127 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5214 event pairs, 109 based on Foata normal form. 12/1119 useless extension candidates. Maximal degree in co-relation 3712. Up to 287 conditions per place. [2025-03-13 21:33:36,506 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 39 selfloop transitions, 13 changer transitions 58/113 dead transitions. [2025-03-13 21:33:36,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 113 transitions, 873 flow [2025-03-13 21:33:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:33:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:33:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2025-03-13 21:33:36,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42058823529411765 [2025-03-13 21:33:36,509 INFO L175 Difference]: Start difference. First operand has 72 places, 47 transitions, 349 flow. Second operand 10 states and 143 transitions. [2025-03-13 21:33:36,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 113 transitions, 873 flow [2025-03-13 21:33:36,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 113 transitions, 837 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-03-13 21:33:36,514 INFO L231 Difference]: Finished difference. Result has 76 places, 41 transitions, 293 flow [2025-03-13 21:33:36,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=293, PETRI_PLACES=76, PETRI_TRANSITIONS=41} [2025-03-13 21:33:36,514 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 38 predicate places. [2025-03-13 21:33:36,514 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 41 transitions, 293 flow [2025-03-13 21:33:36,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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-13 21:33:36,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:36,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:33:36,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:33:36,515 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:33:36,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash -107442961, now seen corresponding path program 3 times [2025-03-13 21:33:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:36,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177386154] [2025-03-13 21:33:36,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:33:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:36,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:33:36,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:33:36,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:33:36,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:37,237 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-13 21:33:37,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:37,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177386154] [2025-03-13 21:33:37,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177386154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:37,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:37,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:33:37,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135480619] [2025-03-13 21:33:37,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:37,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:33:37,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:37,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:33:37,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:33:37,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-13 21:33:37,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 41 transitions, 293 flow. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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-13 21:33:37,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:37,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-13 21:33:37,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:33:37,739 INFO L124 PetriNetUnfolderBase]: 288/552 cut-off events. [2025-03-13 21:33:37,739 INFO L125 PetriNetUnfolderBase]: For 1208/1208 co-relation queries the response was YES. [2025-03-13 21:33:37,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1967 conditions, 552 events. 288/552 cut-off events. For 1208/1208 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2010 event pairs, 136 based on Foata normal form. 8/557 useless extension candidates. Maximal degree in co-relation 1935. Up to 306 conditions per place. [2025-03-13 21:33:37,743 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 31 selfloop transitions, 9 changer transitions 28/71 dead transitions. [2025-03-13 21:33:37,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 71 transitions, 569 flow [2025-03-13 21:33:37,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:33:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:33:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2025-03-13 21:33:37,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31283422459893045 [2025-03-13 21:33:37,745 INFO L175 Difference]: Start difference. First operand has 76 places, 41 transitions, 293 flow. Second operand 11 states and 117 transitions. [2025-03-13 21:33:37,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 71 transitions, 569 flow [2025-03-13 21:33:37,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 71 transitions, 469 flow, removed 24 selfloop flow, removed 13 redundant places. [2025-03-13 21:33:37,751 INFO L231 Difference]: Finished difference. Result has 76 places, 37 transitions, 239 flow [2025-03-13 21:33:37,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=239, PETRI_PLACES=76, PETRI_TRANSITIONS=37} [2025-03-13 21:33:37,751 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 38 predicate places. [2025-03-13 21:33:37,752 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 37 transitions, 239 flow [2025-03-13 21:33:37,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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-13 21:33:37,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:37,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:33:37,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:33:37,753 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:33:37,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:37,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1902684503, now seen corresponding path program 4 times [2025-03-13 21:33:37,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:37,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335445271] [2025-03-13 21:33:37,754 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:33:37,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:37,766 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:33:37,825 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:33:37,826 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:33:37,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:37,960 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-13 21:33:37,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:37,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335445271] [2025-03-13 21:33:37,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335445271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:37,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:37,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:33:37,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394395568] [2025-03-13 21:33:37,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:37,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:33:37,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:37,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:33:37,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:33:37,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-13 21:33:37,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 37 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-13 21:33:37,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:37,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-13 21:33:37,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:33:38,065 INFO L124 PetriNetUnfolderBase]: 149/299 cut-off events. [2025-03-13 21:33:38,068 INFO L125 PetriNetUnfolderBase]: For 746/746 co-relation queries the response was YES. [2025-03-13 21:33:38,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 299 events. 149/299 cut-off events. For 746/746 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 926 event pairs, 65 based on Foata normal form. 16/312 useless extension candidates. Maximal degree in co-relation 1007. Up to 142 conditions per place. [2025-03-13 21:33:38,070 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 37 selfloop transitions, 6 changer transitions 1/48 dead transitions. [2025-03-13 21:33:38,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 48 transitions, 374 flow [2025-03-13 21:33:38,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:33:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:33:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-03-13 21:33:38,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4294117647058823 [2025-03-13 21:33:38,071 INFO L175 Difference]: Start difference. First operand has 76 places, 37 transitions, 239 flow. Second operand 5 states and 73 transitions. [2025-03-13 21:33:38,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 48 transitions, 374 flow [2025-03-13 21:33:38,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 273 flow, removed 27 selfloop flow, removed 19 redundant places. [2025-03-13 21:33:38,073 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 180 flow [2025-03-13 21:33:38,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2025-03-13 21:33:38,074 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2025-03-13 21:33:38,074 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 180 flow [2025-03-13 21:33:38,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-13 21:33:38,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:38,074 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-13 21:33:38,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:33:38,075 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:33:38,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:38,075 INFO L85 PathProgramCache]: Analyzing trace with hash 840818970, now seen corresponding path program 1 times [2025-03-13 21:33:38,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:38,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240698924] [2025-03-13 21:33:38,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:33:38,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:38,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:33:38,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:33:38,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:33:38,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:39,089 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-13 21:33:39,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:39,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240698924] [2025-03-13 21:33:39,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240698924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:39,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:39,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:33:39,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590515352] [2025-03-13 21:33:39,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:39,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:33:39,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:39,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:33:39,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:33:39,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-13 21:33:39,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 180 flow. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 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-13 21:33:39,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:39,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-13 21:33:39,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:33:39,435 INFO L124 PetriNetUnfolderBase]: 205/407 cut-off events. [2025-03-13 21:33:39,435 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2025-03-13 21:33:39,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1185 conditions, 407 events. 205/407 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1380 event pairs, 52 based on Foata normal form. 4/408 useless extension candidates. Maximal degree in co-relation 1165. Up to 172 conditions per place. [2025-03-13 21:33:39,437 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 31 selfloop transitions, 7 changer transitions 32/73 dead transitions. [2025-03-13 21:33:39,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 73 transitions, 448 flow [2025-03-13 21:33:39,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:33:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:33:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2025-03-13 21:33:39,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32941176470588235 [2025-03-13 21:33:39,438 INFO L175 Difference]: Start difference. First operand has 55 places, 37 transitions, 180 flow. Second operand 10 states and 112 transitions. [2025-03-13 21:33:39,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 73 transitions, 448 flow [2025-03-13 21:33:39,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 387 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-13 21:33:39,440 INFO L231 Difference]: Finished difference. Result has 64 places, 34 transitions, 162 flow [2025-03-13 21:33:39,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=162, PETRI_PLACES=64, PETRI_TRANSITIONS=34} [2025-03-13 21:33:39,440 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 26 predicate places. [2025-03-13 21:33:39,440 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 34 transitions, 162 flow [2025-03-13 21:33:39,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 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-13 21:33:39,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:39,441 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-13 21:33:39,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:33:39,441 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:33:39,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:39,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1885786782, now seen corresponding path program 2 times [2025-03-13 21:33:39,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:39,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766196684] [2025-03-13 21:33:39,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:33:39,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:39,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:33:39,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:33:39,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:33:39,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:41,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:33:41,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:41,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766196684] [2025-03-13 21:33:41,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766196684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:41,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:41,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-13 21:33:41,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349678583] [2025-03-13 21:33:41,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:41,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 21:33:41,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:41,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 21:33:41,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:33:41,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-13 21:33:41,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 34 transitions, 162 flow. Second operand has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 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-13 21:33:41,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:41,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-13 21:33:41,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:33:41,775 INFO L124 PetriNetUnfolderBase]: 188/377 cut-off events. [2025-03-13 21:33:41,775 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2025-03-13 21:33:41,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 377 events. 188/377 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1253 event pairs, 20 based on Foata normal form. 4/379 useless extension candidates. Maximal degree in co-relation 1046. Up to 182 conditions per place. [2025-03-13 21:33:41,777 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 45 selfloop transitions, 14 changer transitions 25/87 dead transitions. [2025-03-13 21:33:41,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 87 transitions, 513 flow [2025-03-13 21:33:41,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 21:33:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 21:33:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 154 transitions. [2025-03-13 21:33:41,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30196078431372547 [2025-03-13 21:33:41,778 INFO L175 Difference]: Start difference. First operand has 64 places, 34 transitions, 162 flow. Second operand 15 states and 154 transitions. [2025-03-13 21:33:41,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 87 transitions, 513 flow [2025-03-13 21:33:41,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 446 flow, removed 11 selfloop flow, removed 11 redundant places. [2025-03-13 21:33:41,780 INFO L231 Difference]: Finished difference. Result has 70 places, 43 transitions, 223 flow [2025-03-13 21:33:41,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=223, PETRI_PLACES=70, PETRI_TRANSITIONS=43} [2025-03-13 21:33:41,780 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 32 predicate places. [2025-03-13 21:33:41,780 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 43 transitions, 223 flow [2025-03-13 21:33:41,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 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-13 21:33:41,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:41,781 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-13 21:33:41,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:33:41,781 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-13 21:33:41,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash -914383872, now seen corresponding path program 3 times [2025-03-13 21:33:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:41,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291778750] [2025-03-13 21:33:41,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:33:41,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:41,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:33:41,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:33:41,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:33:41,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:42,944 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-13 21:33:42,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:42,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291778750] [2025-03-13 21:33:42,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291778750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:42,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:42,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:33:42,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949908610] [2025-03-13 21:33:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:42,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:33:42,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:42,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:33:42,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:33:42,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-13 21:33:42,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 43 transitions, 223 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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-13 21:33:42,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:42,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-13 21:33:42,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:33:43,264 INFO L124 PetriNetUnfolderBase]: 130/256 cut-off events. [2025-03-13 21:33:43,264 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2025-03-13 21:33:43,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 256 events. 130/256 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 732 event pairs, 17 based on Foata normal form. 4/257 useless extension candidates. Maximal degree in co-relation 762. Up to 121 conditions per place. [2025-03-13 21:33:43,265 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 0 selfloop transitions, 0 changer transitions 51/51 dead transitions. [2025-03-13 21:33:43,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 51 transitions, 337 flow [2025-03-13 21:33:43,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:33:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:33:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2025-03-13 21:33:43,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27941176470588236 [2025-03-13 21:33:43,265 INFO L175 Difference]: Start difference. First operand has 70 places, 43 transitions, 223 flow. Second operand 8 states and 76 transitions. [2025-03-13 21:33:43,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 51 transitions, 337 flow [2025-03-13 21:33:43,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 51 transitions, 316 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-13 21:33:43,266 INFO L231 Difference]: Finished difference. Result has 63 places, 0 transitions, 0 flow [2025-03-13 21:33:43,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=63, PETRI_TRANSITIONS=0} [2025-03-13 21:33:43,268 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2025-03-13 21:33:43,268 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 0 transitions, 0 flow [2025-03-13 21:33:43,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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-13 21:33:43,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-03-13 21:33:43,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-13 21:33:43,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-03-13 21:33:43,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-13 21:33:43,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-13 21:33:43,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-03-13 21:33:43,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-13 21:33:43,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 21:33:43,271 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:33:43,274 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:33:43,275 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:33:43,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:33:43 BasicIcfg [2025-03-13 21:33:43,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:33:43,281 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:33:43,281 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:33:43,281 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:33:43,282 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:33:24" (3/4) ... [2025-03-13 21:33:43,283 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 21:33:43,285 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-13 21:33:43,285 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-13 21:33:43,288 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2025-03-13 21:33:43,288 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-13 21:33:43,288 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 21:33:43,289 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 21:33:43,342 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:33:43,343 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:33:43,343 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:33:43,343 INFO L158 Benchmark]: Toolchain (without parser) took 20381.88ms. Allocated memory was 167.8MB in the beginning and 771.8MB in the end (delta: 604.0MB). Free memory was 130.2MB in the beginning and 431.0MB in the end (delta: -300.8MB). Peak memory consumption was 299.6MB. Max. memory is 16.1GB. [2025-03-13 21:33:43,344 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:33:43,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.42ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 102.1MB in the end (delta: 27.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-13 21:33:43,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.16ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 98.6MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:33:43,345 INFO L158 Benchmark]: Boogie Preprocessor took 59.44ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 93.5MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:33:43,346 INFO L158 Benchmark]: IcfgBuilder took 901.57ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 117.9MB in the end (delta: -24.4MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. [2025-03-13 21:33:43,346 INFO L158 Benchmark]: TraceAbstraction took 18851.13ms. Allocated memory was 167.8MB in the beginning and 771.8MB in the end (delta: 604.0MB). Free memory was 117.9MB in the beginning and 435.1MB in the end (delta: -317.2MB). Peak memory consumption was 284.3MB. Max. memory is 16.1GB. [2025-03-13 21:33:43,346 INFO L158 Benchmark]: Witness Printer took 61.71ms. Allocated memory is still 771.8MB. Free memory was 435.1MB in the beginning and 431.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:33:43,347 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.22ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.42ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 102.1MB in the end (delta: 27.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.16ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 98.6MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.44ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 93.5MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 901.57ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 117.9MB in the end (delta: -24.4MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18851.13ms. Allocated memory was 167.8MB in the beginning and 771.8MB in the end (delta: 604.0MB). Free memory was 117.9MB in the beginning and 435.1MB in the end (delta: -317.2MB). Peak memory consumption was 284.3MB. Max. memory is 16.1GB. * Witness Printer took 61.71ms. Allocated memory is still 771.8MB. Free memory was 435.1MB in the beginning and 431.0MB in the end (delta: 4.1MB). 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, 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: 18.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 828 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 819 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 184 mSDsCounter, 179 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3231 IncrementalHoareTripleChecker+Invalid, 3410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 179 mSolverCounterUnsat, 4 mSDtfsCounter, 3231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=385occurred in iteration=8, InterpolantAutomatonStates: 133, 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, 10.8s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 3532 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-13 21:33:43,363 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