./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/triangular-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 b585114ab4aff9777d36c84f93f7abe0931f77338421f004296c8a8d328d3dfd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:01:40,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:01:40,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:01:40,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:01:40,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:01:40,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:01:40,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:01:40,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:01:40,768 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:01:40,768 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:01:40,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:01:40,769 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:01:40,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:01:40,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:01:40,769 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:01:40,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:01:40,770 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:01:40,770 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:01:40,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:01:40,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:01:40,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:01:40,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:01:40,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:01:40,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:01:40,770 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:01:40,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:01:40,771 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:01:40,771 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:01:40,771 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:01:40,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:01:40,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:01:40,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:01:40,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:01:40,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:01:40,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:01:40,772 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:01:40,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:01:40,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:01:40,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:01:40,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:01:40,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:01:40,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:01:40,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:01:40,772 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 -> b585114ab4aff9777d36c84f93f7abe0931f77338421f004296c8a8d328d3dfd [2025-03-04 02:01:40,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:01:40,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:01:40,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:01:40,997 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:01:40,997 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:01:40,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-1.i [2025-03-04 02:01:42,175 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/370332c66/f5094369242749419e02a55d5fce69f8/FLAG6bd46f449 [2025-03-04 02:01:42,441 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:01:42,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-1.i [2025-03-04 02:01:42,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/370332c66/f5094369242749419e02a55d5fce69f8/FLAG6bd46f449 [2025-03-04 02:01:42,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/370332c66/f5094369242749419e02a55d5fce69f8 [2025-03-04 02:01:42,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:01:42,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:01:42,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:01:42,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:01:42,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:01:42,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:01:42" (1/1) ... [2025-03-04 02:01:42,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8b4fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:42, skipping insertion in model container [2025-03-04 02:01:42,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:01:42" (1/1) ... [2025-03-04 02:01:42,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:01:43,045 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-1.i[30950,30963] [2025-03-04 02:01:43,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:01:43,058 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:01:43,084 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-1.i[30950,30963] [2025-03-04 02:01:43,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:01:43,110 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:01:43,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43 WrapperNode [2025-03-04 02:01:43,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:01:43,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:01:43,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:01:43,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:01:43,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,144 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-03-04 02:01:43,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:01:43,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:01:43,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:01:43,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:01:43,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,166 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:01:43,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,170 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:01:43,178 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:01:43,178 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:01:43,178 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:01:43,183 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:01:43,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:43,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:01:43,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:01:43,232 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 02:01:43,233 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 02:01:43,233 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 02:01:43,233 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 02:01:43,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:01:43,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:01:43,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:01:43,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:01:43,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:01:43,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:01:43,234 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:01:43,330 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:01:43,332 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:01:43,443 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:01:43,443 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:01:43,519 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:01:43,520 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:01:43,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:01:43 BoogieIcfgContainer [2025-03-04 02:01:43,520 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:01:43,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:01:43,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:01:43,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:01:43,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:01:42" (1/3) ... [2025-03-04 02:01:43,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0e8a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:01:43, skipping insertion in model container [2025-03-04 02:01:43,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (2/3) ... [2025-03-04 02:01:43,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0e8a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:01:43, skipping insertion in model container [2025-03-04 02:01:43,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:01:43" (3/3) ... [2025-03-04 02:01:43,528 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-1.i [2025-03-04 02:01:43,538 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:01:43,543 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-1.i that has 3 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:01:43,544 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:01:43,584 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:01:43,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2025-03-04 02:01:43,642 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-03-04 02:01:43,644 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:01:43,648 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-04 02:01:43,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2025-03-04 02:01:43,653 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2025-03-04 02:01:43,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:01:43,670 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;@3b0096eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:01:43,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:01:43,676 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:01:43,676 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-03-04 02:01:43,676 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:01:43,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:43,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:43,677 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-04 02:01:43,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:43,684 INFO L85 PathProgramCache]: Analyzing trace with hash 341173780, now seen corresponding path program 1 times [2025-03-04 02:01:43,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:43,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069390295] [2025-03-04 02:01:43,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:43,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:43,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:01:43,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:01:43,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:43,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:43,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:43,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:43,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069390295] [2025-03-04 02:01:43,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069390295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:43,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:43,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:01:43,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278773415] [2025-03-04 02:01:43,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:43,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:01:43,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:44,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:01:44,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:01:44,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:44,026 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-04 02:01:44,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:44,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:44,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:44,215 INFO L124 PetriNetUnfolderBase]: 321/540 cut-off events. [2025-03-04 02:01:44,215 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:01:44,216 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-04 02:01:44,221 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2025-03-04 02:01:44,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2025-03-04 02:01:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:01:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:01:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-03-04 02:01:44,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 02:01:44,232 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 6 states and 84 transitions. [2025-03-04 02:01:44,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 54 transitions, 216 flow [2025-03-04 02:01:44,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:01:44,236 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 71 flow [2025-03-04 02:01:44,239 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-04 02:01:44,242 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2025-03-04 02:01:44,243 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 71 flow [2025-03-04 02:01:44,244 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-04 02:01:44,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:44,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:44,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:01:44,245 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-04 02:01:44,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:44,245 INFO L85 PathProgramCache]: Analyzing trace with hash -26154638, now seen corresponding path program 1 times [2025-03-04 02:01:44,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:44,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651043398] [2025-03-04 02:01:44,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:44,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:44,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:01:44,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:01:44,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:44,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:44,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:44,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:44,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651043398] [2025-03-04 02:01:44,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651043398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:44,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:44,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:01:44,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276925264] [2025-03-04 02:01:44,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:44,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:01:44,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:44,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:01:44,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:01:44,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:44,388 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-04 02:01:44,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:44,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:44,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:44,586 INFO L124 PetriNetUnfolderBase]: 382/687 cut-off events. [2025-03-04 02:01:44,586 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2025-03-04 02:01:44,588 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-04 02:01:44,592 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 9 changer transitions 20/78 dead transitions. [2025-03-04 02:01:44,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 78 transitions, 379 flow [2025-03-04 02:01:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:01:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:01:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2025-03-04 02:01:44,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-04 02:01:44,593 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 71 flow. Second operand 9 states and 117 transitions. [2025-03-04 02:01:44,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 78 transitions, 379 flow [2025-03-04 02:01:44,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 363 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-04 02:01:44,599 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 156 flow [2025-03-04 02:01:44,599 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-04 02:01:44,600 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2025-03-04 02:01:44,601 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 156 flow [2025-03-04 02:01:44,601 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-04 02:01:44,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:44,601 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:44,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:01:44,601 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-04 02:01:44,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:44,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1984146738, now seen corresponding path program 2 times [2025-03-04 02:01:44,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:44,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533871862] [2025-03-04 02:01:44,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:44,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:44,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:01:44,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:01:44,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:01:44,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:44,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:44,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533871862] [2025-03-04 02:01:44,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533871862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:44,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:44,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:01:44,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527970555] [2025-03-04 02:01:44,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:44,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:01:44,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:44,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:01:44,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:01:44,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:44,742 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-04 02:01:44,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:44,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:44,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:44,907 INFO L124 PetriNetUnfolderBase]: 328/603 cut-off events. [2025-03-04 02:01:44,907 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2025-03-04 02:01:44,910 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-04 02:01:44,912 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 9 changer transitions 28/78 dead transitions. [2025-03-04 02:01:44,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 496 flow [2025-03-04 02:01:44,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:01:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:01:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-03-04 02:01:44,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2025-03-04 02:01:44,914 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 156 flow. Second operand 8 states and 103 transitions. [2025-03-04 02:01:44,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 496 flow [2025-03-04 02:01:44,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 488 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 02:01:44,920 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 210 flow [2025-03-04 02:01:44,920 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-04 02:01:44,920 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-03-04 02:01:44,921 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 210 flow [2025-03-04 02:01:44,921 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-04 02:01:44,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:44,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:44,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:01:44,921 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-04 02:01:44,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1835947173, now seen corresponding path program 1 times [2025-03-04 02:01:44,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:44,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759812477] [2025-03-04 02:01:44,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:44,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:44,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:01:44,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:01:44,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:44,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:45,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:45,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759812477] [2025-03-04 02:01:45,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759812477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:45,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:45,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:01:45,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481036353] [2025-03-04 02:01:45,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:45,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:01:45,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:45,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:01:45,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:01:45,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:45,019 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-04 02:01:45,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:45,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:45,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:45,234 INFO L124 PetriNetUnfolderBase]: 337/612 cut-off events. [2025-03-04 02:01:45,235 INFO L125 PetriNetUnfolderBase]: For 1649/1649 co-relation queries the response was YES. [2025-03-04 02:01:45,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1937 conditions, 612 events. 337/612 cut-off events. For 1649/1649 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2551 event pairs, 74 based on Foata normal form. 18/626 useless extension candidates. Maximal degree in co-relation 1911. Up to 237 conditions per place. [2025-03-04 02:01:45,239 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 16 changer transitions 24/89 dead transitions. [2025-03-04 02:01:45,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 607 flow [2025-03-04 02:01:45,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:01:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:01:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2025-03-04 02:01:45,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-03-04 02:01:45,240 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 210 flow. Second operand 11 states and 135 transitions. [2025-03-04 02:01:45,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 607 flow [2025-03-04 02:01:45,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 540 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-03-04 02:01:45,245 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 279 flow [2025-03-04 02:01:45,245 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=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=279, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2025-03-04 02:01:45,246 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2025-03-04 02:01:45,246 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 279 flow [2025-03-04 02:01:45,246 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-04 02:01:45,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:45,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:45,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:01:45,247 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-04 02:01:45,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:45,248 INFO L85 PathProgramCache]: Analyzing trace with hash 765975209, now seen corresponding path program 2 times [2025-03-04 02:01:45,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:45,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888721626] [2025-03-04 02:01:45,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:45,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:45,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:01:45,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:01:45,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:01:45,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:45,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:45,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888721626] [2025-03-04 02:01:45,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888721626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:45,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:45,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:01:45,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160204851] [2025-03-04 02:01:45,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:45,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:01:45,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:45,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:01:45,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:01:45,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:45,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 279 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-04 02:01:45,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:45,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:45,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:45,622 INFO L124 PetriNetUnfolderBase]: 445/801 cut-off events. [2025-03-04 02:01:45,622 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2025-03-04 02:01:45,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2627 conditions, 801 events. 445/801 cut-off events. For 2473/2473 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3459 event pairs, 59 based on Foata normal form. 27/823 useless extension candidates. Maximal degree in co-relation 2600. Up to 151 conditions per place. [2025-03-04 02:01:45,644 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 44 selfloop transitions, 23 changer transitions 30/100 dead transitions. [2025-03-04 02:01:45,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 100 transitions, 739 flow [2025-03-04 02:01:45,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:01:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:01:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2025-03-04 02:01:45,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-03-04 02:01:45,648 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 279 flow. Second operand 11 states and 138 transitions. [2025-03-04 02:01:45,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 100 transitions, 739 flow [2025-03-04 02:01:45,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 685 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-03-04 02:01:45,656 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 390 flow [2025-03-04 02:01:45,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=390, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2025-03-04 02:01:45,657 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2025-03-04 02:01:45,658 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 390 flow [2025-03-04 02:01:45,658 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-04 02:01:45,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:45,658 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:45,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:01:45,658 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-04 02:01:45,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:45,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1363386589, now seen corresponding path program 1 times [2025-03-04 02:01:45,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:45,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9111333] [2025-03-04 02:01:45,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:45,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:45,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:01:45,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:01:45,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:45,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:45,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:45,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9111333] [2025-03-04 02:01:45,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9111333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:45,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169674320] [2025-03-04 02:01:45,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:45,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:45,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:45,756 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-04 02:01:45,758 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-04 02:01:45,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:01:45,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:01:45,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:45,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:45,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:01:45,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:45,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:45,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169674320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:45,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:45,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 02:01:45,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086746547] [2025-03-04 02:01:45,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:45,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:01:45,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:45,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:01:45,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:01:46,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:46,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 390 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:46,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:46,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:46,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:46,401 INFO L124 PetriNetUnfolderBase]: 571/1050 cut-off events. [2025-03-04 02:01:46,402 INFO L125 PetriNetUnfolderBase]: For 6872/6872 co-relation queries the response was YES. [2025-03-04 02:01:46,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4139 conditions, 1050 events. 571/1050 cut-off events. For 6872/6872 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4364 event pairs, 137 based on Foata normal form. 63/1109 useless extension candidates. Maximal degree in co-relation 4107. Up to 486 conditions per place. [2025-03-04 02:01:46,408 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 64 selfloop transitions, 17 changer transitions 67/151 dead transitions. [2025-03-04 02:01:46,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 151 transitions, 1346 flow [2025-03-04 02:01:46,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:01:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:01:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2025-03-04 02:01:46,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2025-03-04 02:01:46,410 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 390 flow. Second operand 19 states and 231 transitions. [2025-03-04 02:01:46,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 151 transitions, 1346 flow [2025-03-04 02:01:46,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 151 transitions, 1267 flow, removed 32 selfloop flow, removed 5 redundant places. [2025-03-04 02:01:46,423 INFO L231 Difference]: Finished difference. Result has 88 places, 51 transitions, 521 flow [2025-03-04 02:01:46,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=521, PETRI_PLACES=88, PETRI_TRANSITIONS=51} [2025-03-04 02:01:46,424 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 62 predicate places. [2025-03-04 02:01:46,425 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 51 transitions, 521 flow [2025-03-04 02:01:46,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:46,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:46,425 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:46,431 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-04 02:01:46,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 02:01:46,629 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-04 02:01:46,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:46,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1919587151, now seen corresponding path program 2 times [2025-03-04 02:01:46,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:46,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239791114] [2025-03-04 02:01:46,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:46,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:46,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:01:46,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:01:46,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:01:46,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:46,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:46,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239791114] [2025-03-04 02:01:46,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239791114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:46,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:46,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:01:46,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748378877] [2025-03-04 02:01:46,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:46,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:01:46,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:46,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:01:46,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:01:46,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:46,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 51 transitions, 521 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-04 02:01:46,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:46,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:46,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:47,028 INFO L124 PetriNetUnfolderBase]: 652/1217 cut-off events. [2025-03-04 02:01:47,029 INFO L125 PetriNetUnfolderBase]: For 19130/19130 co-relation queries the response was YES. [2025-03-04 02:01:47,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6062 conditions, 1217 events. 652/1217 cut-off events. For 19130/19130 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5640 event pairs, 132 based on Foata normal form. 27/1240 useless extension candidates. Maximal degree in co-relation 6019. Up to 483 conditions per place. [2025-03-04 02:01:47,037 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 76 selfloop transitions, 23 changer transitions 31/133 dead transitions. [2025-03-04 02:01:47,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 133 transitions, 1509 flow [2025-03-04 02:01:47,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:01:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:01:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 187 transitions. [2025-03-04 02:01:47,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2025-03-04 02:01:47,039 INFO L175 Difference]: Start difference. First operand has 88 places, 51 transitions, 521 flow. Second operand 15 states and 187 transitions. [2025-03-04 02:01:47,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 133 transitions, 1509 flow [2025-03-04 02:01:47,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 133 transitions, 1211 flow, removed 138 selfloop flow, removed 12 redundant places. [2025-03-04 02:01:47,058 INFO L231 Difference]: Finished difference. Result has 90 places, 57 transitions, 583 flow [2025-03-04 02:01:47,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=583, PETRI_PLACES=90, PETRI_TRANSITIONS=57} [2025-03-04 02:01:47,059 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 64 predicate places. [2025-03-04 02:01:47,060 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 57 transitions, 583 flow [2025-03-04 02:01:47,060 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-04 02:01:47,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:47,060 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:47,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:01:47,060 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-04 02:01:47,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:47,061 INFO L85 PathProgramCache]: Analyzing trace with hash -744688911, now seen corresponding path program 3 times [2025-03-04 02:01:47,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:47,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093168483] [2025-03-04 02:01:47,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:01:47,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:47,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:01:47,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:01:47,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:01:47,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:47,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:47,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093168483] [2025-03-04 02:01:47,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093168483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:47,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570451565] [2025-03-04 02:01:47,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:01:47,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:47,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:47,158 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-04 02:01:47,160 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-04 02:01:47,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:01:47,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:01:47,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:01:47,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:47,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:01:47,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:47,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:47,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:47,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570451565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:47,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:47,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 02:01:47,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274842453] [2025-03-04 02:01:47,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:47,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:01:47,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:47,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:01:47,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:01:47,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:47,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 57 transitions, 583 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:47,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:47,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:47,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:47,851 INFO L124 PetriNetUnfolderBase]: 814/1489 cut-off events. [2025-03-04 02:01:47,851 INFO L125 PetriNetUnfolderBase]: For 23715/23715 co-relation queries the response was YES. [2025-03-04 02:01:47,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7554 conditions, 1489 events. 814/1489 cut-off events. For 23715/23715 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6954 event pairs, 72 based on Foata normal form. 81/1566 useless extension candidates. Maximal degree in co-relation 7511. Up to 237 conditions per place. [2025-03-04 02:01:47,859 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 78 selfloop transitions, 45 changer transitions 81/207 dead transitions. [2025-03-04 02:01:47,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 207 transitions, 2402 flow [2025-03-04 02:01:47,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:01:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 02:01:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 308 transitions. [2025-03-04 02:01:47,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2025-03-04 02:01:47,861 INFO L175 Difference]: Start difference. First operand has 90 places, 57 transitions, 583 flow. Second operand 25 states and 308 transitions. [2025-03-04 02:01:47,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 207 transitions, 2402 flow [2025-03-04 02:01:47,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 207 transitions, 2182 flow, removed 94 selfloop flow, removed 10 redundant places. [2025-03-04 02:01:47,886 INFO L231 Difference]: Finished difference. Result has 117 places, 69 transitions, 910 flow [2025-03-04 02:01:47,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=910, PETRI_PLACES=117, PETRI_TRANSITIONS=69} [2025-03-04 02:01:47,887 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 91 predicate places. [2025-03-04 02:01:47,887 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 69 transitions, 910 flow [2025-03-04 02:01:47,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:47,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:47,887 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:47,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:01:48,091 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,SelfDestructingSolverStorable7 [2025-03-04 02:01:48,091 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-04 02:01:48,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:48,092 INFO L85 PathProgramCache]: Analyzing trace with hash 183631298, now seen corresponding path program 1 times [2025-03-04 02:01:48,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:48,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421963613] [2025-03-04 02:01:48,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:48,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:48,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:01:48,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:01:48,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:48,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:48,194 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-04 02:01:48,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:48,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421963613] [2025-03-04 02:01:48,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421963613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:48,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709635022] [2025-03-04 02:01:48,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:48,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:48,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:48,197 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-04 02:01:48,199 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-04 02:01:48,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:01:48,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:01:48,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:48,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:48,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:01:48,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:48,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:48,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:48,398 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-04 02:01:48,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709635022] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:48,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:48,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-04 02:01:48,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430896234] [2025-03-04 02:01:48,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:48,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:01:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:48,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:01:48,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:01:48,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:48,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 69 transitions, 910 flow. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:48,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:48,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:48,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:49,025 INFO L124 PetriNetUnfolderBase]: 1129/2119 cut-off events. [2025-03-04 02:01:49,025 INFO L125 PetriNetUnfolderBase]: For 69281/69281 co-relation queries the response was YES. [2025-03-04 02:01:49,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13163 conditions, 2119 events. 1129/2119 cut-off events. For 69281/69281 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 11353 event pairs, 70 based on Foata normal form. 72/2187 useless extension candidates. Maximal degree in co-relation 13107. Up to 400 conditions per place. [2025-03-04 02:01:49,039 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 90 selfloop transitions, 66 changer transitions 88/247 dead transitions. [2025-03-04 02:01:49,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 247 transitions, 3782 flow [2025-03-04 02:01:49,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 02:01:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-04 02:01:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 341 transitions. [2025-03-04 02:01:49,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5074404761904762 [2025-03-04 02:01:49,041 INFO L175 Difference]: Start difference. First operand has 117 places, 69 transitions, 910 flow. Second operand 28 states and 341 transitions. [2025-03-04 02:01:49,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 247 transitions, 3782 flow [2025-03-04 02:01:49,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 247 transitions, 3161 flow, removed 288 selfloop flow, removed 17 redundant places. [2025-03-04 02:01:49,100 INFO L231 Difference]: Finished difference. Result has 138 places, 97 transitions, 1499 flow [2025-03-04 02:01:49,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1499, PETRI_PLACES=138, PETRI_TRANSITIONS=97} [2025-03-04 02:01:49,101 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 112 predicate places. [2025-03-04 02:01:49,101 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 97 transitions, 1499 flow [2025-03-04 02:01:49,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:49,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:49,101 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:49,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:01:49,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:49,302 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-04 02:01:49,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:49,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1643456025, now seen corresponding path program 2 times [2025-03-04 02:01:49,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:49,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246827238] [2025-03-04 02:01:49,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:49,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:49,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:01:49,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:01:49,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:01:49,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:49,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:49,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246827238] [2025-03-04 02:01:49,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246827238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:49,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148844801] [2025-03-04 02:01:49,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:49,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:49,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:49,430 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-04 02:01:49,432 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-04 02:01:49,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:01:49,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:01:49,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:01:49,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:49,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:01:49,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:49,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:49,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148844801] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:49,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:49,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-03-04 02:01:49,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674468336] [2025-03-04 02:01:49,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:49,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:01:49,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:49,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:01:49,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:01:49,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:49,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 97 transitions, 1499 flow. Second operand has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:49,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:49,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:49,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:50,523 INFO L124 PetriNetUnfolderBase]: 1462/2747 cut-off events. [2025-03-04 02:01:50,523 INFO L125 PetriNetUnfolderBase]: For 144195/144195 co-relation queries the response was YES. [2025-03-04 02:01:50,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19614 conditions, 2747 events. 1462/2747 cut-off events. For 144195/144195 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 14498 event pairs, 38 based on Foata normal form. 63/2806 useless extension candidates. Maximal degree in co-relation 19548. Up to 543 conditions per place. [2025-03-04 02:01:50,552 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 104 selfloop transitions, 100 changer transitions 92/299 dead transitions. [2025-03-04 02:01:50,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 299 transitions, 5332 flow [2025-03-04 02:01:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 02:01:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-04 02:01:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 393 transitions. [2025-03-04 02:01:50,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51171875 [2025-03-04 02:01:50,556 INFO L175 Difference]: Start difference. First operand has 138 places, 97 transitions, 1499 flow. Second operand 32 states and 393 transitions. [2025-03-04 02:01:50,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 299 transitions, 5332 flow [2025-03-04 02:01:50,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 299 transitions, 4109 flow, removed 587 selfloop flow, removed 15 redundant places. [2025-03-04 02:01:50,702 INFO L231 Difference]: Finished difference. Result has 164 places, 125 transitions, 2048 flow [2025-03-04 02:01:50,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2048, PETRI_PLACES=164, PETRI_TRANSITIONS=125} [2025-03-04 02:01:50,704 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 138 predicate places. [2025-03-04 02:01:50,704 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 125 transitions, 2048 flow [2025-03-04 02:01:50,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:50,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:50,704 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:50,713 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-04 02:01:50,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:50,905 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-04 02:01:50,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:50,906 INFO L85 PathProgramCache]: Analyzing trace with hash 573500543, now seen corresponding path program 3 times [2025-03-04 02:01:50,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:50,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090055265] [2025-03-04 02:01:50,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:01:50,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:50,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-03-04 02:01:50,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:01:50,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 02:01:50,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:51,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:51,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090055265] [2025-03-04 02:01:51,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090055265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:51,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915355756] [2025-03-04 02:01:51,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:01:51,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:51,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:51,099 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-04 02:01:51,100 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-04 02:01:51,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-03-04 02:01:51,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:01:51,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 02:01:51,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:51,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 02:01:51,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:51,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:51,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915355756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:51,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:51,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2025-03-04 02:01:51,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964968401] [2025-03-04 02:01:51,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:51,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 02:01:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:51,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 02:01:51,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2025-03-04 02:01:51,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:51,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 125 transitions, 2048 flow. Second operand has 29 states, 29 states have (on average 7.0) internal successors, (203), 29 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:51,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:51,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:51,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:52,541 INFO L124 PetriNetUnfolderBase]: 1732/3233 cut-off events. [2025-03-04 02:01:52,541 INFO L125 PetriNetUnfolderBase]: For 176931/176931 co-relation queries the response was YES. [2025-03-04 02:01:52,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23002 conditions, 3233 events. 1732/3233 cut-off events. For 176931/176931 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 17156 event pairs, 92 based on Foata normal form. 36/3265 useless extension candidates. Maximal degree in co-relation 22925. Up to 633 conditions per place. [2025-03-04 02:01:52,574 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 121 selfloop transitions, 120 changer transitions 77/321 dead transitions. [2025-03-04 02:01:52,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 321 transitions, 5717 flow [2025-03-04 02:01:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 02:01:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-04 02:01:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 391 transitions. [2025-03-04 02:01:52,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5091145833333334 [2025-03-04 02:01:52,575 INFO L175 Difference]: Start difference. First operand has 164 places, 125 transitions, 2048 flow. Second operand 32 states and 391 transitions. [2025-03-04 02:01:52,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 321 transitions, 5717 flow [2025-03-04 02:01:52,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 321 transitions, 4619 flow, removed 514 selfloop flow, removed 20 redundant places. [2025-03-04 02:01:52,782 INFO L231 Difference]: Finished difference. Result has 180 places, 149 transitions, 2386 flow [2025-03-04 02:01:52,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2386, PETRI_PLACES=180, PETRI_TRANSITIONS=149} [2025-03-04 02:01:52,782 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 154 predicate places. [2025-03-04 02:01:52,782 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 149 transitions, 2386 flow [2025-03-04 02:01:52,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.0) internal successors, (203), 29 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:52,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:52,783 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:52,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 02:01:52,983 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,SelfDestructingSolverStorable10 [2025-03-04 02:01:52,983 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-04 02:01:52,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:52,984 INFO L85 PathProgramCache]: Analyzing trace with hash 784342224, now seen corresponding path program 4 times [2025-03-04 02:01:52,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:52,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118933484] [2025-03-04 02:01:52,984 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:01:52,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:52,994 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-04 02:01:52,997 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 42 statements. [2025-03-04 02:01:52,998 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:01:52,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:01:53,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:53,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118933484] [2025-03-04 02:01:53,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118933484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:53,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:53,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:01:53,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659851157] [2025-03-04 02:01:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:53,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:01:53,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:53,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:01:53,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:01:53,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-03-04 02:01:53,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 149 transitions, 2386 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:53,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:53,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-03-04 02:01:53,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:54,060 INFO L124 PetriNetUnfolderBase]: 4785/8179 cut-off events. [2025-03-04 02:01:54,060 INFO L125 PetriNetUnfolderBase]: For 312938/312938 co-relation queries the response was YES. [2025-03-04 02:01:54,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46849 conditions, 8179 events. 4785/8179 cut-off events. For 312938/312938 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 51975 event pairs, 141 based on Foata normal form. 0/7473 useless extension candidates. Maximal degree in co-relation 46777. Up to 2166 conditions per place. [2025-03-04 02:01:54,099 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 0 selfloop transitions, 0 changer transitions 554/554 dead transitions. [2025-03-04 02:01:54,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 554 transitions, 9240 flow [2025-03-04 02:01:54,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:01:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:01:54,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2025-03-04 02:01:54,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.671875 [2025-03-04 02:01:54,100 INFO L175 Difference]: Start difference. First operand has 180 places, 149 transitions, 2386 flow. Second operand 8 states and 129 transitions. [2025-03-04 02:01:54,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 554 transitions, 9240 flow [2025-03-04 02:01:54,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 554 transitions, 8192 flow, removed 357 selfloop flow, removed 20 redundant places. [2025-03-04 02:01:54,413 INFO L231 Difference]: Finished difference. Result has 160 places, 0 transitions, 0 flow [2025-03-04 02:01:54,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=160, PETRI_TRANSITIONS=0} [2025-03-04 02:01:54,414 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 134 predicate places. [2025-03-04 02:01:54,414 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 0 transitions, 0 flow [2025-03-04 02:01:54,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:01:54,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-04 02:01:54,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-04 02:01:54,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-04 02:01:54,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:01:54,418 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1] [2025-03-04 02:01:54,420 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:01:54,420 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:01:54,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:01:54 BasicIcfg [2025-03-04 02:01:54,424 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:01:54,424 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:01:54,424 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:01:54,425 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:01:54,425 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:01:43" (3/4) ... [2025-03-04 02:01:54,426 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:01:54,429 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-04 02:01:54,429 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-04 02:01:54,431 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-04 02:01:54,431 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-04 02:01:54,431 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 02:01:54,431 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 02:01:54,431 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 02:01:54,483 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:01:54,483 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:01:54,483 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:01:54,484 INFO L158 Benchmark]: Toolchain (without parser) took 11724.14ms. Allocated memory was 142.6MB in the beginning and 855.6MB in the end (delta: 713.0MB). Free memory was 112.0MB in the beginning and 572.8MB in the end (delta: -460.8MB). Peak memory consumption was 249.3MB. Max. memory is 16.1GB. [2025-03-04 02:01:54,484 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:01:54,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.34ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 92.5MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:01:54,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.83ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:01:54,484 INFO L158 Benchmark]: Boogie Preprocessor took 30.99ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 89.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:01:54,485 INFO L158 Benchmark]: IcfgBuilder took 342.60ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 71.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:01:54,485 INFO L158 Benchmark]: TraceAbstraction took 10901.52ms. Allocated memory was 142.6MB in the beginning and 855.6MB in the end (delta: 713.0MB). Free memory was 71.4MB in the beginning and 578.2MB in the end (delta: -506.9MB). Peak memory consumption was 281.4MB. Max. memory is 16.1GB. [2025-03-04 02:01:54,485 INFO L158 Benchmark]: Witness Printer took 58.82ms. Allocated memory is still 855.6MB. Free memory was 578.2MB in the beginning and 572.8MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:01:54,486 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.34ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 92.5MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.83ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.99ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 89.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 342.60ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 71.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10901.52ms. Allocated memory was 142.6MB in the beginning and 855.6MB in the end (delta: 713.0MB). Free memory was 71.4MB in the beginning and 578.2MB in the end (delta: -506.9MB). Peak memory consumption was 281.4MB. Max. memory is 16.1GB. * Witness Printer took 58.82ms. Allocated memory is still 855.6MB. Free memory was 578.2MB in the beginning and 572.8MB in the end (delta: 5.4MB). 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: 10.8s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2156 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2145 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3422 IncrementalHoareTripleChecker+Invalid, 3559 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 9 mSDtfsCounter, 3422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 210 SyntacticMatches, 2 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2015 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2386occurred in iteration=11, InterpolantAutomatonStates: 204, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 369 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 470 ConstructedInterpolants, 0 QuantifiedInterpolants, 1778 SizeOfPredicates, 31 NumberOfNonLiveVariables, 500 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 22 InterpolantComputations, 7 PerfectInterpolantSequences, 57/263 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-04 02:01:54,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE