/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:45:10,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:45:10,715 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:45:10,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:45:10,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:45:10,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:45:10,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:45:10,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:45:10,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:45:10,749 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:45:10,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:45:10,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:45:10,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:45:10,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:45:10,750 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:45:10,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:45:10,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:45:10,751 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:45:10,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:45:10,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:45:10,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:45:10,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:45:10,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:45:10,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:45:10,751 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:45:10,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:45:10,751 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:45:10,751 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:45:10,751 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:45:10,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:45:10,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:45:10,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:45:10,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:45:10,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:45:10,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:45:10,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:45:10,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:45:10,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:45:10,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:45:10,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:45:10,752 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:45:10,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:45:10,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:45:10,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:45:10,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:45:10,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:45:10,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:45:10,752 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:45:10,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:45:10,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:45:10,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:45:10,964 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:45:10,966 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:45:10,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2025-04-13 19:45:12,196 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b9494268/6dfd5b6e4c14444ba9796c3d4c4a0351/FLAGc34738a5c [2025-04-13 19:45:12,434 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:45:12,434 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2025-04-13 19:45:12,445 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b9494268/6dfd5b6e4c14444ba9796c3d4c4a0351/FLAGc34738a5c [2025-04-13 19:45:13,350 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b9494268/6dfd5b6e4c14444ba9796c3d4c4a0351 [2025-04-13 19:45:13,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:45:13,353 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:45:13,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:45:13,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:45:13,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:45:13,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:45:13" (1/1) ... [2025-04-13 19:45:13,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fab966d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:13, skipping insertion in model container [2025-04-13 19:45:13,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:45:13" (1/1) ... [2025-04-13 19:45:13,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:45:13,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2025-04-13 19:45:13,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:45:13,649 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:45:13,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2025-04-13 19:45:13,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:45:13,726 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:45:13,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:13 WrapperNode [2025-04-13 19:45:13,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:45:13,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:45:13,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:45:13,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:45:13,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:13" (1/1) ... [2025-04-13 19:45:13,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:13" (1/1) ... [2025-04-13 19:45:13,767 INFO L138 Inliner]: procedures = 165, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2025-04-13 19:45:13,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:45:13,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:45:13,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:45:13,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:45:13,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:13" (1/1) ... [2025-04-13 19:45:13,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:13" (1/1) ... [2025-04-13 19:45:13,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:13" (1/1) ... [2025-04-13 19:45:13,794 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-04-13 19:45:13,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:13" (1/1) ... [2025-04-13 19:45:13,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:13" (1/1) ... [2025-04-13 19:45:13,797 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:13" (1/1) ... [2025-04-13 19:45:13,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:13" (1/1) ... [2025-04-13 19:45:13,798 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:13" (1/1) ... [2025-04-13 19:45:13,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:13" (1/1) ... [2025-04-13 19:45:13,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:13" (1/1) ... [2025-04-13 19:45:13,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:45:13,803 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:45:13,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:45:13,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:45:13,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:13" (1/1) ... [2025-04-13 19:45:13,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:45:13,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:45:13,828 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-04-13 19:45:13,830 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-04-13 19:45:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-04-13 19:45:13,844 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-04-13 19:45:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:45:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:45:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2025-04-13 19:45:13,845 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2025-04-13 19:45:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-13 19:45:13,845 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-13 19:45:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:45:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:45:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:45:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:45:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:45:13,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:45:13,846 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:45:13,943 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:45:13,944 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:45:14,111 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:45:14,112 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:45:14,112 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:45:14,284 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:45:14,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:45:14 BoogieIcfgContainer [2025-04-13 19:45:14,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:45:14,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:45:14,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:45:14,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:45:14,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:45:13" (1/3) ... [2025-04-13 19:45:14,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2ce02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:45:14, skipping insertion in model container [2025-04-13 19:45:14,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:45:13" (2/3) ... [2025-04-13 19:45:14,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2ce02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:45:14, skipping insertion in model container [2025-04-13 19:45:14,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:45:14" (3/3) ... [2025-04-13 19:45:14,290 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2025-04-13 19:45:14,299 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:45:14,300 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_21-traces-cluster-based_true.i that has 4 procedures, 50 locations, 47 edges, 1 initial locations, 0 loop locations, and 4 error locations. [2025-04-13 19:45:14,300 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:45:14,336 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:45:14,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 50 transitions, 112 flow [2025-04-13 19:45:14,386 INFO L116 PetriNetUnfolderBase]: 1/47 cut-off events. [2025-04-13 19:45:14,387 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:45:14,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 47 events. 1/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-04-13 19:45:14,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 50 transitions, 112 flow [2025-04-13 19:45:14,394 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 47 transitions, 103 flow [2025-04-13 19:45:14,399 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:45:14,408 INFO L340 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;@1d1e5515, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:45:14,408 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-13 19:45:14,413 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:45:14,414 INFO L116 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-04-13 19:45:14,414 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:45:14,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:14,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:45:14,414 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 19:45:14,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash 55402325, now seen corresponding path program 1 times [2025-04-13 19:45:14,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:14,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782064371] [2025-04-13 19:45:14,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:14,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:14,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:45:14,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:45:14,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:14,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:14,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:14,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782064371] [2025-04-13 19:45:14,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782064371] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:14,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:14,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:45:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139332890] [2025-04-13 19:45:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:14,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:45:14,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:14,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:45:14,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:45:14,786 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-13 19:45:14,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 103 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-04-13 19:45:14,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:14,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-13 19:45:14,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:16,797 INFO L116 PetriNetUnfolderBase]: 21506/31042 cut-off events. [2025-04-13 19:45:16,798 INFO L117 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-04-13 19:45:16,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61256 conditions, 31042 events. 21506/31042 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 194825 event pairs, 6557 based on Foata normal form. 0/27532 useless extension candidates. Maximal degree in co-relation 61245. Up to 8865 conditions per place. [2025-04-13 19:45:17,005 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 116 selfloop transitions, 5 changer transitions 0/127 dead transitions. [2025-04-13 19:45:17,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 127 transitions, 517 flow [2025-04-13 19:45:17,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:45:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:45:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2025-04-13 19:45:17,016 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.672 [2025-04-13 19:45:17,017 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 103 flow. Second operand 5 states and 168 transitions. [2025-04-13 19:45:17,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 127 transitions, 517 flow [2025-04-13 19:45:17,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 510 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:45:17,031 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 134 flow [2025-04-13 19:45:17,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-04-13 19:45:17,036 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 5 predicate places. [2025-04-13 19:45:17,037 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 134 flow [2025-04-13 19:45:17,037 INFO L486 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-04-13 19:45:17,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:17,037 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:45:17,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:45:17,038 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 19:45:17,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:17,039 INFO L85 PathProgramCache]: Analyzing trace with hash 776959829, now seen corresponding path program 1 times [2025-04-13 19:45:17,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:17,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411943840] [2025-04-13 19:45:17,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:17,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:17,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:45:17,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:45:17,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:17,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:17,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:17,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411943840] [2025-04-13 19:45:17,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411943840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:17,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:17,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:45:17,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743357925] [2025-04-13 19:45:17,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:17,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:45:17,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:17,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:45:17,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:45:17,220 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-13 19:45:17,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-04-13 19:45:17,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:17,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-13 19:45:17,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:18,637 INFO L116 PetriNetUnfolderBase]: 21296/31410 cut-off events. [2025-04-13 19:45:18,637 INFO L117 PetriNetUnfolderBase]: For 6592/6592 co-relation queries the response was YES. [2025-04-13 19:45:18,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67562 conditions, 31410 events. 21296/31410 cut-off events. For 6592/6592 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 202824 event pairs, 4604 based on Foata normal form. 0/29469 useless extension candidates. Maximal degree in co-relation 67548. Up to 12285 conditions per place. [2025-04-13 19:45:18,795 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 104 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2025-04-13 19:45:18,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 117 transitions, 530 flow [2025-04-13 19:45:18,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:45:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:45:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-04-13 19:45:18,797 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.616 [2025-04-13 19:45:18,797 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 134 flow. Second operand 5 states and 154 transitions. [2025-04-13 19:45:18,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 117 transitions, 530 flow [2025-04-13 19:45:18,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 117 transitions, 530 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:45:18,888 INFO L231 Difference]: Finished difference. Result has 68 places, 53 transitions, 176 flow [2025-04-13 19:45:18,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2025-04-13 19:45:18,889 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2025-04-13 19:45:18,889 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 176 flow [2025-04-13 19:45:18,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-04-13 19:45:18,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:18,889 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:45:18,889 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:45:18,889 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 19:45:18,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:18,891 INFO L85 PathProgramCache]: Analyzing trace with hash 123146239, now seen corresponding path program 1 times [2025-04-13 19:45:18,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:18,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042489965] [2025-04-13 19:45:18,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:18,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:45:18,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:45:18,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:18,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:19,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:19,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042489965] [2025-04-13 19:45:19,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042489965] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:19,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:19,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:45:19,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423437190] [2025-04-13 19:45:19,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:19,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:45:19,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:19,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:45:19,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:45:19,106 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-13 19:45:19,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-04-13 19:45:19,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:19,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-13 19:45:19,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:21,180 INFO L116 PetriNetUnfolderBase]: 25655/37795 cut-off events. [2025-04-13 19:45:21,180 INFO L117 PetriNetUnfolderBase]: For 16871/16871 co-relation queries the response was YES. [2025-04-13 19:45:21,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88747 conditions, 37795 events. 25655/37795 cut-off events. For 16871/16871 co-relation queries the response was YES. Maximal size of possible extension queue 1044. Compared 249043 event pairs, 8951 based on Foata normal form. 0/36664 useless extension candidates. Maximal degree in co-relation 88727. Up to 18669 conditions per place. [2025-04-13 19:45:21,351 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 107 selfloop transitions, 7 changer transitions 2/122 dead transitions. [2025-04-13 19:45:21,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 122 transitions, 622 flow [2025-04-13 19:45:21,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:45:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:45:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2025-04-13 19:45:21,352 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.612 [2025-04-13 19:45:21,352 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 176 flow. Second operand 5 states and 153 transitions. [2025-04-13 19:45:21,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 122 transitions, 622 flow [2025-04-13 19:45:21,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 122 transitions, 622 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:45:21,497 INFO L231 Difference]: Finished difference. Result has 76 places, 56 transitions, 226 flow [2025-04-13 19:45:21,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=76, PETRI_TRANSITIONS=56} [2025-04-13 19:45:21,497 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 20 predicate places. [2025-04-13 19:45:21,497 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 56 transitions, 226 flow [2025-04-13 19:45:21,497 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-04-13 19:45:21,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:21,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:45:21,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:45:21,498 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 19:45:21,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:21,498 INFO L85 PathProgramCache]: Analyzing trace with hash -375004093, now seen corresponding path program 1 times [2025-04-13 19:45:21,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:21,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059477609] [2025-04-13 19:45:21,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:21,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:21,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:45:21,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:45:21,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:21,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:21,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:21,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059477609] [2025-04-13 19:45:21,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059477609] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:21,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:21,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:45:21,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373406252] [2025-04-13 19:45:21,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:21,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:45:21,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:21,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:45:21,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:45:21,551 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-13 19:45:21,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 56 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-04-13 19:45:21,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:21,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-13 19:45:21,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:22,693 INFO L116 PetriNetUnfolderBase]: 16708/25196 cut-off events. [2025-04-13 19:45:22,693 INFO L117 PetriNetUnfolderBase]: For 18327/18327 co-relation queries the response was YES. [2025-04-13 19:45:22,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66575 conditions, 25196 events. 16708/25196 cut-off events. For 18327/18327 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 165635 event pairs, 6557 based on Foata normal form. 1860/26972 useless extension candidates. Maximal degree in co-relation 66549. Up to 14071 conditions per place. [2025-04-13 19:45:22,807 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 80 selfloop transitions, 13 changer transitions 0/99 dead transitions. [2025-04-13 19:45:22,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 598 flow [2025-04-13 19:45:22,808 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:45:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:45:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-04-13 19:45:22,809 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6866666666666666 [2025-04-13 19:45:22,809 INFO L175 Difference]: Start difference. First operand has 76 places, 56 transitions, 226 flow. Second operand 3 states and 103 transitions. [2025-04-13 19:45:22,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 99 transitions, 598 flow [2025-04-13 19:45:23,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 99 transitions, 598 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:45:23,205 INFO L231 Difference]: Finished difference. Result has 79 places, 64 transitions, 297 flow [2025-04-13 19:45:23,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=79, PETRI_TRANSITIONS=64} [2025-04-13 19:45:23,206 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 23 predicate places. [2025-04-13 19:45:23,206 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 64 transitions, 297 flow [2025-04-13 19:45:23,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-04-13 19:45:23,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:23,206 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:45:23,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:45:23,206 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 19:45:23,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:23,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1335644119, now seen corresponding path program 1 times [2025-04-13 19:45:23,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:23,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219482414] [2025-04-13 19:45:23,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:23,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:23,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:45:23,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:45:23,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:23,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:23,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:23,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:23,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219482414] [2025-04-13 19:45:23,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219482414] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:23,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:23,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:45:23,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318859472] [2025-04-13 19:45:23,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:23,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:45:23,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:23,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:45:23,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:45:23,357 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-13 19:45:23,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 64 transitions, 297 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-04-13 19:45:23,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:23,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-13 19:45:23,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:24,358 INFO L116 PetriNetUnfolderBase]: 9051/14778 cut-off events. [2025-04-13 19:45:24,358 INFO L117 PetriNetUnfolderBase]: For 13851/14098 co-relation queries the response was YES. [2025-04-13 19:45:24,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43248 conditions, 14778 events. 9051/14778 cut-off events. For 13851/14098 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 97180 event pairs, 2508 based on Foata normal form. 868/15634 useless extension candidates. Maximal degree in co-relation 43220. Up to 9032 conditions per place. [2025-04-13 19:45:24,462 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 75 selfloop transitions, 10 changer transitions 0/91 dead transitions. [2025-04-13 19:45:24,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 91 transitions, 581 flow [2025-04-13 19:45:24,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:45:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:45:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-04-13 19:45:24,464 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49 [2025-04-13 19:45:24,464 INFO L175 Difference]: Start difference. First operand has 79 places, 64 transitions, 297 flow. Second operand 4 states and 98 transitions. [2025-04-13 19:45:24,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 91 transitions, 581 flow [2025-04-13 19:45:24,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 91 transitions, 564 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:45:24,709 INFO L231 Difference]: Finished difference. Result has 81 places, 64 transitions, 304 flow [2025-04-13 19:45:24,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=81, PETRI_TRANSITIONS=64} [2025-04-13 19:45:24,712 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 25 predicate places. [2025-04-13 19:45:24,712 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 64 transitions, 304 flow [2025-04-13 19:45:24,712 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-04-13 19:45:24,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:24,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:45:24,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:45:24,712 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 19:45:24,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash -750466751, now seen corresponding path program 1 times [2025-04-13 19:45:24,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:24,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138289975] [2025-04-13 19:45:24,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:24,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:24,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:45:24,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:45:24,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:24,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:24,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:24,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138289975] [2025-04-13 19:45:24,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138289975] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:24,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:24,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:45:24,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854723618] [2025-04-13 19:45:24,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:24,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:45:24,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:24,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:45:24,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:45:24,788 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-13 19:45:24,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 64 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:45:24,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:24,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-13 19:45:24,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:25,516 INFO L116 PetriNetUnfolderBase]: 8339/13336 cut-off events. [2025-04-13 19:45:25,516 INFO L117 PetriNetUnfolderBase]: For 12679/12804 co-relation queries the response was YES. [2025-04-13 19:45:25,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39484 conditions, 13336 events. 8339/13336 cut-off events. For 12679/12804 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 83290 event pairs, 2040 based on Foata normal form. 330/13651 useless extension candidates. Maximal degree in co-relation 39455. Up to 5803 conditions per place. [2025-04-13 19:45:25,592 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 126 selfloop transitions, 10 changer transitions 8/150 dead transitions. [2025-04-13 19:45:25,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 150 transitions, 978 flow [2025-04-13 19:45:25,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:45:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:45:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2025-04-13 19:45:25,594 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5433333333333333 [2025-04-13 19:45:25,594 INFO L175 Difference]: Start difference. First operand has 81 places, 64 transitions, 304 flow. Second operand 6 states and 163 transitions. [2025-04-13 19:45:25,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 150 transitions, 978 flow [2025-04-13 19:45:25,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 150 transitions, 942 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 19:45:25,669 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 329 flow [2025-04-13 19:45:25,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2025-04-13 19:45:25,670 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 25 predicate places. [2025-04-13 19:45:25,670 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 329 flow [2025-04-13 19:45:25,670 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:45:25,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:25,670 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-04-13 19:45:25,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:45:25,671 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 19:45:25,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:25,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2005717540, now seen corresponding path program 1 times [2025-04-13 19:45:25,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:25,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70999960] [2025-04-13 19:45:25,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:25,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:25,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:45:25,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:45:25,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:25,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:25,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:25,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:25,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70999960] [2025-04-13 19:45:25,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70999960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:25,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:25,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:45:25,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631873426] [2025-04-13 19:45:25,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:25,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:45:25,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:25,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:45:25,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:45:25,752 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-13 19:45:25,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 329 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-04-13 19:45:25,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:25,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-13 19:45:25,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:26,529 INFO L116 PetriNetUnfolderBase]: 7523/12315 cut-off events. [2025-04-13 19:45:26,529 INFO L117 PetriNetUnfolderBase]: For 9958/9996 co-relation queries the response was YES. [2025-04-13 19:45:26,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35606 conditions, 12315 events. 7523/12315 cut-off events. For 9958/9996 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 76967 event pairs, 1805 based on Foata normal form. 168/12447 useless extension candidates. Maximal degree in co-relation 35578. Up to 3640 conditions per place. [2025-04-13 19:45:26,584 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 125 selfloop transitions, 16 changer transitions 15/162 dead transitions. [2025-04-13 19:45:26,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 162 transitions, 1014 flow [2025-04-13 19:45:26,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:45:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:45:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2025-04-13 19:45:26,585 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.485 [2025-04-13 19:45:26,585 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 329 flow. Second operand 8 states and 194 transitions. [2025-04-13 19:45:26,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 162 transitions, 1014 flow [2025-04-13 19:45:26,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 162 transitions, 1005 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:45:26,620 INFO L231 Difference]: Finished difference. Result has 88 places, 69 transitions, 381 flow [2025-04-13 19:45:26,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=381, PETRI_PLACES=88, PETRI_TRANSITIONS=69} [2025-04-13 19:45:26,621 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places. [2025-04-13 19:45:26,621 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 69 transitions, 381 flow [2025-04-13 19:45:26,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-04-13 19:45:26,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:26,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:45:26,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:45:26,621 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 19:45:26,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:26,622 INFO L85 PathProgramCache]: Analyzing trace with hash -148702458, now seen corresponding path program 1 times [2025-04-13 19:45:26,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:26,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82432990] [2025-04-13 19:45:26,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:26,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:26,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 19:45:26,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 19:45:26,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:26,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:26,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:26,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82432990] [2025-04-13 19:45:26,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82432990] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:26,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:26,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:45:26,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165232732] [2025-04-13 19:45:26,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:26,715 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:45:26,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:26,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:45:26,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:45:26,715 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-13 19:45:26,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 69 transitions, 381 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-04-13 19:45:26,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:26,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-13 19:45:26,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:27,341 INFO L116 PetriNetUnfolderBase]: 6824/11446 cut-off events. [2025-04-13 19:45:27,342 INFO L117 PetriNetUnfolderBase]: For 13315/13333 co-relation queries the response was YES. [2025-04-13 19:45:27,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34050 conditions, 11446 events. 6824/11446 cut-off events. For 13315/13333 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 72753 event pairs, 2129 based on Foata normal form. 206/11630 useless extension candidates. Maximal degree in co-relation 34020. Up to 3570 conditions per place. [2025-04-13 19:45:27,386 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 53 selfloop transitions, 6 changer transitions 97/161 dead transitions. [2025-04-13 19:45:27,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 161 transitions, 1064 flow [2025-04-13 19:45:27,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:45:27,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:45:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2025-04-13 19:45:27,388 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.485 [2025-04-13 19:45:27,388 INFO L175 Difference]: Start difference. First operand has 88 places, 69 transitions, 381 flow. Second operand 8 states and 194 transitions. [2025-04-13 19:45:27,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 161 transitions, 1064 flow [2025-04-13 19:45:27,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 161 transitions, 1034 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-04-13 19:45:27,422 INFO L231 Difference]: Finished difference. Result has 88 places, 45 transitions, 215 flow [2025-04-13 19:45:27,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=215, PETRI_PLACES=88, PETRI_TRANSITIONS=45} [2025-04-13 19:45:27,423 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places. [2025-04-13 19:45:27,423 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 45 transitions, 215 flow [2025-04-13 19:45:27,423 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-04-13 19:45:27,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:45:27,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:45:27,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:45:27,423 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 19:45:27,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:45:27,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2005503294, now seen corresponding path program 1 times [2025-04-13 19:45:27,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:45:27,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39069445] [2025-04-13 19:45:27,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:45:27,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:45:27,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:45:27,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:45:27,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:45:27,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:45:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:45:27,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:45:27,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39069445] [2025-04-13 19:45:27,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39069445] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:45:27,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:45:27,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:45:27,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148190372] [2025-04-13 19:45:27,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:45:27,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:45:27,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:45:27,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:45:27,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:45:27,527 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-04-13 19:45:27,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 45 transitions, 215 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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-04-13 19:45:27,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:45:27,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-04-13 19:45:27,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:45:27,625 INFO L116 PetriNetUnfolderBase]: 645/1129 cut-off events. [2025-04-13 19:45:27,625 INFO L117 PetriNetUnfolderBase]: For 647/681 co-relation queries the response was YES. [2025-04-13 19:45:27,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3014 conditions, 1129 events. 645/1129 cut-off events. For 647/681 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4602 event pairs, 275 based on Foata normal form. 56/1169 useless extension candidates. Maximal degree in co-relation 3002. Up to 664 conditions per place. [2025-04-13 19:45:27,628 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 0 selfloop transitions, 0 changer transitions 51/51 dead transitions. [2025-04-13 19:45:27,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 51 transitions, 292 flow [2025-04-13 19:45:27,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:45:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:45:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-04-13 19:45:27,629 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42 [2025-04-13 19:45:27,629 INFO L175 Difference]: Start difference. First operand has 88 places, 45 transitions, 215 flow. Second operand 4 states and 84 transitions. [2025-04-13 19:45:27,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 51 transitions, 292 flow [2025-04-13 19:45:27,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 51 transitions, 254 flow, removed 4 selfloop flow, removed 17 redundant places. [2025-04-13 19:45:27,632 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2025-04-13 19:45:27,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2025-04-13 19:45:27,632 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 4 predicate places. [2025-04-13 19:45:27,632 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2025-04-13 19:45:27,633 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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-04-13 19:45:27,634 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2025-04-13 19:45:27,635 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2025-04-13 19:45:27,635 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2025-04-13 19:45:27,635 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2025-04-13 19:45:27,635 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-04-13 19:45:27,635 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2025-04-13 19:45:27,635 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2025-04-13 19:45:27,635 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2025-04-13 19:45:27,635 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2025-04-13 19:45:27,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:45:27,635 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:45:27,639 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:45:27,639 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:45:27,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:45:27 BasicIcfg [2025-04-13 19:45:27,642 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:45:27,643 INFO L158 Benchmark]: Toolchain (without parser) took 14289.77ms. Allocated memory was 125.8MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 85.5MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2025-04-13 19:45:27,643 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:45:27,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.84ms. Allocated memory is still 125.8MB. Free memory was 85.5MB in the beginning and 62.0MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:45:27,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.97ms. Allocated memory is still 125.8MB. Free memory was 62.0MB in the beginning and 59.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:45:27,643 INFO L158 Benchmark]: Boogie Preprocessor took 34.64ms. Allocated memory is still 125.8MB. Free memory was 59.8MB in the beginning and 57.8MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:45:27,644 INFO L158 Benchmark]: RCFGBuilder took 481.71ms. Allocated memory is still 125.8MB. Free memory was 57.8MB in the beginning and 68.9MB in the end (delta: -11.1MB). Peak memory consumption was 44.1MB. Max. memory is 8.0GB. [2025-04-13 19:45:27,644 INFO L158 Benchmark]: TraceAbstraction took 13356.87ms. Allocated memory was 125.8MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 68.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2025-04-13 19:45:27,645 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 372.84ms. Allocated memory is still 125.8MB. Free memory was 85.5MB in the beginning and 62.0MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.97ms. Allocated memory is still 125.8MB. Free memory was 62.0MB in the beginning and 59.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 34.64ms. Allocated memory is still 125.8MB. Free memory was 59.8MB in the beginning and 57.8MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 481.71ms. Allocated memory is still 125.8MB. Free memory was 57.8MB in the beginning and 68.9MB in the end (delta: -11.1MB). Peak memory consumption was 44.1MB. Max. memory is 8.0GB. * TraceAbstraction took 13356.87ms. Allocated memory was 125.8MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 68.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * 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 - 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 7 procedures, 85 locations, 83 edges, 9 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: 13.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 578 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 578 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1492 IncrementalHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 0 mSDtfsCounter, 1492 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381occurred in iteration=7, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 19:45:27,661 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...