./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/triangular-longest-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:15:22,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:15:22,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:15:22,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:15:22,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:15:22,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:15:22,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:15:22,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:15:22,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:15:22,053 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:15:22,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:15:22,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:15:22,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:15:22,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:15:22,054 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:15:22,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:15:22,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:15:22,054 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:15:22,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:15:22,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:15:22,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:15:22,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:15:22,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:15:22,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:15:22,055 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:15:22,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:15:22,055 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:15:22,055 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:15:22,055 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:15:22,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:15:22,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:15:22,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:15:22,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:15:22,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:15:22,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:15:22,056 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:15:22,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:15:22,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:15:22,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:15:22,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:15:22,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:15:22,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:15:22,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:15:22,056 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-jdk21/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 -> 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 [2025-02-06 04:15:22,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:15:22,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:15:22,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:15:22,282 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:15:22,282 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:15:22,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longest-2.i [2025-02-06 04:15:23,390 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12b306102/4ed933f588bf4d3fba5720e1c734f8ba/FLAG85f3de42b [2025-02-06 04:15:23,686 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:15:23,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-2.i [2025-02-06 04:15:23,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12b306102/4ed933f588bf4d3fba5720e1c734f8ba/FLAG85f3de42b [2025-02-06 04:15:23,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12b306102/4ed933f588bf4d3fba5720e1c734f8ba [2025-02-06 04:15:23,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:15:23,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:15:23,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:15:23,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:15:23,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:15:23,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:15:23" (1/1) ... [2025-02-06 04:15:23,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca3262a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:23, skipping insertion in model container [2025-02-06 04:15:23,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:15:23" (1/1) ... [2025-02-06 04:15:23,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:15:24,211 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2025-02-06 04:15:24,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:15:24,221 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:15:24,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2025-02-06 04:15:24,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:15:24,272 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:15:24,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:24 WrapperNode [2025-02-06 04:15:24,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:15:24,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:15:24,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:15:24,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:15:24,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:24" (1/1) ... [2025-02-06 04:15:24,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:24" (1/1) ... [2025-02-06 04:15:24,307 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-02-06 04:15:24,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:15:24,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:15:24,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:15:24,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:15:24,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:24" (1/1) ... [2025-02-06 04:15:24,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:24" (1/1) ... [2025-02-06 04:15:24,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:24" (1/1) ... [2025-02-06 04:15:24,320 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-02-06 04:15:24,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:24" (1/1) ... [2025-02-06 04:15:24,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:24" (1/1) ... [2025-02-06 04:15:24,323 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:24" (1/1) ... [2025-02-06 04:15:24,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:24" (1/1) ... [2025-02-06 04:15:24,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:24" (1/1) ... [2025-02-06 04:15:24,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:24" (1/1) ... [2025-02-06 04:15:24,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:15:24,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:15:24,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:15:24,326 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:15:24,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:24" (1/1) ... [2025-02-06 04:15:24,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:15:24,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:24,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:15:24,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:15:24,405 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 04:15:24,406 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 04:15:24,406 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 04:15:24,406 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 04:15:24,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:15:24,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:15:24,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:15:24,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:15:24,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:15:24,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:15:24,407 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:15:24,521 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:15:24,522 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:15:24,631 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:15:24,631 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:15:24,700 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:15:24,700 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:15:24,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:15:24 BoogieIcfgContainer [2025-02-06 04:15:24,701 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:15:24,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:15:24,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:15:24,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:15:24,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:15:23" (1/3) ... [2025-02-06 04:15:24,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30412da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:15:24, skipping insertion in model container [2025-02-06 04:15:24,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:24" (2/3) ... [2025-02-06 04:15:24,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30412da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:15:24, skipping insertion in model container [2025-02-06 04:15:24,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:15:24" (3/3) ... [2025-02-06 04:15:24,707 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2025-02-06 04:15:24,716 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:15:24,717 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longest-2.i that has 3 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-06 04:15:24,718 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:15:24,742 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:15:24,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2025-02-06 04:15:24,782 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-02-06 04:15:24,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:15:24,789 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-02-06 04:15:24,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2025-02-06 04:15:24,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2025-02-06 04:15:24,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:15:24,812 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;@43eb474e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:15:24,812 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 04:15:24,817 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:15:24,817 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-02-06 04:15:24,817 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:15:24,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:24,818 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:24,818 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-02-06 04:15:24,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:24,822 INFO L85 PathProgramCache]: Analyzing trace with hash 341173782, now seen corresponding path program 1 times [2025-02-06 04:15:24,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:24,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203563459] [2025-02-06 04:15:24,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:24,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:24,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 04:15:24,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 04:15:24,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:24,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:25,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:25,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:25,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203563459] [2025-02-06 04:15:25,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203563459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:25,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:25,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:15:25,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228072186] [2025-02-06 04:15:25,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:25,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:15:25,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:25,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:15:25,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:15:25,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:25,203 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-02-06 04:15:25,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:25,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:25,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:25,367 INFO L124 PetriNetUnfolderBase]: 321/540 cut-off events. [2025-02-06 04:15:25,367 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:15:25,369 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-02-06 04:15:25,371 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2025-02-06 04:15:25,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2025-02-06 04:15:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:15:25,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:15:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-02-06 04:15:25,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-02-06 04:15:25,381 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 6 states and 84 transitions. [2025-02-06 04:15:25,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 54 transitions, 216 flow [2025-02-06 04:15:25,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:15:25,385 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 71 flow [2025-02-06 04:15:25,387 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-02-06 04:15:25,389 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2025-02-06 04:15:25,389 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 71 flow [2025-02-06 04:15:25,389 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-02-06 04:15:25,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:25,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:25,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:15:25,390 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-02-06 04:15:25,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:25,391 INFO L85 PathProgramCache]: Analyzing trace with hash -26154636, now seen corresponding path program 1 times [2025-02-06 04:15:25,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:25,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727302885] [2025-02-06 04:15:25,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:25,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:25,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 04:15:25,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 04:15:25,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:25,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:25,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727302885] [2025-02-06 04:15:25,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727302885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:25,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:25,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:15:25,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927836881] [2025-02-06 04:15:25,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:25,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:15:25,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:25,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:15:25,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:15:25,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:25,487 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-02-06 04:15:25,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:25,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:25,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:25,655 INFO L124 PetriNetUnfolderBase]: 382/687 cut-off events. [2025-02-06 04:15:25,655 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2025-02-06 04:15:25,657 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-02-06 04:15:25,659 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 9 changer transitions 20/78 dead transitions. [2025-02-06 04:15:25,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 78 transitions, 379 flow [2025-02-06 04:15:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:15:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:15:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2025-02-06 04:15:25,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-02-06 04:15:25,661 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 71 flow. Second operand 9 states and 117 transitions. [2025-02-06 04:15:25,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 78 transitions, 379 flow [2025-02-06 04:15:25,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 363 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-02-06 04:15:25,664 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 156 flow [2025-02-06 04:15:25,665 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-02-06 04:15:25,665 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2025-02-06 04:15:25,665 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 156 flow [2025-02-06 04:15:25,665 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-02-06 04:15:25,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:25,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:25,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:15:25,666 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-02-06 04:15:25,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:25,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1984146740, now seen corresponding path program 2 times [2025-02-06 04:15:25,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:25,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959372169] [2025-02-06 04:15:25,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:15:25,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:25,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-02-06 04:15:25,676 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 04:15:25,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:15:25,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:25,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:25,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959372169] [2025-02-06 04:15:25,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959372169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:25,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:25,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:15:25,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478432038] [2025-02-06 04:15:25,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:25,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:15:25,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:25,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:15:25,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:15:25,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:25,814 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-02-06 04:15:25,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:25,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:25,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:25,958 INFO L124 PetriNetUnfolderBase]: 328/603 cut-off events. [2025-02-06 04:15:25,958 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2025-02-06 04:15:25,959 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-02-06 04:15:25,960 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 9 changer transitions 28/78 dead transitions. [2025-02-06 04:15:25,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 496 flow [2025-02-06 04:15:25,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:15:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:15:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-02-06 04:15:25,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2025-02-06 04:15:25,961 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 156 flow. Second operand 8 states and 103 transitions. [2025-02-06 04:15:25,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 496 flow [2025-02-06 04:15:25,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 488 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-06 04:15:25,965 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 210 flow [2025-02-06 04:15:25,965 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-02-06 04:15:25,965 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-02-06 04:15:25,966 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 210 flow [2025-02-06 04:15:25,966 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-02-06 04:15:25,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:25,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:25,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:15:25,966 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-02-06 04:15:25,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:25,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1835947175, now seen corresponding path program 1 times [2025-02-06 04:15:25,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:25,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256093192] [2025-02-06 04:15:25,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:25,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:25,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 04:15:25,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 04:15:25,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:25,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:26,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:26,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256093192] [2025-02-06 04:15:26,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256093192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:26,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:26,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:15:26,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143997640] [2025-02-06 04:15:26,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:26,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:15:26,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:26,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:15:26,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:15:26,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:26,067 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-02-06 04:15:26,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:26,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:26,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:26,300 INFO L124 PetriNetUnfolderBase]: 337/612 cut-off events. [2025-02-06 04:15:26,300 INFO L125 PetriNetUnfolderBase]: For 1649/1649 co-relation queries the response was YES. [2025-02-06 04:15:26,302 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-02-06 04:15:26,304 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 16 changer transitions 24/89 dead transitions. [2025-02-06 04:15:26,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 607 flow [2025-02-06 04:15:26,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:15:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:15:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2025-02-06 04:15:26,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-02-06 04:15:26,308 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 210 flow. Second operand 11 states and 135 transitions. [2025-02-06 04:15:26,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 607 flow [2025-02-06 04:15:26,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 540 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-02-06 04:15:26,315 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 279 flow [2025-02-06 04:15:26,315 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-02-06 04:15:26,316 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2025-02-06 04:15:26,317 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 279 flow [2025-02-06 04:15:26,317 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-02-06 04:15:26,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:26,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:26,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:15:26,317 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-02-06 04:15:26,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:26,318 INFO L85 PathProgramCache]: Analyzing trace with hash 765975211, now seen corresponding path program 2 times [2025-02-06 04:15:26,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:26,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993431403] [2025-02-06 04:15:26,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:15:26,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:26,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-02-06 04:15:26,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 04:15:26,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:15:26,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:26,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:26,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:26,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993431403] [2025-02-06 04:15:26,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993431403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:26,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:26,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:15:26,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533602902] [2025-02-06 04:15:26,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:26,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:15:26,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:26,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:15:26,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:15:26,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:26,439 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-02-06 04:15:26,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:26,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:26,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:26,635 INFO L124 PetriNetUnfolderBase]: 445/801 cut-off events. [2025-02-06 04:15:26,635 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2025-02-06 04:15:26,636 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-02-06 04:15:26,638 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 44 selfloop transitions, 23 changer transitions 30/100 dead transitions. [2025-02-06 04:15:26,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 100 transitions, 739 flow [2025-02-06 04:15:26,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:15:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:15:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2025-02-06 04:15:26,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-02-06 04:15:26,639 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 279 flow. Second operand 11 states and 138 transitions. [2025-02-06 04:15:26,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 100 transitions, 739 flow [2025-02-06 04:15:26,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 685 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-02-06 04:15:26,645 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 390 flow [2025-02-06 04:15:26,645 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-02-06 04:15:26,645 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2025-02-06 04:15:26,645 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 390 flow [2025-02-06 04:15:26,645 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-02-06 04:15:26,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:26,646 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:26,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:15:26,646 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-02-06 04:15:26,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:26,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1363386587, now seen corresponding path program 1 times [2025-02-06 04:15:26,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:26,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107845118] [2025-02-06 04:15:26,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:26,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:26,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:15:26,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:15:26,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:26,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:26,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:26,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107845118] [2025-02-06 04:15:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107845118] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:15:26,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454262789] [2025-02-06 04:15:26,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:26,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:26,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:26,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:15:26,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:15:26,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:15:26,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:15:26,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:26,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:26,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 04:15:26,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:15:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:26,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:15:26,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:26,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454262789] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:15:26,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:15:26,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-06 04:15:26,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147143223] [2025-02-06 04:15:26,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:15:26,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:15:26,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:26,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:15:26,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:15:27,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:27,001 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-02-06 04:15:27,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:27,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:27,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:27,392 INFO L124 PetriNetUnfolderBase]: 571/1050 cut-off events. [2025-02-06 04:15:27,392 INFO L125 PetriNetUnfolderBase]: For 6872/6872 co-relation queries the response was YES. [2025-02-06 04:15:27,395 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-02-06 04:15:27,398 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 64 selfloop transitions, 17 changer transitions 67/151 dead transitions. [2025-02-06 04:15:27,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 151 transitions, 1346 flow [2025-02-06 04:15:27,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 04:15:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-06 04:15:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2025-02-06 04:15:27,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2025-02-06 04:15:27,399 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 390 flow. Second operand 19 states and 231 transitions. [2025-02-06 04:15:27,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 151 transitions, 1346 flow [2025-02-06 04:15:27,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 151 transitions, 1267 flow, removed 32 selfloop flow, removed 5 redundant places. [2025-02-06 04:15:27,408 INFO L231 Difference]: Finished difference. Result has 88 places, 51 transitions, 521 flow [2025-02-06 04:15:27,408 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-02-06 04:15:27,408 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 62 predicate places. [2025-02-06 04:15:27,408 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 51 transitions, 521 flow [2025-02-06 04:15:27,408 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-02-06 04:15:27,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:27,408 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:27,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 04:15:27,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:27,609 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-02-06 04:15:27,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:27,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1919587149, now seen corresponding path program 2 times [2025-02-06 04:15:27,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:27,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740814066] [2025-02-06 04:15:27,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:15:27,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:27,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:15:27,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:15:27,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:15:27,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:27,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:27,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740814066] [2025-02-06 04:15:27,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740814066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:27,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:27,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:15:27,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263597860] [2025-02-06 04:15:27,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:27,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:15:27,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:27,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:15:27,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:15:27,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:27,715 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-02-06 04:15:27,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:27,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:27,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:27,998 INFO L124 PetriNetUnfolderBase]: 652/1217 cut-off events. [2025-02-06 04:15:27,999 INFO L125 PetriNetUnfolderBase]: For 19130/19130 co-relation queries the response was YES. [2025-02-06 04:15:28,002 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-02-06 04:15:28,007 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 76 selfloop transitions, 23 changer transitions 31/133 dead transitions. [2025-02-06 04:15:28,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 133 transitions, 1509 flow [2025-02-06 04:15:28,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 04:15:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 04:15:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 187 transitions. [2025-02-06 04:15:28,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2025-02-06 04:15:28,008 INFO L175 Difference]: Start difference. First operand has 88 places, 51 transitions, 521 flow. Second operand 15 states and 187 transitions. [2025-02-06 04:15:28,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 133 transitions, 1509 flow [2025-02-06 04:15:28,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 133 transitions, 1211 flow, removed 138 selfloop flow, removed 12 redundant places. [2025-02-06 04:15:28,025 INFO L231 Difference]: Finished difference. Result has 90 places, 57 transitions, 583 flow [2025-02-06 04:15:28,025 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-02-06 04:15:28,026 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 64 predicate places. [2025-02-06 04:15:28,026 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 57 transitions, 583 flow [2025-02-06 04:15:28,026 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-02-06 04:15:28,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:28,026 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:28,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:15:28,026 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-02-06 04:15:28,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:28,027 INFO L85 PathProgramCache]: Analyzing trace with hash -744688909, now seen corresponding path program 3 times [2025-02-06 04:15:28,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:28,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149172681] [2025-02-06 04:15:28,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:15:28,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:28,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-02-06 04:15:28,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:15:28,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:15:28,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:28,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:28,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149172681] [2025-02-06 04:15:28,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149172681] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:15:28,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264580914] [2025-02-06 04:15:28,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:15:28,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:28,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:28,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:15:28,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:15:28,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-02-06 04:15:28,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:15:28,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:15:28,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:28,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 04:15:28,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:15:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:28,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:15:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:28,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264580914] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:15:28,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:15:28,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 04:15:28,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066909590] [2025-02-06 04:15:28,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:15:28,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 04:15:28,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:28,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 04:15:28,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:15:28,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:28,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 57 transitions, 583 flow. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 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-02-06 04:15:28,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:28,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:28,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:28,792 INFO L124 PetriNetUnfolderBase]: 841/1529 cut-off events. [2025-02-06 04:15:28,792 INFO L125 PetriNetUnfolderBase]: For 24317/24317 co-relation queries the response was YES. [2025-02-06 04:15:28,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7756 conditions, 1529 events. 841/1529 cut-off events. For 24317/24317 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7243 event pairs, 46 based on Foata normal form. 81/1606 useless extension candidates. Maximal degree in co-relation 7713. Up to 246 conditions per place. [2025-02-06 04:15:28,799 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 79 selfloop transitions, 49 changer transitions 83/214 dead transitions. [2025-02-06 04:15:28,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 214 transitions, 2477 flow [2025-02-06 04:15:28,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 04:15:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-02-06 04:15:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 321 transitions. [2025-02-06 04:15:28,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5144230769230769 [2025-02-06 04:15:28,801 INFO L175 Difference]: Start difference. First operand has 90 places, 57 transitions, 583 flow. Second operand 26 states and 321 transitions. [2025-02-06 04:15:28,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 214 transitions, 2477 flow [2025-02-06 04:15:28,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 214 transitions, 2253 flow, removed 96 selfloop flow, removed 10 redundant places. [2025-02-06 04:15:28,824 INFO L231 Difference]: Finished difference. Result has 119 places, 70 transitions, 953 flow [2025-02-06 04:15:28,824 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=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=953, PETRI_PLACES=119, PETRI_TRANSITIONS=70} [2025-02-06 04:15:28,825 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 93 predicate places. [2025-02-06 04:15:28,825 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 70 transitions, 953 flow [2025-02-06 04:15:28,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 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-02-06 04:15:28,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:28,825 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:28,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:15:29,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:29,029 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-02-06 04:15:29,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:29,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1992501135, now seen corresponding path program 1 times [2025-02-06 04:15:29,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:29,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409353576] [2025-02-06 04:15:29,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:29,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:29,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:15:29,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:15:29,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:29,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:29,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:29,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409353576] [2025-02-06 04:15:29,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409353576] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:15:29,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950356278] [2025-02-06 04:15:29,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:29,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:29,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:29,136 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:15:29,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:15:29,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:15:29,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:15:29,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:29,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:29,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 04:15:29,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:15:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:29,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:15:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:29,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950356278] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:15:29,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:15:29,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-02-06 04:15:29,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319637437] [2025-02-06 04:15:29,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:15:29,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 04:15:29,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:29,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 04:15:29,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-02-06 04:15:29,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:29,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 70 transitions, 953 flow. Second operand has 18 states, 18 states have (on average 7.055555555555555) internal successors, (127), 18 states have internal predecessors, (127), 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-02-06 04:15:29,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:29,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:29,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:29,990 INFO L124 PetriNetUnfolderBase]: 1327/2416 cut-off events. [2025-02-06 04:15:29,990 INFO L125 PetriNetUnfolderBase]: For 77863/77863 co-relation queries the response was YES. [2025-02-06 04:15:29,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14985 conditions, 2416 events. 1327/2416 cut-off events. For 77863/77863 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 11833 event pairs, 83 based on Foata normal form. 63/2474 useless extension candidates. Maximal degree in co-relation 14928. Up to 444 conditions per place. [2025-02-06 04:15:30,006 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 97 selfloop transitions, 80 changer transitions 86/266 dead transitions. [2025-02-06 04:15:30,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 266 transitions, 4124 flow [2025-02-06 04:15:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-06 04:15:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-02-06 04:15:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 358 transitions. [2025-02-06 04:15:30,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.514367816091954 [2025-02-06 04:15:30,009 INFO L175 Difference]: Start difference. First operand has 119 places, 70 transitions, 953 flow. Second operand 29 states and 358 transitions. [2025-02-06 04:15:30,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 266 transitions, 4124 flow [2025-02-06 04:15:30,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 266 transitions, 3416 flow, removed 330 selfloop flow, removed 18 redundant places. [2025-02-06 04:15:30,065 INFO L231 Difference]: Finished difference. Result has 141 places, 106 transitions, 1630 flow [2025-02-06 04:15:30,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1630, PETRI_PLACES=141, PETRI_TRANSITIONS=106} [2025-02-06 04:15:30,066 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 115 predicate places. [2025-02-06 04:15:30,066 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 106 transitions, 1630 flow [2025-02-06 04:15:30,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.055555555555555) internal successors, (127), 18 states have internal predecessors, (127), 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-02-06 04:15:30,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:30,066 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:30,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 04:15:30,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:30,267 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-02-06 04:15:30,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:30,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1036724740, now seen corresponding path program 2 times [2025-02-06 04:15:30,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:30,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485033916] [2025-02-06 04:15:30,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:15:30,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:30,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-06 04:15:30,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:15:30,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:15:30,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:30,456 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:15:30,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:30,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485033916] [2025-02-06 04:15:30,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485033916] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:15:30,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657259017] [2025-02-06 04:15:30,457 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:15:30,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:30,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:30,463 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:15:30,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:15:30,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-06 04:15:30,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:15:30,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:15:30,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:30,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 04:15:30,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:15:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:15:30,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:15:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:15:30,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657259017] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:15:30,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:15:30,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2025-02-06 04:15:30,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223634705] [2025-02-06 04:15:30,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:15:30,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 04:15:30,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:30,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 04:15:30,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2025-02-06 04:15:30,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:30,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 106 transitions, 1630 flow. Second operand has 25 states, 25 states have (on average 7.2) internal successors, (180), 25 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:30,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:30,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:30,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:31,679 INFO L124 PetriNetUnfolderBase]: 1561/2913 cut-off events. [2025-02-06 04:15:31,680 INFO L125 PetriNetUnfolderBase]: For 172037/172037 co-relation queries the response was YES. [2025-02-06 04:15:31,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21787 conditions, 2913 events. 1561/2913 cut-off events. For 172037/172037 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 13993 event pairs, 455 based on Foata normal form. 117/3026 useless extension candidates. Maximal degree in co-relation 21720. Up to 1656 conditions per place. [2025-02-06 04:15:31,700 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 152 selfloop transitions, 35 changer transitions 133/323 dead transitions. [2025-02-06 04:15:31,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 323 transitions, 6273 flow [2025-02-06 04:15:31,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-06 04:15:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-02-06 04:15:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 441 transitions. [2025-02-06 04:15:31,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4966216216216216 [2025-02-06 04:15:31,702 INFO L175 Difference]: Start difference. First operand has 141 places, 106 transitions, 1630 flow. Second operand 37 states and 441 transitions. [2025-02-06 04:15:31,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 323 transitions, 6273 flow [2025-02-06 04:15:31,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 323 transitions, 4779 flow, removed 724 selfloop flow, removed 14 redundant places. [2025-02-06 04:15:31,878 INFO L231 Difference]: Finished difference. Result has 181 places, 120 transitions, 1824 flow [2025-02-06 04:15:31,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1824, PETRI_PLACES=181, PETRI_TRANSITIONS=120} [2025-02-06 04:15:31,878 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 155 predicate places. [2025-02-06 04:15:31,878 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 120 transitions, 1824 flow [2025-02-06 04:15:31,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.2) internal successors, (180), 25 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:31,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:31,879 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:31,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 04:15:32,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 04:15:32,083 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-02-06 04:15:32,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:32,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1267859288, now seen corresponding path program 3 times [2025-02-06 04:15:32,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:32,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467143175] [2025-02-06 04:15:32,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:15:32,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:32,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-02-06 04:15:32,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:15:32,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-06 04:15:32,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:15:32,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:32,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467143175] [2025-02-06 04:15:32,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467143175] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:15:32,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19722580] [2025-02-06 04:15:32,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:15:32,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:32,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:32,269 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:15:32,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 04:15:32,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-02-06 04:15:32,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:15:32,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-06 04:15:32,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:32,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 04:15:32,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:15:32,398 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:15:32,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:15:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:15:32,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19722580] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:15:32,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:15:32,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2025-02-06 04:15:32,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003219575] [2025-02-06 04:15:32,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:15:32,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 04:15:32,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:32,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 04:15:32,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2025-02-06 04:15:32,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:32,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 120 transitions, 1824 flow. Second operand has 25 states, 25 states have (on average 7.2) internal successors, (180), 25 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:32,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:32,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:32,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:33,791 INFO L124 PetriNetUnfolderBase]: 1957/3799 cut-off events. [2025-02-06 04:15:33,791 INFO L125 PetriNetUnfolderBase]: For 291079/291079 co-relation queries the response was YES. [2025-02-06 04:15:33,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30189 conditions, 3799 events. 1957/3799 cut-off events. For 291079/291079 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 20776 event pairs, 266 based on Foata normal form. 117/3912 useless extension candidates. Maximal degree in co-relation 30104. Up to 1084 conditions per place. [2025-02-06 04:15:33,820 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 152 selfloop transitions, 106 changer transitions 147/408 dead transitions. [2025-02-06 04:15:33,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 408 transitions, 8148 flow [2025-02-06 04:15:33,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-02-06 04:15:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-02-06 04:15:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 527 transitions. [2025-02-06 04:15:33,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4990530303030303 [2025-02-06 04:15:33,823 INFO L175 Difference]: Start difference. First operand has 181 places, 120 transitions, 1824 flow. Second operand 44 states and 527 transitions. [2025-02-06 04:15:33,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 408 transitions, 8148 flow [2025-02-06 04:15:34,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 408 transitions, 6881 flow, removed 613 selfloop flow, removed 24 redundant places. [2025-02-06 04:15:34,062 INFO L231 Difference]: Finished difference. Result has 213 places, 165 transitions, 2837 flow [2025-02-06 04:15:34,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=2837, PETRI_PLACES=213, PETRI_TRANSITIONS=165} [2025-02-06 04:15:34,064 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 187 predicate places. [2025-02-06 04:15:34,064 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 165 transitions, 2837 flow [2025-02-06 04:15:34,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.2) internal successors, (180), 25 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:34,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:34,064 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:34,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 04:15:34,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 04:15:34,269 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-02-06 04:15:34,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:34,269 INFO L85 PathProgramCache]: Analyzing trace with hash -793463228, now seen corresponding path program 4 times [2025-02-06 04:15:34,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:34,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339139399] [2025-02-06 04:15:34,270 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:15:34,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:34,277 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-02-06 04:15:34,283 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:15:34,286 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:15:34,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:15:34,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:34,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339139399] [2025-02-06 04:15:34,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339139399] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:15:34,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038455821] [2025-02-06 04:15:34,454 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:15:34,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:34,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:34,456 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:15:34,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 04:15:34,491 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-02-06 04:15:34,502 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:15:34,502 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:15:34,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:34,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 04:15:34,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:15:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:15:34,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:15:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:15:34,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038455821] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:15:34,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:15:34,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-02-06 04:15:34,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787879997] [2025-02-06 04:15:34,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:15:34,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 04:15:34,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:34,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 04:15:34,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2025-02-06 04:15:34,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:34,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 165 transitions, 2837 flow. Second operand has 26 states, 26 states have (on average 7.230769230769231) internal successors, (188), 26 states have internal predecessors, (188), 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-02-06 04:15:34,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:34,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:34,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:36,497 INFO L124 PetriNetUnfolderBase]: 3433/6569 cut-off events. [2025-02-06 04:15:36,497 INFO L125 PetriNetUnfolderBase]: For 700008/700008 co-relation queries the response was YES. [2025-02-06 04:15:36,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57356 conditions, 6569 events. 3433/6569 cut-off events. For 700008/700008 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 41191 event pairs, 144 based on Foata normal form. 126/6691 useless extension candidates. Maximal degree in co-relation 57258. Up to 1500 conditions per place. [2025-02-06 04:15:36,573 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 161 selfloop transitions, 235 changer transitions 162/561 dead transitions. [2025-02-06 04:15:36,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 561 transitions, 12693 flow [2025-02-06 04:15:36,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-02-06 04:15:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-02-06 04:15:36,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 607 transitions. [2025-02-06 04:15:36,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5058333333333334 [2025-02-06 04:15:36,698 INFO L175 Difference]: Start difference. First operand has 213 places, 165 transitions, 2837 flow. Second operand 50 states and 607 transitions. [2025-02-06 04:15:36,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 561 transitions, 12693 flow [2025-02-06 04:15:37,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 561 transitions, 10864 flow, removed 886 selfloop flow, removed 26 redundant places. [2025-02-06 04:15:37,595 INFO L231 Difference]: Finished difference. Result has 256 places, 278 transitions, 5391 flow [2025-02-06 04:15:37,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=5391, PETRI_PLACES=256, PETRI_TRANSITIONS=278} [2025-02-06 04:15:37,595 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 230 predicate places. [2025-02-06 04:15:37,595 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 278 transitions, 5391 flow [2025-02-06 04:15:37,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.230769230769231) internal successors, (188), 26 states have internal predecessors, (188), 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-02-06 04:15:37,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:37,596 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:37,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 04:15:37,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 04:15:37,797 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:15:37,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:37,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1109439891, now seen corresponding path program 5 times [2025-02-06 04:15:37,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:37,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848540932] [2025-02-06 04:15:37,798 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:15:37,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:37,803 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 7 equivalence classes. [2025-02-06 04:15:37,808 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 04:15:37,808 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-02-06 04:15:37,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:15:37,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:37,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848540932] [2025-02-06 04:15:37,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848540932] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:15:37,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236274847] [2025-02-06 04:15:37,981 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:15:37,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:37,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:37,984 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:15:37,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 04:15:38,018 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 7 equivalence classes. [2025-02-06 04:15:38,031 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 04:15:38,031 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-02-06 04:15:38,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:38,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 04:15:38,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:15:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:15:38,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:15:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:15:38,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236274847] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:15:38,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:15:38,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2025-02-06 04:15:38,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052509152] [2025-02-06 04:15:38,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:15:38,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 04:15:38,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:38,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 04:15:38,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2025-02-06 04:15:38,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:38,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 278 transitions, 5391 flow. Second operand has 27 states, 27 states have (on average 7.185185185185185) internal successors, (194), 27 states have internal predecessors, (194), 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-02-06 04:15:38,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:38,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:38,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:40,928 INFO L124 PetriNetUnfolderBase]: 4819/9213 cut-off events. [2025-02-06 04:15:40,929 INFO L125 PetriNetUnfolderBase]: For 1635604/1635604 co-relation queries the response was YES. [2025-02-06 04:15:40,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99057 conditions, 9213 events. 4819/9213 cut-off events. For 1635604/1635604 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 59391 event pairs, 47 based on Foata normal form. 135/9343 useless extension candidates. Maximal degree in co-relation 98939. Up to 2127 conditions per place. [2025-02-06 04:15:41,052 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 198 selfloop transitions, 357 changer transitions 183/741 dead transitions. [2025-02-06 04:15:41,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 741 transitions, 21890 flow [2025-02-06 04:15:41,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-02-06 04:15:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-02-06 04:15:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 750 transitions. [2025-02-06 04:15:41,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5122950819672131 [2025-02-06 04:15:41,059 INFO L175 Difference]: Start difference. First operand has 256 places, 278 transitions, 5391 flow. Second operand 61 states and 750 transitions. [2025-02-06 04:15:41,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 741 transitions, 21890 flow [2025-02-06 04:15:43,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 741 transitions, 15904 flow, removed 2955 selfloop flow, removed 25 redundant places. [2025-02-06 04:15:43,392 INFO L231 Difference]: Finished difference. Result has 318 places, 387 transitions, 8332 flow [2025-02-06 04:15:43,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4027, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=8332, PETRI_PLACES=318, PETRI_TRANSITIONS=387} [2025-02-06 04:15:43,393 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 292 predicate places. [2025-02-06 04:15:43,393 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 387 transitions, 8332 flow [2025-02-06 04:15:43,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.185185185185185) internal successors, (194), 27 states have internal predecessors, (194), 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-02-06 04:15:43,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:43,394 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:43,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 04:15:43,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:43,598 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:15:43,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:43,599 INFO L85 PathProgramCache]: Analyzing trace with hash 583419097, now seen corresponding path program 6 times [2025-02-06 04:15:43,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:43,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99808198] [2025-02-06 04:15:43,599 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:15:43,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:43,603 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 66 statements into 8 equivalence classes. [2025-02-06 04:15:43,616 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 04:15:43,619 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-06 04:15:43,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 188 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:43,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:43,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99808198] [2025-02-06 04:15:43,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99808198] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:15:43,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383526272] [2025-02-06 04:15:43,922 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:15:43,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:43,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:43,930 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:15:43,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 04:15:43,961 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 66 statements into 8 equivalence classes. [2025-02-06 04:15:43,980 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 04:15:43,980 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-06 04:15:43,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:43,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 04:15:43,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:15:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 188 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:44,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:15:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 188 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:44,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383526272] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:15:44,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:15:44,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-02-06 04:15:44,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801428132] [2025-02-06 04:15:44,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:15:44,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-06 04:15:44,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:44,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-06 04:15:44,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=1586, Unknown=0, NotChecked=0, Total=2070 [2025-02-06 04:15:44,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:44,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 387 transitions, 8332 flow. Second operand has 46 states, 46 states have (on average 7.021739130434782) internal successors, (323), 46 states have internal predecessors, (323), 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-02-06 04:15:44,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:44,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:44,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:49,706 INFO L124 PetriNetUnfolderBase]: 6574/12421 cut-off events. [2025-02-06 04:15:49,707 INFO L125 PetriNetUnfolderBase]: For 3237313/3237313 co-relation queries the response was YES. [2025-02-06 04:15:49,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155451 conditions, 12421 events. 6574/12421 cut-off events. For 3237313/3237313 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 76694 event pairs, 58 based on Foata normal form. 279/12696 useless extension candidates. Maximal degree in co-relation 155304. Up to 2835 conditions per place. [2025-02-06 04:15:49,835 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 316 selfloop transitions, 470 changer transitions 329/1118 dead transitions. [2025-02-06 04:15:49,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 1118 transitions, 37469 flow [2025-02-06 04:15:49,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-02-06 04:15:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2025-02-06 04:15:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 1284 transitions. [2025-02-06 04:15:49,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2025-02-06 04:15:49,837 INFO L175 Difference]: Start difference. First operand has 318 places, 387 transitions, 8332 flow. Second operand 105 states and 1284 transitions. [2025-02-06 04:15:49,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 1118 transitions, 37469 flow [2025-02-06 04:15:53,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 1118 transitions, 29014 flow, removed 4177 selfloop flow, removed 27 redundant places. [2025-02-06 04:15:53,466 INFO L231 Difference]: Finished difference. Result has 444 places, 502 transitions, 12264 flow [2025-02-06 04:15:53,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6067, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=358, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=12264, PETRI_PLACES=444, PETRI_TRANSITIONS=502} [2025-02-06 04:15:53,467 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 418 predicate places. [2025-02-06 04:15:53,468 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 502 transitions, 12264 flow [2025-02-06 04:15:53,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 7.021739130434782) internal successors, (323), 46 states have internal predecessors, (323), 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-02-06 04:15:53,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:53,471 INFO L206 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:53,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 04:15:53,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:53,671 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:15:53,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:53,672 INFO L85 PathProgramCache]: Analyzing trace with hash 240427289, now seen corresponding path program 7 times [2025-02-06 04:15:53,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:53,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020392526] [2025-02-06 04:15:53,672 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:15:53,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:53,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 04:15:53,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 04:15:53,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:53,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 0 proven. 695 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:15:54,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:54,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020392526] [2025-02-06 04:15:54,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020392526] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:15:54,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107705451] [2025-02-06 04:15:54,580 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:15:54,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:54,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:54,581 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:15:54,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 04:15:54,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 04:15:54,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 04:15:54,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:54,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:54,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 04:15:54,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:15:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 0 proven. 695 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:15:54,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:15:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 0 proven. 695 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:15:55,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107705451] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:15:55,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:15:55,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 45 [2025-02-06 04:15:55,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975360029] [2025-02-06 04:15:55,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:15:55,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-06 04:15:55,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:55,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-06 04:15:55,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=1610, Unknown=0, NotChecked=0, Total=2070 [2025-02-06 04:15:55,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:55,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 502 transitions, 12264 flow. Second operand has 46 states, 46 states have (on average 7.195652173913044) internal successors, (331), 46 states have internal predecessors, (331), 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-02-06 04:15:55,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:55,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:55,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:16:02,101 INFO L124 PetriNetUnfolderBase]: 8635/16057 cut-off events. [2025-02-06 04:16:02,102 INFO L125 PetriNetUnfolderBase]: For 6562932/6562932 co-relation queries the response was YES. [2025-02-06 04:16:02,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230190 conditions, 16057 events. 8635/16057 cut-off events. For 6562932/6562932 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 97359 event pairs, 65 based on Foata normal form. 54/16106 useless extension candidates. Maximal degree in co-relation 229995. Up to 3621 conditions per place. [2025-02-06 04:16:02,437 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 320 selfloop transitions, 631 changer transitions 195/1149 dead transitions. [2025-02-06 04:16:02,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 1149 transitions, 43320 flow [2025-02-06 04:16:02,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-02-06 04:16:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2025-02-06 04:16:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 1041 transitions. [2025-02-06 04:16:02,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5043604651162791 [2025-02-06 04:16:02,439 INFO L175 Difference]: Start difference. First operand has 444 places, 502 transitions, 12264 flow. Second operand 86 states and 1041 transitions. [2025-02-06 04:16:02,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 1149 transitions, 43320 flow [2025-02-06 04:16:20,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 1149 transitions, 28246 flow, removed 7436 selfloop flow, removed 40 redundant places. [2025-02-06 04:16:20,559 INFO L231 Difference]: Finished difference. Result has 486 places, 669 transitions, 13503 flow [2025-02-06 04:16:20,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=8226, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=469, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=13503, PETRI_PLACES=486, PETRI_TRANSITIONS=669} [2025-02-06 04:16:20,560 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 460 predicate places. [2025-02-06 04:16:20,560 INFO L471 AbstractCegarLoop]: Abstraction has has 486 places, 669 transitions, 13503 flow [2025-02-06 04:16:20,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 7.195652173913044) internal successors, (331), 46 states have internal predecessors, (331), 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-02-06 04:16:20,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:16:20,560 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:16:20,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 04:16:20,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:16:20,764 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:16:20,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:16:20,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2007418164, now seen corresponding path program 8 times [2025-02-06 04:16:20,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:16:20,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008420418] [2025-02-06 04:16:20,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:16:20,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:16:20,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 129 statements into 2 equivalence classes. [2025-02-06 04:16:20,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 04:16:20,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:16:20,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:16:20,801 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:16:20,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 04:16:20,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 04:16:20,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:16:20,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:16:20,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:16:20,851 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:16:20,852 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-02-06 04:16:20,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-02-06 04:16:20,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-02-06 04:16:20,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 04:16:20,854 INFO L422 BasicCegarLoop]: Path program histogram: [8, 3, 2, 2, 1] [2025-02-06 04:16:20,945 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:16:20,945 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:16:20,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:16:20 BasicIcfg [2025-02-06 04:16:20,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:16:20,949 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:16:20,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:16:20,949 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:16:20,950 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:15:24" (3/4) ... [2025-02-06 04:16:20,950 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 04:16:21,033 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 42. [2025-02-06 04:16:21,097 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:16:21,097 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:16:21,098 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:16:21,099 INFO L158 Benchmark]: Toolchain (without parser) took 57153.30ms. Allocated memory was 142.6MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 104.2MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2025-02-06 04:16:21,101 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:16:21,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.46ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 85.0MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:16:21,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.70ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 83.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:16:21,101 INFO L158 Benchmark]: Boogie Preprocessor took 18.10ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 81.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:16:21,101 INFO L158 Benchmark]: IcfgBuilder took 374.88ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 64.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:16:21,102 INFO L158 Benchmark]: TraceAbstraction took 56246.58ms. Allocated memory was 142.6MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 63.3MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-02-06 04:16:21,102 INFO L158 Benchmark]: Witness Printer took 149.21ms. Allocated memory is still 4.6GB. Free memory was 2.5GB in the beginning and 2.4GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 04:16:21,103 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.19ms. Allocated memory is still 226.5MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.46ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 85.0MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.70ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 83.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.10ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 81.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 374.88ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 64.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 56246.58ms. Allocated memory was 142.6MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 63.3MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 149.21ms. Allocated memory is still 4.6GB. Free memory was 2.5GB in the beginning and 2.4GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, argc=49, i=3, id1=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, argc=49, i=7, id1=-1, id2=0, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=15] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L716] 0 int condI = i >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, i=43, id1=-1, id2=0, j=44, k=19, k=19] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L719] 0 int condJ = j >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=45, id1=-1, id2=0, j=46, k=19, k=19] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=45, id1=-1, id2=0, j=46, k=19, k=19] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=45, id1=-1, id2=0, j=46, k=19, k=19] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - 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: 56.1s, OverallIterations: 16, TraceHistogramMax: 20, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 47.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7139 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7130 mSDsluCounter, 309 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 398 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6566 IncrementalHoareTripleChecker+Invalid, 6964 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 398 mSolverCounterUnsat, 4 mSDtfsCounter, 6566 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1398 GetRequests, 677 SyntacticMatches, 31 SemanticMatches, 690 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19208 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13503occurred in iteration=15, InterpolantAutomatonStates: 517, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1014 NumberOfCodeBlocks, 1014 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 1254 ConstructedInterpolants, 0 QuantifiedInterpolants, 4921 SizeOfPredicates, 111 NumberOfNonLiveVariables, 1201 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 34/3132 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 RESULT: Ultimate proved your program to be incorrect! [2025-02-06 04:16:21,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE