./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/triangular-longer-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e30b67a045ce6921ac9aa6cdcebddb50c3d7d787a6b9dd7b66c9173f916fde4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:44:46,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:44:46,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:44:46,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:44:46,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:44:46,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:44:46,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:44:46,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:44:46,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:44:46,324 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:44:46,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:44:46,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:44:46,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:44:46,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:44:46,325 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:44:46,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:44:46,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:44:46,325 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:44:46,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:44:46,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:44:46,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:44:46,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:44:46,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:44:46,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:44:46,326 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:44:46,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:44:46,326 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:44:46,326 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:44:46,326 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:44:46,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:44:46,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:44:46,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:44:46,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:44:46,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:44:46,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:44:46,327 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:44:46,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:44:46,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:44:46,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:44:46,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:44:46,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:44:46,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:44:46,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:44:46,328 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e30b67a045ce6921ac9aa6cdcebddb50c3d7d787a6b9dd7b66c9173f916fde4 [2025-03-14 00:44:46,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:44:46,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:44:46,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:44:46,571 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:44:46,571 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:44:46,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longer-1.i [2025-03-14 00:44:47,729 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b5dfbe01/e5919a887da2433eba3b2a4e97f3ac24/FLAGf9c7a46fd [2025-03-14 00:44:48,037 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:44:48,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-1.i [2025-03-14 00:44:48,057 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b5dfbe01/e5919a887da2433eba3b2a4e97f3ac24/FLAGf9c7a46fd [2025-03-14 00:44:48,294 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b5dfbe01/e5919a887da2433eba3b2a4e97f3ac24 [2025-03-14 00:44:48,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:44:48,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:44:48,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:44:48,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:44:48,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:44:48,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:44:48" (1/1) ... [2025-03-14 00:44:48,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a2a01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:48, skipping insertion in model container [2025-03-14 00:44:48,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:44:48" (1/1) ... [2025-03-14 00:44:48,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:44:48,579 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-1.i[30961,30974] [2025-03-14 00:44:48,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:44:48,590 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:44:48,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-1.i[30961,30974] [2025-03-14 00:44:48,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:44:48,642 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:44:48,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:48 WrapperNode [2025-03-14 00:44:48,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:44:48,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:44:48,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:44:48,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:44:48,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:48" (1/1) ... [2025-03-14 00:44:48,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:48" (1/1) ... [2025-03-14 00:44:48,669 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-03-14 00:44:48,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:44:48,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:44:48,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:44:48,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:44:48,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:48" (1/1) ... [2025-03-14 00:44:48,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:48" (1/1) ... [2025-03-14 00:44:48,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:48" (1/1) ... [2025-03-14 00:44:48,683 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-14 00:44:48,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:48" (1/1) ... [2025-03-14 00:44:48,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:48" (1/1) ... [2025-03-14 00:44:48,686 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:48" (1/1) ... [2025-03-14 00:44:48,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:48" (1/1) ... [2025-03-14 00:44:48,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:48" (1/1) ... [2025-03-14 00:44:48,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:48" (1/1) ... [2025-03-14 00:44:48,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:44:48,689 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:44:48,690 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:44:48,690 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:44:48,690 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:48" (1/1) ... [2025-03-14 00:44:48,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:44:48,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:48,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 00:44:48,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 00:44:48,738 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-14 00:44:48,738 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-14 00:44:48,738 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-14 00:44:48,738 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-14 00:44:48,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 00:44:48,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:44:48,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:44:48,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 00:44:48,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:44:48,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:44:48,739 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:44:48,836 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:44:48,837 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:44:48,953 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:44:48,954 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:44:48,954 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:44:49,036 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:44:49,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:44:49 BoogieIcfgContainer [2025-03-14 00:44:49,037 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:44:49,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:44:49,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:44:49,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:44:49,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:44:48" (1/3) ... [2025-03-14 00:44:49,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f413adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:44:49, skipping insertion in model container [2025-03-14 00:44:49,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:48" (2/3) ... [2025-03-14 00:44:49,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f413adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:44:49, skipping insertion in model container [2025-03-14 00:44:49,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:44:49" (3/3) ... [2025-03-14 00:44:49,045 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longer-1.i [2025-03-14 00:44:49,059 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:44:49,060 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longer-1.i that has 3 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-14 00:44:49,060 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:44:49,088 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:44:49,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2025-03-14 00:44:49,134 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-03-14 00:44:49,139 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:44:49,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-03-14 00:44:49,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2025-03-14 00:44:49,144 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2025-03-14 00:44:49,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:44:49,162 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b390c11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:44:49,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 00:44:49,168 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:44:49,168 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-03-14 00:44:49,171 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:44:49,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:49,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:49,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:44:49,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:49,177 INFO L85 PathProgramCache]: Analyzing trace with hash 341173780, now seen corresponding path program 1 times [2025-03-14 00:44:49,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:49,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638359281] [2025-03-14 00:44:49,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:49,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:49,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 00:44:49,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 00:44:49,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:49,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:49,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:49,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638359281] [2025-03-14 00:44:49,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638359281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:44:49,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:44:49,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:44:49,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012386709] [2025-03-14 00:44:49,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:44:49,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:44:49,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:49,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:44:49,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:44:49,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:44:49,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:49,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:49,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:44:49,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:49,763 INFO L124 PetriNetUnfolderBase]: 321/540 cut-off events. [2025-03-14 00:44:49,764 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 00:44:49,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 540 events. 321/540 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2134 event pairs, 62 based on Foata normal form. 12/535 useless extension candidates. Maximal degree in co-relation 1042. Up to 221 conditions per place. [2025-03-14 00:44:49,769 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2025-03-14 00:44:49,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2025-03-14 00:44:49,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:44:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:44:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-03-14 00:44:49,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-14 00:44:49,782 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 6 states and 84 transitions. [2025-03-14 00:44:49,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 54 transitions, 216 flow [2025-03-14 00:44:49,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:44:49,790 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 71 flow [2025-03-14 00:44:49,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2025-03-14 00:44:49,794 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2025-03-14 00:44:49,794 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 71 flow [2025-03-14 00:44:49,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:49,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:49,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:49,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:44:49,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:44:49,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:49,796 INFO L85 PathProgramCache]: Analyzing trace with hash -26154638, now seen corresponding path program 1 times [2025-03-14 00:44:49,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:49,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124355757] [2025-03-14 00:44:49,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:49,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:49,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-14 00:44:49,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-14 00:44:49,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:49,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:49,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:49,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124355757] [2025-03-14 00:44:49,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124355757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:44:49,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:44:49,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:44:49,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624594076] [2025-03-14 00:44:49,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:44:49,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:44:49,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:49,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:44:49,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:44:49,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:44:49,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:49,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:49,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:44:49,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:50,195 INFO L124 PetriNetUnfolderBase]: 382/687 cut-off events. [2025-03-14 00:44:50,195 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2025-03-14 00:44:50,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 687 events. 382/687 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2911 event pairs, 65 based on Foata normal form. 27/710 useless extension candidates. Maximal degree in co-relation 1570. Up to 246 conditions per place. [2025-03-14 00:44:50,200 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 9 changer transitions 20/78 dead transitions. [2025-03-14 00:44:50,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 78 transitions, 379 flow [2025-03-14 00:44:50,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 00:44:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 00:44:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2025-03-14 00:44:50,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-14 00:44:50,203 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 71 flow. Second operand 9 states and 117 transitions. [2025-03-14 00:44:50,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 78 transitions, 379 flow [2025-03-14 00:44:50,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 363 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-14 00:44:50,208 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 156 flow [2025-03-14 00:44:50,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2025-03-14 00:44:50,209 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2025-03-14 00:44:50,209 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 156 flow [2025-03-14 00:44:50,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:50,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:50,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:50,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:44:50,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:44:50,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:50,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1984146738, now seen corresponding path program 2 times [2025-03-14 00:44:50,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:50,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306127498] [2025-03-14 00:44:50,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:44:50,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:50,217 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-03-14 00:44:50,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-14 00:44:50,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:44:50,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:50,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:50,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306127498] [2025-03-14 00:44:50,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306127498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:44:50,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:44:50,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:44:50,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132442268] [2025-03-14 00:44:50,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:44:50,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:44:50,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:50,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:44:50,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:44:50,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:44:50,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:50,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:50,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:44:50,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:50,508 INFO L124 PetriNetUnfolderBase]: 328/603 cut-off events. [2025-03-14 00:44:50,508 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2025-03-14 00:44:50,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1732 conditions, 603 events. 328/603 cut-off events. For 971/971 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2513 event pairs, 65 based on Foata normal form. 45/644 useless extension candidates. Maximal degree in co-relation 1711. Up to 234 conditions per place. [2025-03-14 00:44:50,511 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 9 changer transitions 28/78 dead transitions. [2025-03-14 00:44:50,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 496 flow [2025-03-14 00:44:50,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 00:44:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 00:44:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-03-14 00:44:50,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2025-03-14 00:44:50,513 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 156 flow. Second operand 8 states and 103 transitions. [2025-03-14 00:44:50,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 496 flow [2025-03-14 00:44:50,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 488 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-14 00:44:50,517 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 210 flow [2025-03-14 00:44:50,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2025-03-14 00:44:50,518 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-03-14 00:44:50,518 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 210 flow [2025-03-14 00:44:50,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:50,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:50,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:50,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:44:50,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:44:50,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:50,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1835947173, now seen corresponding path program 1 times [2025-03-14 00:44:50,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:50,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889386914] [2025-03-14 00:44:50,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:50,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:50,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 00:44:50,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 00:44:50,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:50,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:50,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:50,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889386914] [2025-03-14 00:44:50,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889386914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:44:50,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:44:50,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:44:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199010841] [2025-03-14 00:44:50,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:44:50,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:44:50,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:50,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:44:50,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:44:50,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:44:50,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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-03-14 00:44:50,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:50,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:44:50,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:50,790 INFO L124 PetriNetUnfolderBase]: 355/654 cut-off events. [2025-03-14 00:44:50,790 INFO L125 PetriNetUnfolderBase]: For 1747/1747 co-relation queries the response was YES. [2025-03-14 00:44:50,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 654 events. 355/654 cut-off events. For 1747/1747 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2816 event pairs, 86 based on Foata normal form. 18/668 useless extension candidates. Maximal degree in co-relation 2034. Up to 258 conditions per place. [2025-03-14 00:44:50,794 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 43 selfloop transitions, 16 changer transitions 21/83 dead transitions. [2025-03-14 00:44:50,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 83 transitions, 597 flow [2025-03-14 00:44:50,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 00:44:50,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 00:44:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2025-03-14 00:44:50,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2025-03-14 00:44:50,797 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 210 flow. Second operand 9 states and 113 transitions. [2025-03-14 00:44:50,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 83 transitions, 597 flow [2025-03-14 00:44:50,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 527 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-03-14 00:44:50,806 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 297 flow [2025-03-14 00:44:50,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=297, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2025-03-14 00:44:50,808 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2025-03-14 00:44:50,808 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 297 flow [2025-03-14 00:44:50,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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-03-14 00:44:50,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:50,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:50,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:44:50,809 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:44:50,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash 765975209, now seen corresponding path program 2 times [2025-03-14 00:44:50,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:50,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841225348] [2025-03-14 00:44:50,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:44:50,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:50,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-14 00:44:50,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 00:44:50,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:44:50,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:50,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:50,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841225348] [2025-03-14 00:44:50,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841225348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:44:50,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:44:50,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:44:50,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417906104] [2025-03-14 00:44:50,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:44:50,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:44:50,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:50,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:44:50,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:44:50,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:44:50,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 297 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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-03-14 00:44:50,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:50,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:44:50,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:51,119 INFO L124 PetriNetUnfolderBase]: 427/784 cut-off events. [2025-03-14 00:44:51,119 INFO L125 PetriNetUnfolderBase]: For 2386/2386 co-relation queries the response was YES. [2025-03-14 00:44:51,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2553 conditions, 784 events. 427/784 cut-off events. For 2386/2386 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3460 event pairs, 71 based on Foata normal form. 27/806 useless extension candidates. Maximal degree in co-relation 2526. Up to 223 conditions per place. [2025-03-14 00:44:51,124 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 43 selfloop transitions, 20 changer transitions 28/94 dead transitions. [2025-03-14 00:44:51,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 94 transitions, 707 flow [2025-03-14 00:44:51,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:44:51,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:44:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2025-03-14 00:44:51,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-03-14 00:44:51,125 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 297 flow. Second operand 10 states and 125 transitions. [2025-03-14 00:44:51,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 94 transitions, 707 flow [2025-03-14 00:44:51,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 661 flow, removed 19 selfloop flow, removed 3 redundant places. [2025-03-14 00:44:51,132 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 378 flow [2025-03-14 00:44:51,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=378, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2025-03-14 00:44:51,132 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 36 predicate places. [2025-03-14 00:44:51,132 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 378 flow [2025-03-14 00:44:51,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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-03-14 00:44:51,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:51,133 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:51,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:44:51,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:44:51,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2043010608, now seen corresponding path program 1 times [2025-03-14 00:44:51,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:51,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258666622] [2025-03-14 00:44:51,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:51,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:51,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:44:51,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 00:44:51,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:51,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:51,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:51,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258666622] [2025-03-14 00:44:51,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258666622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:44:51,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:44:51,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 00:44:51,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307609003] [2025-03-14 00:44:51,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:44:51,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:44:51,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:51,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:44:51,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:44:51,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:44:51,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 378 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:51,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:51,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:44:51,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:51,459 INFO L124 PetriNetUnfolderBase]: 454/835 cut-off events. [2025-03-14 00:44:51,459 INFO L125 PetriNetUnfolderBase]: For 3899/3899 co-relation queries the response was YES. [2025-03-14 00:44:51,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3042 conditions, 835 events. 454/835 cut-off events. For 3899/3899 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3749 event pairs, 59 based on Foata normal form. 18/848 useless extension candidates. Maximal degree in co-relation 3010. Up to 157 conditions per place. [2025-03-14 00:44:51,478 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 44 selfloop transitions, 26 changer transitions 23/96 dead transitions. [2025-03-14 00:44:51,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 96 transitions, 830 flow [2025-03-14 00:44:51,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:44:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:44:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2025-03-14 00:44:51,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-03-14 00:44:51,480 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 378 flow. Second operand 10 states and 125 transitions. [2025-03-14 00:44:51,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 96 transitions, 830 flow [2025-03-14 00:44:51,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 787 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-03-14 00:44:51,492 INFO L231 Difference]: Finished difference. Result has 67 places, 48 transitions, 473 flow [2025-03-14 00:44:51,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=473, PETRI_PLACES=67, PETRI_TRANSITIONS=48} [2025-03-14 00:44:51,493 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 41 predicate places. [2025-03-14 00:44:51,494 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 473 flow [2025-03-14 00:44:51,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:51,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:51,494 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:51,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:44:51,494 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:44:51,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:51,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1280864345, now seen corresponding path program 1 times [2025-03-14 00:44:51,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:51,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865423074] [2025-03-14 00:44:51,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:51,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:51,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:44:51,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 00:44:51,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:51,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:51,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:51,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865423074] [2025-03-14 00:44:51,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865423074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:44:51,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121027649] [2025-03-14 00:44:51,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:51,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:51,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:51,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:44:51,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 00:44:51,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:44:51,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 00:44:51,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:51,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:51,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-14 00:44:51,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:44:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:51,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:44:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:51,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121027649] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:44:51,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:44:51,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-14 00:44:51,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395386178] [2025-03-14 00:44:51,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:44:51,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 00:44:51,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:51,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 00:44:51,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-14 00:44:51,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:44:51,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 48 transitions, 473 flow. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:51,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:51,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:44:51,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:52,222 INFO L124 PetriNetUnfolderBase]: 598/1110 cut-off events. [2025-03-14 00:44:52,223 INFO L125 PetriNetUnfolderBase]: For 8677/8677 co-relation queries the response was YES. [2025-03-14 00:44:52,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4558 conditions, 1110 events. 598/1110 cut-off events. For 8677/8677 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4806 event pairs, 149 based on Foata normal form. 63/1169 useless extension candidates. Maximal degree in co-relation 4524. Up to 504 conditions per place. [2025-03-14 00:44:52,228 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 65 selfloop transitions, 19 changer transitions 67/154 dead transitions. [2025-03-14 00:44:52,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 154 transitions, 1477 flow [2025-03-14 00:44:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 00:44:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 00:44:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2025-03-14 00:44:52,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2025-03-14 00:44:52,230 INFO L175 Difference]: Start difference. First operand has 67 places, 48 transitions, 473 flow. Second operand 19 states and 231 transitions. [2025-03-14 00:44:52,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 154 transitions, 1477 flow [2025-03-14 00:44:52,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 154 transitions, 1383 flow, removed 30 selfloop flow, removed 7 redundant places. [2025-03-14 00:44:52,240 INFO L231 Difference]: Finished difference. Result has 89 places, 54 transitions, 600 flow [2025-03-14 00:44:52,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=600, PETRI_PLACES=89, PETRI_TRANSITIONS=54} [2025-03-14 00:44:52,240 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 63 predicate places. [2025-03-14 00:44:52,241 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 54 transitions, 600 flow [2025-03-14 00:44:52,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:52,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:52,241 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:52,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 00:44:52,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:52,442 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:44:52,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:52,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1919587151, now seen corresponding path program 2 times [2025-03-14 00:44:52,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:52,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066796635] [2025-03-14 00:44:52,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:44:52,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:52,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:44:52,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 00:44:52,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:44:52,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:52,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:52,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066796635] [2025-03-14 00:44:52,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066796635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:44:52,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:44:52,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 00:44:52,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344740635] [2025-03-14 00:44:52,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:44:52,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:44:52,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:52,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:44:52,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:44:52,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:44:52,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 54 transitions, 600 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:52,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:52,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:44:52,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:52,840 INFO L124 PetriNetUnfolderBase]: 679/1277 cut-off events. [2025-03-14 00:44:52,840 INFO L125 PetriNetUnfolderBase]: For 21747/21747 co-relation queries the response was YES. [2025-03-14 00:44:52,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6520 conditions, 1277 events. 679/1277 cut-off events. For 21747/21747 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6078 event pairs, 144 based on Foata normal form. 27/1300 useless extension candidates. Maximal degree in co-relation 6475. Up to 501 conditions per place. [2025-03-14 00:44:52,853 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 77 selfloop transitions, 25 changer transitions 31/136 dead transitions. [2025-03-14 00:44:52,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 136 transitions, 1624 flow [2025-03-14 00:44:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 00:44:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 00:44:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 187 transitions. [2025-03-14 00:44:52,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2025-03-14 00:44:52,854 INFO L175 Difference]: Start difference. First operand has 89 places, 54 transitions, 600 flow. Second operand 15 states and 187 transitions. [2025-03-14 00:44:52,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 136 transitions, 1624 flow [2025-03-14 00:44:52,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 136 transitions, 1289 flow, removed 155 selfloop flow, removed 12 redundant places. [2025-03-14 00:44:52,880 INFO L231 Difference]: Finished difference. Result has 91 places, 60 transitions, 660 flow [2025-03-14 00:44:52,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=660, PETRI_PLACES=91, PETRI_TRANSITIONS=60} [2025-03-14 00:44:52,882 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 65 predicate places. [2025-03-14 00:44:52,883 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 60 transitions, 660 flow [2025-03-14 00:44:52,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:52,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:52,883 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:52,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:44:52,883 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:44:52,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:52,884 INFO L85 PathProgramCache]: Analyzing trace with hash -367922341, now seen corresponding path program 3 times [2025-03-14 00:44:52,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:52,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780271371] [2025-03-14 00:44:52,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:44:52,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:52,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:44:52,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 00:44:52,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 00:44:52,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:52,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:52,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780271371] [2025-03-14 00:44:52,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780271371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:44:52,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:44:52,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 00:44:52,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184294506] [2025-03-14 00:44:52,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:44:52,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:44:52,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:52,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:44:52,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:44:53,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:44:53,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 60 transitions, 660 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:53,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:53,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:44:53,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:53,289 INFO L124 PetriNetUnfolderBase]: 652/1221 cut-off events. [2025-03-14 00:44:53,289 INFO L125 PetriNetUnfolderBase]: For 17066/17066 co-relation queries the response was YES. [2025-03-14 00:44:53,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5845 conditions, 1221 events. 652/1221 cut-off events. For 17066/17066 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5766 event pairs, 124 based on Foata normal form. 45/1262 useless extension candidates. Maximal degree in co-relation 5800. Up to 388 conditions per place. [2025-03-14 00:44:53,295 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 66 selfloop transitions, 31 changer transitions 41/141 dead transitions. [2025-03-14 00:44:53,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 141 transitions, 1612 flow [2025-03-14 00:44:53,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 00:44:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 00:44:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 186 transitions. [2025-03-14 00:44:53,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-03-14 00:44:53,296 INFO L175 Difference]: Start difference. First operand has 91 places, 60 transitions, 660 flow. Second operand 15 states and 186 transitions. [2025-03-14 00:44:53,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 141 transitions, 1612 flow [2025-03-14 00:44:53,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 141 transitions, 1428 flow, removed 76 selfloop flow, removed 8 redundant places. [2025-03-14 00:44:53,316 INFO L231 Difference]: Finished difference. Result has 100 places, 63 transitions, 725 flow [2025-03-14 00:44:53,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=725, PETRI_PLACES=100, PETRI_TRANSITIONS=63} [2025-03-14 00:44:53,316 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 74 predicate places. [2025-03-14 00:44:53,316 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 63 transitions, 725 flow [2025-03-14 00:44:53,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:53,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:53,317 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:53,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:44:53,317 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:44:53,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2054294134, now seen corresponding path program 1 times [2025-03-14 00:44:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:53,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070939388] [2025-03-14 00:44:53,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:53,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:53,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 00:44:53,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 00:44:53,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:53,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:53,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:53,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070939388] [2025-03-14 00:44:53,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070939388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:44:53,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:44:53,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:44:53,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221842807] [2025-03-14 00:44:53,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:44:53,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 00:44:53,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:53,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 00:44:53,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-14 00:44:53,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:44:53,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 63 transitions, 725 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 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-03-14 00:44:53,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:53,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:44:53,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:53,673 INFO L124 PetriNetUnfolderBase]: 688/1315 cut-off events. [2025-03-14 00:44:53,673 INFO L125 PetriNetUnfolderBase]: For 19979/19979 co-relation queries the response was YES. [2025-03-14 00:44:53,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6335 conditions, 1315 events. 688/1315 cut-off events. For 19979/19979 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6484 event pairs, 111 based on Foata normal form. 27/1337 useless extension candidates. Maximal degree in co-relation 6288. Up to 406 conditions per place. [2025-03-14 00:44:53,681 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 66 selfloop transitions, 35 changer transitions 35/139 dead transitions. [2025-03-14 00:44:53,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 139 transitions, 1657 flow [2025-03-14 00:44:53,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 00:44:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 00:44:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 171 transitions. [2025-03-14 00:44:53,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2025-03-14 00:44:53,682 INFO L175 Difference]: Start difference. First operand has 100 places, 63 transitions, 725 flow. Second operand 14 states and 171 transitions. [2025-03-14 00:44:53,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 139 transitions, 1657 flow [2025-03-14 00:44:53,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 139 transitions, 1517 flow, removed 43 selfloop flow, removed 13 redundant places. [2025-03-14 00:44:53,710 INFO L231 Difference]: Finished difference. Result has 103 places, 70 transitions, 833 flow [2025-03-14 00:44:53,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=833, PETRI_PLACES=103, PETRI_TRANSITIONS=70} [2025-03-14 00:44:53,710 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 77 predicate places. [2025-03-14 00:44:53,710 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 70 transitions, 833 flow [2025-03-14 00:44:53,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 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-03-14 00:44:53,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:53,711 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:53,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 00:44:53,711 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:44:53,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:53,711 INFO L85 PathProgramCache]: Analyzing trace with hash -202857574, now seen corresponding path program 2 times [2025-03-14 00:44:53,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:53,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384854688] [2025-03-14 00:44:53,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:44:53,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:53,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-14 00:44:53,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 00:44:53,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:44:53,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:53,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:53,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:53,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384854688] [2025-03-14 00:44:53,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384854688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:44:53,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624857376] [2025-03-14 00:44:53,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:44:53,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:53,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:53,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:44:53,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 00:44:53,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-14 00:44:53,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 00:44:53,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:44:53,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:53,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 00:44:53,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:44:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:53,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:44:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:53,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624857376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:44:53,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:44:53,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-14 00:44:53,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798747852] [2025-03-14 00:44:53,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:44:53,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 00:44:53,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:53,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 00:44:53,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-14 00:44:54,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:44:54,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 70 transitions, 833 flow. Second operand has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:54,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:54,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:44:54,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:54,595 INFO L124 PetriNetUnfolderBase]: 1147/2131 cut-off events. [2025-03-14 00:44:54,595 INFO L125 PetriNetUnfolderBase]: For 52668/52668 co-relation queries the response was YES. [2025-03-14 00:44:54,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12407 conditions, 2131 events. 1147/2131 cut-off events. For 52668/52668 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 10605 event pairs, 47 based on Foata normal form. 81/2207 useless extension candidates. Maximal degree in co-relation 12358. Up to 372 conditions per place. [2025-03-14 00:44:54,609 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 101 selfloop transitions, 68 changer transitions 93/265 dead transitions. [2025-03-14 00:44:54,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 265 transitions, 3655 flow [2025-03-14 00:44:54,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-14 00:44:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-14 00:44:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 384 transitions. [2025-03-14 00:44:54,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2025-03-14 00:44:54,612 INFO L175 Difference]: Start difference. First operand has 103 places, 70 transitions, 833 flow. Second operand 31 states and 384 transitions. [2025-03-14 00:44:54,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 265 transitions, 3655 flow [2025-03-14 00:44:54,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 265 transitions, 3180 flow, removed 211 selfloop flow, removed 10 redundant places. [2025-03-14 00:44:54,649 INFO L231 Difference]: Finished difference. Result has 143 places, 91 transitions, 1492 flow [2025-03-14 00:44:54,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1492, PETRI_PLACES=143, PETRI_TRANSITIONS=91} [2025-03-14 00:44:54,650 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 117 predicate places. [2025-03-14 00:44:54,650 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 91 transitions, 1492 flow [2025-03-14 00:44:54,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:54,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:54,650 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:54,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 00:44:54,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-14 00:44:54,854 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:44:54,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:54,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1731581859, now seen corresponding path program 3 times [2025-03-14 00:44:54,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:54,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956714971] [2025-03-14 00:44:54,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:44:54,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:54,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-14 00:44:54,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 00:44:54,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-14 00:44:54,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:55,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:55,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956714971] [2025-03-14 00:44:55,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956714971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:44:55,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997081231] [2025-03-14 00:44:55,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:44:55,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:55,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:55,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:44:55,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 00:44:55,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-14 00:44:55,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 00:44:55,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-14 00:44:55,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:55,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-14 00:44:55,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:44:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:55,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:44:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997081231] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:44:55,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:44:55,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-14 00:44:55,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306316619] [2025-03-14 00:44:55,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:44:55,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-14 00:44:55,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:55,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-14 00:44:55,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2025-03-14 00:44:55,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:44:55,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 91 transitions, 1492 flow. Second operand has 22 states, 22 states have (on average 7.045454545454546) internal successors, (155), 22 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:55,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:55,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:44:55,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:56,422 INFO L124 PetriNetUnfolderBase]: 1669/3067 cut-off events. [2025-03-14 00:44:56,423 INFO L125 PetriNetUnfolderBase]: For 177050/177050 co-relation queries the response was YES. [2025-03-14 00:44:56,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23517 conditions, 3067 events. 1669/3067 cut-off events. For 177050/177050 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 15360 event pairs, 48 based on Foata normal form. 144/3207 useless extension candidates. Maximal degree in co-relation 23448. Up to 588 conditions per place. [2025-03-14 00:44:56,444 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 140 selfloop transitions, 103 changer transitions 147/393 dead transitions. [2025-03-14 00:44:56,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 393 transitions, 7360 flow [2025-03-14 00:44:56,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-14 00:44:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-14 00:44:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 565 transitions. [2025-03-14 00:44:56,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5117753623188406 [2025-03-14 00:44:56,447 INFO L175 Difference]: Start difference. First operand has 143 places, 91 transitions, 1492 flow. Second operand 46 states and 565 transitions. [2025-03-14 00:44:56,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 393 transitions, 7360 flow [2025-03-14 00:44:56,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 393 transitions, 6058 flow, removed 623 selfloop flow, removed 16 redundant places. [2025-03-14 00:44:56,554 INFO L231 Difference]: Finished difference. Result has 192 places, 127 transitions, 2416 flow [2025-03-14 00:44:56,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=2416, PETRI_PLACES=192, PETRI_TRANSITIONS=127} [2025-03-14 00:44:56,554 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 166 predicate places. [2025-03-14 00:44:56,555 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 127 transitions, 2416 flow [2025-03-14 00:44:56,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.045454545454546) internal successors, (155), 22 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:56,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:56,555 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:56,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 00:44:56,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:56,756 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:44:56,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:56,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1157440381, now seen corresponding path program 4 times [2025-03-14 00:44:56,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:56,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843918980] [2025-03-14 00:44:56,756 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:44:56,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:56,761 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 48 statements into 2 equivalence classes. [2025-03-14 00:44:56,766 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-14 00:44:56,767 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:44:56,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:57,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:57,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843918980] [2025-03-14 00:44:57,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843918980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:44:57,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523135442] [2025-03-14 00:44:57,023 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:44:57,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:57,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:57,025 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:44:57,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 00:44:57,057 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 48 statements into 2 equivalence classes. [2025-03-14 00:44:57,071 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-14 00:44:57,071 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:44:57,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:57,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-14 00:44:57,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:44:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:57,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:44:57,372 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:57,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523135442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:44:57,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:44:57,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2025-03-14 00:44:57,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669142937] [2025-03-14 00:44:57,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:44:57,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-14 00:44:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:57,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-14 00:44:57,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2025-03-14 00:44:57,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:44:57,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 127 transitions, 2416 flow. Second operand has 34 states, 34 states have (on average 7.029411764705882) internal successors, (239), 34 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:57,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:57,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:44:57,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:58,762 INFO L124 PetriNetUnfolderBase]: 2065/3773 cut-off events. [2025-03-14 00:44:58,763 INFO L125 PetriNetUnfolderBase]: For 355602/355602 co-relation queries the response was YES. [2025-03-14 00:44:58,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33323 conditions, 3773 events. 2065/3773 cut-off events. For 355602/355602 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 18082 event pairs, 59 based on Foata normal form. 72/3840 useless extension candidates. Maximal degree in co-relation 33234. Up to 732 conditions per place. [2025-03-14 00:44:58,790 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 160 selfloop transitions, 135 changer transitions 129/427 dead transitions. [2025-03-14 00:44:58,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 427 transitions, 9512 flow [2025-03-14 00:44:58,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-14 00:44:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-14 00:44:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 587 transitions. [2025-03-14 00:44:58,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5095486111111112 [2025-03-14 00:44:58,793 INFO L175 Difference]: Start difference. First operand has 192 places, 127 transitions, 2416 flow. Second operand 48 states and 587 transitions. [2025-03-14 00:44:58,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 427 transitions, 9512 flow [2025-03-14 00:44:59,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 427 transitions, 7611 flow, removed 915 selfloop flow, removed 25 redundant places. [2025-03-14 00:44:59,088 INFO L231 Difference]: Finished difference. Result has 225 places, 161 transitions, 3127 flow [2025-03-14 00:44:59,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1611, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=3127, PETRI_PLACES=225, PETRI_TRANSITIONS=161} [2025-03-14 00:44:59,089 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 199 predicate places. [2025-03-14 00:44:59,089 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 161 transitions, 3127 flow [2025-03-14 00:44:59,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.029411764705882) internal successors, (239), 34 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:59,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:59,089 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:59,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-14 00:44:59,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:59,290 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:44:59,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:59,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1019684591, now seen corresponding path program 5 times [2025-03-14 00:44:59,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:59,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420854796] [2025-03-14 00:44:59,291 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:44:59,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:59,296 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 66 statements into 13 equivalence classes. [2025-03-14 00:44:59,307 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 00:44:59,307 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-14 00:44:59,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:59,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:59,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420854796] [2025-03-14 00:44:59,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420854796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:44:59,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450718466] [2025-03-14 00:44:59,683 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:44:59,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:59,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:59,685 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:44:59,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 00:44:59,717 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 66 statements into 13 equivalence classes. [2025-03-14 00:44:59,733 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 00:44:59,734 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-14 00:44:59,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:59,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-14 00:44:59,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:44:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:59,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:45:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:00,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450718466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:45:00,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:45:00,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 28 [2025-03-14 00:45:00,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878814684] [2025-03-14 00:45:00,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:45:00,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-14 00:45:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:00,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-14 00:45:00,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2025-03-14 00:45:00,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:45:00,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 161 transitions, 3127 flow. Second operand has 29 states, 29 states have (on average 7.172413793103448) internal successors, (208), 29 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:00,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:00,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:45:00,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:01,371 INFO L124 PetriNetUnfolderBase]: 2191/4113 cut-off events. [2025-03-14 00:45:01,371 INFO L125 PetriNetUnfolderBase]: For 467511/467511 co-relation queries the response was YES. [2025-03-14 00:45:01,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36888 conditions, 4113 events. 2191/4113 cut-off events. For 467511/467511 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 20736 event pairs, 797 based on Foata normal form. 63/4172 useless extension candidates. Maximal degree in co-relation 36791. Up to 2880 conditions per place. [2025-03-14 00:45:01,408 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 220 selfloop transitions, 35 changer transitions 99/357 dead transitions. [2025-03-14 00:45:01,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 357 transitions, 8392 flow [2025-03-14 00:45:01,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 00:45:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 00:45:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 407 transitions. [2025-03-14 00:45:01,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4845238095238095 [2025-03-14 00:45:01,410 INFO L175 Difference]: Start difference. First operand has 225 places, 161 transitions, 3127 flow. Second operand 35 states and 407 transitions. [2025-03-14 00:45:01,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 357 transitions, 8392 flow [2025-03-14 00:45:01,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 357 transitions, 6625 flow, removed 806 selfloop flow, removed 26 redundant places. [2025-03-14 00:45:01,910 INFO L231 Difference]: Finished difference. Result has 248 places, 177 transitions, 2899 flow [2025-03-14 00:45:01,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2899, PETRI_PLACES=248, PETRI_TRANSITIONS=177} [2025-03-14 00:45:01,911 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 222 predicate places. [2025-03-14 00:45:01,911 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 177 transitions, 2899 flow [2025-03-14 00:45:01,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.172413793103448) internal successors, (208), 29 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:01,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:01,911 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:01,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-14 00:45:02,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-14 00:45:02,112 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:45:02,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:02,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1747646223, now seen corresponding path program 6 times [2025-03-14 00:45:02,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:02,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120998438] [2025-03-14 00:45:02,113 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 00:45:02,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:02,119 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 66 statements into 9 equivalence classes. [2025-03-14 00:45:02,134 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 00:45:02,134 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-14 00:45:02,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:02,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:02,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120998438] [2025-03-14 00:45:02,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120998438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:45:02,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816639156] [2025-03-14 00:45:02,465 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 00:45:02,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:02,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:02,467 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:45:02,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 00:45:02,496 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 66 statements into 9 equivalence classes. [2025-03-14 00:45:02,513 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 00:45:02,513 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-14 00:45:02,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:02,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-14 00:45:02,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:45:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:02,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:45:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:02,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816639156] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:45:02,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:45:02,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 30 [2025-03-14 00:45:02,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300561677] [2025-03-14 00:45:02,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:45:02,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-14 00:45:02,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:02,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-14 00:45:02,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2025-03-14 00:45:02,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:45:02,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 177 transitions, 2899 flow. Second operand has 31 states, 31 states have (on average 7.161290322580645) internal successors, (222), 31 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:02,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:02,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:45:02,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:04,263 INFO L124 PetriNetUnfolderBase]: 2659/5182 cut-off events. [2025-03-14 00:45:04,263 INFO L125 PetriNetUnfolderBase]: For 534264/534264 co-relation queries the response was YES. [2025-03-14 00:45:04,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43686 conditions, 5182 events. 2659/5182 cut-off events. For 534264/534264 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 28624 event pairs, 620 based on Foata normal form. 63/5241 useless extension candidates. Maximal degree in co-relation 43575. Up to 2314 conditions per place. [2025-03-14 00:45:04,304 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 218 selfloop transitions, 114 changer transitions 113/448 dead transitions. [2025-03-14 00:45:04,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 448 transitions, 9253 flow [2025-03-14 00:45:04,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-14 00:45:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-14 00:45:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 493 transitions. [2025-03-14 00:45:04,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48908730158730157 [2025-03-14 00:45:04,305 INFO L175 Difference]: Start difference. First operand has 248 places, 177 transitions, 2899 flow. Second operand 42 states and 493 transitions. [2025-03-14 00:45:04,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 448 transitions, 9253 flow [2025-03-14 00:45:05,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 448 transitions, 8553 flow, removed 331 selfloop flow, removed 18 redundant places. [2025-03-14 00:45:05,058 INFO L231 Difference]: Finished difference. Result has 289 places, 230 transitions, 4220 flow [2025-03-14 00:45:05,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2499, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=4220, PETRI_PLACES=289, PETRI_TRANSITIONS=230} [2025-03-14 00:45:05,059 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 263 predicate places. [2025-03-14 00:45:05,059 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 230 transitions, 4220 flow [2025-03-14 00:45:05,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.161290322580645) internal successors, (222), 31 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:05,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:05,059 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:05,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-14 00:45:05,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-14 00:45:05,260 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:45:05,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:05,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1318833773, now seen corresponding path program 7 times [2025-03-14 00:45:05,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:05,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165538405] [2025-03-14 00:45:05,262 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 00:45:05,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:05,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-14 00:45:05,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 00:45:05,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:05,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:05,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:05,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165538405] [2025-03-14 00:45:05,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165538405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:45:05,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277745398] [2025-03-14 00:45:05,614 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 00:45:05,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:05,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:05,616 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:45:05,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 00:45:05,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-14 00:45:05,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 00:45:05,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:05,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:05,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-14 00:45:05,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:45:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 1 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:05,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:45:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:06,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277745398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:45:06,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:45:06,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 33 [2025-03-14 00:45:06,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050686323] [2025-03-14 00:45:06,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:45:06,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-14 00:45:06,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:06,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-14 00:45:06,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2025-03-14 00:45:06,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:45:06,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 230 transitions, 4220 flow. Second operand has 34 states, 34 states have (on average 7.235294117647059) internal successors, (246), 34 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:06,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:06,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:45:06,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:07,983 INFO L124 PetriNetUnfolderBase]: 2947/5837 cut-off events. [2025-03-14 00:45:07,983 INFO L125 PetriNetUnfolderBase]: For 735312/735312 co-relation queries the response was YES. [2025-03-14 00:45:08,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53293 conditions, 5837 events. 2947/5837 cut-off events. For 735312/735312 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 33300 event pairs, 378 based on Foata normal form. 63/5896 useless extension candidates. Maximal degree in co-relation 53164. Up to 1450 conditions per place. [2025-03-14 00:45:08,034 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 201 selfloop transitions, 183 changer transitions 121/508 dead transitions. [2025-03-14 00:45:08,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 508 transitions, 11541 flow [2025-03-14 00:45:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-14 00:45:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-14 00:45:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 547 transitions. [2025-03-14 00:45:08,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4954710144927536 [2025-03-14 00:45:08,035 INFO L175 Difference]: Start difference. First operand has 289 places, 230 transitions, 4220 flow. Second operand 46 states and 547 transitions. [2025-03-14 00:45:08,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 508 transitions, 11541 flow [2025-03-14 00:45:09,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 508 transitions, 10381 flow, removed 550 selfloop flow, removed 19 redundant places. [2025-03-14 00:45:09,320 INFO L231 Difference]: Finished difference. Result has 330 places, 263 transitions, 5266 flow [2025-03-14 00:45:09,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3644, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=5266, PETRI_PLACES=330, PETRI_TRANSITIONS=263} [2025-03-14 00:45:09,320 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 304 predicate places. [2025-03-14 00:45:09,320 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 263 transitions, 5266 flow [2025-03-14 00:45:09,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.235294117647059) internal successors, (246), 34 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:09,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:09,321 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:09,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-14 00:45:09,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:09,522 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:45:09,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:09,522 INFO L85 PathProgramCache]: Analyzing trace with hash 526555759, now seen corresponding path program 8 times [2025-03-14 00:45:09,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:09,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250185553] [2025-03-14 00:45:09,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:45:09,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:09,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-03-14 00:45:09,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 00:45:09,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:45:09,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:09,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:09,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250185553] [2025-03-14 00:45:09,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250185553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:45:09,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915899408] [2025-03-14 00:45:09,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:45:09,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:09,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:09,777 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:45:09,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-14 00:45:09,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-03-14 00:45:09,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 00:45:09,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:45:09,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:09,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-14 00:45:09,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:45:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:09,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:45:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:10,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915899408] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:45:10,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:45:10,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 31 [2025-03-14 00:45:10,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135380819] [2025-03-14 00:45:10,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:45:10,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-14 00:45:10,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:10,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-14 00:45:10,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2025-03-14 00:45:10,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:45:10,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 263 transitions, 5266 flow. Second operand has 32 states, 32 states have (on average 7.25) internal successors, (232), 32 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:10,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:10,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:45:10,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:12,066 INFO L124 PetriNetUnfolderBase]: 3109/6197 cut-off events. [2025-03-14 00:45:12,067 INFO L125 PetriNetUnfolderBase]: For 908862/908862 co-relation queries the response was YES. [2025-03-14 00:45:12,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60091 conditions, 6197 events. 3109/6197 cut-off events. For 908862/908862 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 35817 event pairs, 174 based on Foata normal form. 63/6256 useless extension candidates. Maximal degree in co-relation 59946. Up to 1419 conditions per place. [2025-03-14 00:45:12,138 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 190 selfloop transitions, 233 changer transitions 131/557 dead transitions. [2025-03-14 00:45:12,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 557 transitions, 13194 flow [2025-03-14 00:45:12,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-14 00:45:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-03-14 00:45:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 612 transitions. [2025-03-14 00:45:12,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-14 00:45:12,141 INFO L175 Difference]: Start difference. First operand has 330 places, 263 transitions, 5266 flow. Second operand 51 states and 612 transitions. [2025-03-14 00:45:12,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 557 transitions, 13194 flow [2025-03-14 00:45:13,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 557 transitions, 11653 flow, removed 672 selfloop flow, removed 29 redundant places. [2025-03-14 00:45:13,628 INFO L231 Difference]: Finished difference. Result has 361 places, 282 transitions, 5989 flow [2025-03-14 00:45:13,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4517, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=5989, PETRI_PLACES=361, PETRI_TRANSITIONS=282} [2025-03-14 00:45:13,628 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 335 predicate places. [2025-03-14 00:45:13,629 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 282 transitions, 5989 flow [2025-03-14 00:45:13,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.25) internal successors, (232), 32 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:13,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:13,629 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:13,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-14 00:45:13,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-14 00:45:13,829 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:45:13,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:13,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1197826771, now seen corresponding path program 9 times [2025-03-14 00:45:13,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:13,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610036139] [2025-03-14 00:45:13,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:45:13,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:13,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 8 equivalence classes. [2025-03-14 00:45:13,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 00:45:13,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-14 00:45:13,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610036139] [2025-03-14 00:45:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610036139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:45:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502805655] [2025-03-14 00:45:14,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:45:14,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:14,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:14,076 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:45:14,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-14 00:45:14,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 8 equivalence classes. [2025-03-14 00:45:14,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 00:45:14,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-14 00:45:14,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:14,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-14 00:45:14,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:45:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 1 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:14,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:45:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:14,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502805655] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:45:14,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:45:14,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 33 [2025-03-14 00:45:14,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169544982] [2025-03-14 00:45:14,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:45:14,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-14 00:45:14,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:14,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-14 00:45:14,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2025-03-14 00:45:14,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:45:14,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 282 transitions, 5989 flow. Second operand has 34 states, 34 states have (on average 7.205882352941177) internal successors, (245), 34 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:14,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:14,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:45:14,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:16,743 INFO L124 PetriNetUnfolderBase]: 3424/6782 cut-off events. [2025-03-14 00:45:16,744 INFO L125 PetriNetUnfolderBase]: For 1025709/1025709 co-relation queries the response was YES. [2025-03-14 00:45:16,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67152 conditions, 6782 events. 3424/6782 cut-off events. For 1025709/1025709 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 39855 event pairs, 90 based on Foata normal form. 72/6850 useless extension candidates. Maximal degree in co-relation 66996. Up to 1551 conditions per place. [2025-03-14 00:45:16,804 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 196 selfloop transitions, 273 changer transitions 146/618 dead transitions. [2025-03-14 00:45:16,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 618 transitions, 15165 flow [2025-03-14 00:45:16,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-14 00:45:16,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-03-14 00:45:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 690 transitions. [2025-03-14 00:45:16,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5043859649122807 [2025-03-14 00:45:16,805 INFO L175 Difference]: Start difference. First operand has 361 places, 282 transitions, 5989 flow. Second operand 57 states and 690 transitions. [2025-03-14 00:45:16,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 618 transitions, 15165 flow [2025-03-14 00:45:18,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 618 transitions, 13880 flow, removed 481 selfloop flow, removed 39 redundant places. [2025-03-14 00:45:18,198 INFO L231 Difference]: Finished difference. Result has 390 places, 306 transitions, 6980 flow [2025-03-14 00:45:18,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=5132, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=6980, PETRI_PLACES=390, PETRI_TRANSITIONS=306} [2025-03-14 00:45:18,198 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 364 predicate places. [2025-03-14 00:45:18,198 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 306 transitions, 6980 flow [2025-03-14 00:45:18,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.205882352941177) internal successors, (245), 34 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:18,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:18,199 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:18,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-14 00:45:18,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-14 00:45:18,399 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:45:18,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:18,400 INFO L85 PathProgramCache]: Analyzing trace with hash -278455722, now seen corresponding path program 10 times [2025-03-14 00:45:18,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:18,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658105077] [2025-03-14 00:45:18,400 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:45:18,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:18,403 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-14 00:45:18,408 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 00:45:18,408 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:45:18,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:18,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:18,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658105077] [2025-03-14 00:45:18,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658105077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:45:18,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707325468] [2025-03-14 00:45:18,734 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:45:18,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:18,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:18,735 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:45:18,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-14 00:45:18,768 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-14 00:45:18,786 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 00:45:18,786 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:45:18,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:18,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-14 00:45:18,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:45:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:18,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:45:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:19,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707325468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:45:19,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:45:19,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2025-03-14 00:45:19,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558378463] [2025-03-14 00:45:19,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:45:19,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-14 00:45:19,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:19,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-14 00:45:19,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2025-03-14 00:45:19,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:45:19,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 306 transitions, 6980 flow. Second operand has 25 states, 25 states have (on average 6.92) internal successors, (173), 25 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:19,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:19,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:45:19,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:21,119 INFO L124 PetriNetUnfolderBase]: 3460/6951 cut-off events. [2025-03-14 00:45:21,119 INFO L125 PetriNetUnfolderBase]: For 1272269/1272269 co-relation queries the response was YES. [2025-03-14 00:45:21,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71924 conditions, 6951 events. 3460/6951 cut-off events. For 1272269/1272269 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 41596 event pairs, 257 based on Foata normal form. 27/6973 useless extension candidates. Maximal degree in co-relation 71755. Up to 1593 conditions per place. [2025-03-14 00:45:21,203 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 206 selfloop transitions, 256 changer transitions 99/564 dead transitions. [2025-03-14 00:45:21,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 564 transitions, 14386 flow [2025-03-14 00:45:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-14 00:45:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-14 00:45:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 542 transitions. [2025-03-14 00:45:21,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5018518518518519 [2025-03-14 00:45:21,205 INFO L175 Difference]: Start difference. First operand has 390 places, 306 transitions, 6980 flow. Second operand 45 states and 542 transitions. [2025-03-14 00:45:21,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 564 transitions, 14386 flow [2025-03-14 00:45:24,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 564 transitions, 12118 flow, removed 966 selfloop flow, removed 41 redundant places. [2025-03-14 00:45:24,310 INFO L231 Difference]: Finished difference. Result has 392 places, 321 transitions, 6915 flow [2025-03-14 00:45:24,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=5778, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=241, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=6915, PETRI_PLACES=392, PETRI_TRANSITIONS=321} [2025-03-14 00:45:24,311 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 366 predicate places. [2025-03-14 00:45:24,311 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 321 transitions, 6915 flow [2025-03-14 00:45:24,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.92) internal successors, (173), 25 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:24,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:24,311 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:24,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-14 00:45:24,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:24,512 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:45:24,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:24,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2044378676, now seen corresponding path program 11 times [2025-03-14 00:45:24,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:24,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678265678] [2025-03-14 00:45:24,513 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:45:24,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:24,517 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 8 equivalence classes. [2025-03-14 00:45:24,523 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 00:45:24,524 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-14 00:45:24,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:24,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678265678] [2025-03-14 00:45:24,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678265678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:45:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702220068] [2025-03-14 00:45:24,863 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:45:24,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:24,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:24,865 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:45:24,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-14 00:45:24,894 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 8 equivalence classes. [2025-03-14 00:45:24,909 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 00:45:24,909 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-14 00:45:24,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:24,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-14 00:45:24,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:45:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:24,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:45:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:25,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702220068] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:45:25,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:45:25,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 26 [2025-03-14 00:45:25,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789061236] [2025-03-14 00:45:25,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:45:25,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-14 00:45:25,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:25,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-14 00:45:25,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2025-03-14 00:45:25,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:45:25,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 321 transitions, 6915 flow. Second operand has 27 states, 27 states have (on average 7.0) internal successors, (189), 27 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:25,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:25,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:45:25,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:27,108 INFO L124 PetriNetUnfolderBase]: 3514/7070 cut-off events. [2025-03-14 00:45:27,108 INFO L125 PetriNetUnfolderBase]: For 1058561/1058561 co-relation queries the response was YES. [2025-03-14 00:45:27,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67689 conditions, 7070 events. 3514/7070 cut-off events. For 1058561/1058561 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 42569 event pairs, 182 based on Foata normal form. 27/7093 useless extension candidates. Maximal degree in co-relation 67521. Up to 1617 conditions per place. [2025-03-14 00:45:27,180 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 210 selfloop transitions, 270 changer transitions 103/586 dead transitions. [2025-03-14 00:45:27,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 586 transitions, 13499 flow [2025-03-14 00:45:27,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-14 00:45:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-14 00:45:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 579 transitions. [2025-03-14 00:45:27,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5026041666666666 [2025-03-14 00:45:27,181 INFO L175 Difference]: Start difference. First operand has 392 places, 321 transitions, 6915 flow. Second operand 48 states and 579 transitions. [2025-03-14 00:45:27,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 586 transitions, 13499 flow [2025-03-14 00:45:29,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 586 transitions, 12335 flow, removed 368 selfloop flow, removed 39 redundant places. [2025-03-14 00:45:29,173 INFO L231 Difference]: Finished difference. Result has 403 places, 328 transitions, 7128 flow [2025-03-14 00:45:29,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6167, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=7128, PETRI_PLACES=403, PETRI_TRANSITIONS=328} [2025-03-14 00:45:29,174 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 377 predicate places. [2025-03-14 00:45:29,174 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 328 transitions, 7128 flow [2025-03-14 00:45:29,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.0) internal successors, (189), 27 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:29,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:29,174 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:29,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-14 00:45:29,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:29,374 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:45:29,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:29,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1048114594, now seen corresponding path program 12 times [2025-03-14 00:45:29,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:29,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400116562] [2025-03-14 00:45:29,375 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 00:45:29,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:29,378 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 10 equivalence classes. [2025-03-14 00:45:29,385 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 00:45:29,385 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-14 00:45:29,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:29,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:29,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400116562] [2025-03-14 00:45:29,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400116562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:45:29,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804443644] [2025-03-14 00:45:29,591 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 00:45:29,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:29,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:29,593 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:45:29,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-14 00:45:29,621 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 10 equivalence classes. [2025-03-14 00:45:29,635 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 00:45:29,635 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-14 00:45:29,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:29,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-14 00:45:29,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:45:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:29,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:45:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:29,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804443644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:45:29,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:45:29,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2025-03-14 00:45:29,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206585447] [2025-03-14 00:45:29,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:45:29,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-14 00:45:29,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:29,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-14 00:45:29,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2025-03-14 00:45:29,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:45:29,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 328 transitions, 7128 flow. Second operand has 25 states, 25 states have (on average 6.92) internal successors, (173), 25 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:29,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:29,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:45:29,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:32,092 INFO L124 PetriNetUnfolderBase]: 3685/7394 cut-off events. [2025-03-14 00:45:32,092 INFO L125 PetriNetUnfolderBase]: For 1064534/1064534 co-relation queries the response was YES. [2025-03-14 00:45:32,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70566 conditions, 7394 events. 3685/7394 cut-off events. For 1064534/1064534 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 44881 event pairs, 173 based on Foata normal form. 27/7416 useless extension candidates. Maximal degree in co-relation 70395. Up to 1683 conditions per place. [2025-03-14 00:45:32,184 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 219 selfloop transitions, 278 changer transitions 95/595 dead transitions. [2025-03-14 00:45:32,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 595 transitions, 13957 flow [2025-03-14 00:45:32,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-14 00:45:32,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-03-14 00:45:32,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 572 transitions. [2025-03-14 00:45:32,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5070921985815603 [2025-03-14 00:45:32,186 INFO L175 Difference]: Start difference. First operand has 403 places, 328 transitions, 7128 flow. Second operand 47 states and 572 transitions. [2025-03-14 00:45:32,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 595 transitions, 13957 flow [2025-03-14 00:45:34,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 595 transitions, 13139 flow, removed 185 selfloop flow, removed 42 redundant places. [2025-03-14 00:45:34,309 INFO L231 Difference]: Finished difference. Result has 411 places, 336 transitions, 7601 flow [2025-03-14 00:45:34,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6432, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=7601, PETRI_PLACES=411, PETRI_TRANSITIONS=336} [2025-03-14 00:45:34,310 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 385 predicate places. [2025-03-14 00:45:34,310 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 336 transitions, 7601 flow [2025-03-14 00:45:34,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.92) internal successors, (173), 25 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:34,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:34,310 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:34,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-14 00:45:34,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-14 00:45:34,511 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:45:34,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:34,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1584281088, now seen corresponding path program 13 times [2025-03-14 00:45:34,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:34,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125346342] [2025-03-14 00:45:34,512 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 00:45:34,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:34,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-14 00:45:34,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 00:45:34,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:34,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:34,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:34,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125346342] [2025-03-14 00:45:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125346342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:45:34,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103800266] [2025-03-14 00:45:34,761 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 00:45:34,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:34,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:34,763 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:45:34,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-14 00:45:34,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-14 00:45:34,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 00:45:34,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:45:34,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:34,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-14 00:45:34,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:45:34,866 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:34,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:45:35,027 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:35,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103800266] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:45:35,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:45:35,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 25 [2025-03-14 00:45:35,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511511502] [2025-03-14 00:45:35,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:45:35,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-14 00:45:35,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:35,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-14 00:45:35,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2025-03-14 00:45:35,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 00:45:35,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 336 transitions, 7601 flow. Second operand has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 26 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:35,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:35,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 00:45:35,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:37,290 INFO L124 PetriNetUnfolderBase]: 3631/7312 cut-off events. [2025-03-14 00:45:37,290 INFO L125 PetriNetUnfolderBase]: For 1138397/1138397 co-relation queries the response was YES. [2025-03-14 00:45:37,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71378 conditions, 7312 events. 3631/7312 cut-off events. For 1138397/1138397 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 44406 event pairs, 164 based on Foata normal form. 45/7353 useless extension candidates. Maximal degree in co-relation 71204. Up to 1659 conditions per place. [2025-03-14 00:45:37,378 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 210 selfloop transitions, 281 changer transitions 107/601 dead transitions. [2025-03-14 00:45:37,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 601 transitions, 14460 flow [2025-03-14 00:45:37,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-14 00:45:37,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-14 00:45:37,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 581 transitions. [2025-03-14 00:45:37,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5043402777777778 [2025-03-14 00:45:37,380 INFO L175 Difference]: Start difference. First operand has 411 places, 336 transitions, 7601 flow. Second operand 48 states and 581 transitions. [2025-03-14 00:45:37,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 601 transitions, 14460 flow [2025-03-14 00:45:39,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 601 transitions, 13295 flow, removed 316 selfloop flow, removed 44 redundant places. [2025-03-14 00:45:39,455 INFO L231 Difference]: Finished difference. Result has 416 places, 338 transitions, 7523 flow [2025-03-14 00:45:39,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6750, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=279, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=7523, PETRI_PLACES=416, PETRI_TRANSITIONS=338} [2025-03-14 00:45:39,456 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 390 predicate places. [2025-03-14 00:45:39,456 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 338 transitions, 7523 flow [2025-03-14 00:45:39,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 26 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:39,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:39,456 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:39,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-14 00:45:39,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-14 00:45:39,657 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:45:39,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:39,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1352099047, now seen corresponding path program 14 times [2025-03-14 00:45:39,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:39,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198213830] [2025-03-14 00:45:39,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:45:39,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:39,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-14 00:45:39,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-14 00:45:39,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:45:39,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 218 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 00:45:39,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:39,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198213830] [2025-03-14 00:45:39,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198213830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:45:39,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267689779] [2025-03-14 00:45:39,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:45:39,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:39,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:39,751 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:45:39,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-14 00:45:39,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-14 00:45:39,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-14 00:45:39,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:45:39,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:39,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-14 00:45:39,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:45:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 00:45:39,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 00:45:39,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267689779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:45:39,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 00:45:39,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 14 [2025-03-14 00:45:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328533080] [2025-03-14 00:45:39,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:45:39,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 00:45:39,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:39,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 00:45:39,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2025-03-14 00:45:39,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-03-14 00:45:39,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 338 transitions, 7523 flow. Second operand has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 13 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:39,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:39,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-03-14 00:45:39,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:46,830 INFO L124 PetriNetUnfolderBase]: 18928/32269 cut-off events. [2025-03-14 00:45:46,830 INFO L125 PetriNetUnfolderBase]: For 4172452/4172452 co-relation queries the response was YES. [2025-03-14 00:45:47,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274256 conditions, 32269 events. 18928/32269 cut-off events. For 4172452/4172452 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 230609 event pairs, 351 based on Foata normal form. 0/28955 useless extension candidates. Maximal degree in co-relation 274088. Up to 6051 conditions per place. [2025-03-14 00:45:47,542 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 102 selfloop transitions, 12 changer transitions 1685/1802 dead transitions. [2025-03-14 00:45:47,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 1802 transitions, 38350 flow [2025-03-14 00:45:47,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 00:45:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 00:45:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 222 transitions. [2025-03-14 00:45:47,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2025-03-14 00:45:47,543 INFO L175 Difference]: Start difference. First operand has 416 places, 338 transitions, 7523 flow. Second operand 13 states and 222 transitions. [2025-03-14 00:45:47,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 1802 transitions, 38350 flow [2025-03-14 00:45:57,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 1802 transitions, 34251 flow, removed 459 selfloop flow, removed 58 redundant places. [2025-03-14 00:45:57,701 INFO L231 Difference]: Finished difference. Result has 362 places, 50 transitions, 599 flow [2025-03-14 00:45:57,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=5584, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=599, PETRI_PLACES=362, PETRI_TRANSITIONS=50} [2025-03-14 00:45:57,702 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 336 predicate places. [2025-03-14 00:45:57,702 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 50 transitions, 599 flow [2025-03-14 00:45:57,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 13 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:57,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:45:57,702 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:45:57,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-14 00:45:57,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:57,903 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:45:57,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:45:57,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1138225952, now seen corresponding path program 15 times [2025-03-14 00:45:57,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:45:57,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301582005] [2025-03-14 00:45:57,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:45:57,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:45:57,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 10 equivalence classes. [2025-03-14 00:45:57,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 72 of 72 statements. [2025-03-14 00:45:57,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-14 00:45:57,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-14 00:45:58,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:58,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301582005] [2025-03-14 00:45:58,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301582005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:45:58,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:45:58,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-14 00:45:58,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921809617] [2025-03-14 00:45:58,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:45:58,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 00:45:58,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:58,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 00:45:58,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-03-14 00:45:58,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-03-14 00:45:58,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 50 transitions, 599 flow. Second operand has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 13 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:58,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:58,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-03-14 00:45:58,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:58,482 INFO L124 PetriNetUnfolderBase]: 1964/3425 cut-off events. [2025-03-14 00:45:58,482 INFO L125 PetriNetUnfolderBase]: For 170505/170505 co-relation queries the response was YES. [2025-03-14 00:45:58,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18420 conditions, 3425 events. 1964/3425 cut-off events. For 170505/170505 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 16591 event pairs, 48 based on Foata normal form. 0/3065 useless extension candidates. Maximal degree in co-relation 18267. Up to 671 conditions per place. [2025-03-14 00:45:58,519 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 0 selfloop transitions, 0 changer transitions 271/271 dead transitions. [2025-03-14 00:45:58,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 271 transitions, 3476 flow [2025-03-14 00:45:58,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 00:45:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 00:45:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 179 transitions. [2025-03-14 00:45:58,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5737179487179487 [2025-03-14 00:45:58,520 INFO L175 Difference]: Start difference. First operand has 362 places, 50 transitions, 599 flow. Second operand 13 states and 179 transitions. [2025-03-14 00:45:58,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 271 transitions, 3476 flow [2025-03-14 00:45:58,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 271 transitions, 1974 flow, removed 492 selfloop flow, removed 73 redundant places. [2025-03-14 00:45:58,577 INFO L231 Difference]: Finished difference. Result has 163 places, 0 transitions, 0 flow [2025-03-14 00:45:58,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=163, PETRI_TRANSITIONS=0} [2025-03-14 00:45:58,578 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 137 predicate places. [2025-03-14 00:45:58,578 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 0 transitions, 0 flow [2025-03-14 00:45:58,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 13 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:58,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-14 00:45:58,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-14 00:45:58,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-14 00:45:58,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 00:45:58,582 INFO L422 BasicCegarLoop]: Path program histogram: [15, 3, 2, 2, 1, 1] [2025-03-14 00:45:58,584 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:45:58,584 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:45:58,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:45:58 BasicIcfg [2025-03-14 00:45:58,588 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:45:58,589 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:45:58,589 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:45:58,589 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:45:58,590 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:44:49" (3/4) ... [2025-03-14 00:45:58,591 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 00:45:58,593 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-14 00:45:58,593 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-14 00:45:58,595 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-03-14 00:45:58,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-14 00:45:58,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 00:45:58,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-14 00:45:58,651 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:45:58,652 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:45:58,652 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:45:58,652 INFO L158 Benchmark]: Toolchain (without parser) took 70355.09ms. Allocated memory was 167.8MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 121.1MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-03-14 00:45:58,653 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:45:58,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.21ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 101.5MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 00:45:58,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.80ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 100.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:45:58,655 INFO L158 Benchmark]: Boogie Preprocessor took 18.94ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 98.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:45:58,655 INFO L158 Benchmark]: IcfgBuilder took 347.32ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 79.2MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 00:45:58,655 INFO L158 Benchmark]: TraceAbstraction took 69549.59ms. Allocated memory was 167.8MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 78.3MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-03-14 00:45:58,656 INFO L158 Benchmark]: Witness Printer took 63.01ms. Allocated memory is still 5.5GB. Free memory was 3.8GB in the beginning and 3.8GB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:45:58,657 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.47ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.21ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 101.5MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.80ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 100.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.94ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 98.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 347.32ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 79.2MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 69549.59ms. Allocated memory was 167.8MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 78.3MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 63.01ms. Allocated memory is still 5.5GB. Free memory was 3.8GB in the beginning and 3.8GB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 722]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 34 locations, 3 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: 69.5s, OverallIterations: 24, TraceHistogramMax: 11, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 57.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9522 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9502 mSDsluCounter, 371 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 358 mSDsCounter, 566 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9767 IncrementalHoareTripleChecker+Invalid, 10333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 566 mSolverCounterUnsat, 13 mSDtfsCounter, 9767 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2369 GetRequests, 1343 SyntacticMatches, 93 SemanticMatches, 933 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15598 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7601occurred in iteration=21, InterpolantAutomatonStates: 685, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1800 NumberOfCodeBlocks, 1800 NumberOfCodeBlocksAsserted, 149 NumberOfCheckSat, 2472 ConstructedInterpolants, 0 QuantifiedInterpolants, 10253 SizeOfPredicates, 215 NumberOfNonLiveVariables, 2151 ConjunctsInSsa, 292 ConjunctsInUnsatCore, 51 InterpolantComputations, 11 PerfectInterpolantSequences, 720/5483 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 00:45:58,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE