./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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-1.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 b585114ab4aff9777d36c84f93f7abe0931f77338421f004296c8a8d328d3dfd --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:55:10,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:55:10,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 00:55:10,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:55:10,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:55:10,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:55:10,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:55:10,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:55:10,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:55:10,843 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:55:10,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:55:10,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:55:10,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:55:10,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:55:10,844 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:55:10,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:55:10,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:55:10,844 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 00:55:10,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:55:10,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 00:55:10,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:55:10,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:55:10,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:55:10,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:55:10,844 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 00:55:10,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:55:10,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:55:10,845 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:55:10,845 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:55:10,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:55:10,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:55:10,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:55:10,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:55:10,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:55:10,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:55:10,845 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:55:10,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:55:10,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:55:10,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:55:10,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:55:10,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:55:10,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:55:10,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:55:10,846 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 -> b585114ab4aff9777d36c84f93f7abe0931f77338421f004296c8a8d328d3dfd [2025-02-08 00:55:11,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:55:11,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:55:11,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:55:11,095 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:55:11,095 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:55:11,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-1.i [2025-02-08 00:55:12,265 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0355c1327/31c9fb0052314087a5b3ab8c02c9d9aa/FLAG8dd0adf7c [2025-02-08 00:55:12,541 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:55:12,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/triangular-1.i [2025-02-08 00:55:12,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0355c1327/31c9fb0052314087a5b3ab8c02c9d9aa/FLAG8dd0adf7c [2025-02-08 00:55:12,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0355c1327/31c9fb0052314087a5b3ab8c02c9d9aa [2025-02-08 00:55:12,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:55:12,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:55:12,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:55:12,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:55:12,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:55:12,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:55:12" (1/1) ... [2025-02-08 00:55:12,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bb3c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:12, skipping insertion in model container [2025-02-08 00:55:12,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:55:12" (1/1) ... [2025-02-08 00:55:12,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:55:12,886 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-1.i[30950,30963] [2025-02-08 00:55:12,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:55:12,900 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:55:12,947 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-1.i[30950,30963] [2025-02-08 00:55:12,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:55:12,975 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:55:12,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:12 WrapperNode [2025-02-08 00:55:12,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:55:12,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:55:12,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:55:12,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:55:12,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:12" (1/1) ... [2025-02-08 00:55:12,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:12" (1/1) ... [2025-02-08 00:55:13,007 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-02-08 00:55:13,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:55:13,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:55:13,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:55:13,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:55:13,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:12" (1/1) ... [2025-02-08 00:55:13,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:12" (1/1) ... [2025-02-08 00:55:13,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:12" (1/1) ... [2025-02-08 00:55:13,023 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-08 00:55:13,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:12" (1/1) ... [2025-02-08 00:55:13,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:12" (1/1) ... [2025-02-08 00:55:13,025 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:12" (1/1) ... [2025-02-08 00:55:13,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:12" (1/1) ... [2025-02-08 00:55:13,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:12" (1/1) ... [2025-02-08 00:55:13,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:12" (1/1) ... [2025-02-08 00:55:13,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:55:13,029 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:55:13,030 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:55:13,030 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:55:13,031 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:12" (1/1) ... [2025-02-08 00:55:13,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:55:13,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:55:13,058 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-08 00:55:13,062 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-08 00:55:13,088 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-08 00:55:13,088 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-08 00:55:13,088 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-08 00:55:13,088 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-08 00:55:13,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 00:55:13,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:55:13,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:55:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 00:55:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:55:13,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:55:13,090 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 00:55:13,172 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:55:13,173 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:55:13,295 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 00:55:13,295 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:55:13,352 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:55:13,353 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:55:13,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:55:13 BoogieIcfgContainer [2025-02-08 00:55:13,353 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:55:13,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:55:13,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:55:13,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:55:13,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:55:12" (1/3) ... [2025-02-08 00:55:13,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2850fc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:55:13, skipping insertion in model container [2025-02-08 00:55:13,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:12" (2/3) ... [2025-02-08 00:55:13,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2850fc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:55:13, skipping insertion in model container [2025-02-08 00:55:13,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:55:13" (3/3) ... [2025-02-08 00:55:13,360 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-1.i [2025-02-08 00:55:13,377 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:55:13,379 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-1.i that has 3 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-08 00:55:13,379 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 00:55:13,424 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:55:13,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2025-02-08 00:55:13,478 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-02-08 00:55:13,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:55:13,485 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 25 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-08 00:55:13,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2025-02-08 00:55:13,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2025-02-08 00:55:13,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:55:13,508 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;@365fdbc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:55:13,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-08 00:55:13,514 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:55:13,515 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-02-08 00:55:13,515 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:55:13,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:13,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:13,516 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-08 00:55:13,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:13,519 INFO L85 PathProgramCache]: Analyzing trace with hash 355335699, now seen corresponding path program 1 times [2025-02-08 00:55:13,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:13,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879264771] [2025-02-08 00:55:13,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:13,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:13,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 00:55:13,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 00:55:13,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:13,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:13,881 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-08 00:55:13,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:13,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879264771] [2025-02-08 00:55:13,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879264771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:13,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:13,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:55:13,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399878963] [2025-02-08 00:55:13,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:13,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:55:13,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:13,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:55:13,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:55:13,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-08 00:55:13,924 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-08 00:55:13,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:13,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-08 00:55:13,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:14,144 INFO L124 PetriNetUnfolderBase]: 321/540 cut-off events. [2025-02-08 00:55:14,144 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 00:55:14,146 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 2120 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-08 00:55:14,150 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2025-02-08 00:55:14,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2025-02-08 00:55:14,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:55:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 00:55:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-02-08 00:55:14,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-02-08 00:55:14,163 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 6 states and 84 transitions. [2025-02-08 00:55:14,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 54 transitions, 216 flow [2025-02-08 00:55:14,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 00:55:14,171 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 71 flow [2025-02-08 00:55:14,173 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-08 00:55:14,176 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2025-02-08 00:55:14,177 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 71 flow [2025-02-08 00:55:14,177 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-08 00:55:14,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:14,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:14,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:55:14,178 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-08 00:55:14,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash 964778290, now seen corresponding path program 1 times [2025-02-08 00:55:14,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:14,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989028493] [2025-02-08 00:55:14,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:14,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:14,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 00:55:14,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 00:55:14,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:14,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:14,336 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-08 00:55:14,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:14,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989028493] [2025-02-08 00:55:14,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989028493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:14,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:14,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:55:14,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982606795] [2025-02-08 00:55:14,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:14,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:55:14,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:14,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:55:14,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:55:14,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-08 00:55:14,343 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-08 00:55:14,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:14,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-08 00:55:14,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:14,538 INFO L124 PetriNetUnfolderBase]: 382/687 cut-off events. [2025-02-08 00:55:14,539 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2025-02-08 00:55:14,540 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 2905 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-08 00:55:14,544 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 9 changer transitions 20/78 dead transitions. [2025-02-08 00:55:14,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 78 transitions, 379 flow [2025-02-08 00:55:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:55:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 00:55:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2025-02-08 00:55:14,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-02-08 00:55:14,546 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 71 flow. Second operand 9 states and 117 transitions. [2025-02-08 00:55:14,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 78 transitions, 379 flow [2025-02-08 00:55:14,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 363 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-02-08 00:55:14,549 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 156 flow [2025-02-08 00:55:14,549 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-08 00:55:14,549 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2025-02-08 00:55:14,549 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 156 flow [2025-02-08 00:55:14,550 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-08 00:55:14,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:14,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:14,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:55:14,550 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-08 00:55:14,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:14,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1319887630, now seen corresponding path program 2 times [2025-02-08 00:55:14,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:14,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332857584] [2025-02-08 00:55:14,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:55:14,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:14,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-02-08 00:55:14,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 00:55:14,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 00:55:14,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:14,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:14,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332857584] [2025-02-08 00:55:14,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332857584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:14,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:14,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:55:14,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567234557] [2025-02-08 00:55:14,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:14,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:55:14,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:14,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:55:14,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:55:14,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-08 00:55:14,693 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-08 00:55:14,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:14,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-08 00:55:14,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:14,856 INFO L124 PetriNetUnfolderBase]: 328/603 cut-off events. [2025-02-08 00:55:14,856 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2025-02-08 00:55:14,858 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 2509 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-08 00:55:14,860 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 9 changer transitions 28/78 dead transitions. [2025-02-08 00:55:14,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 496 flow [2025-02-08 00:55:14,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:55:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 00:55:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-02-08 00:55:14,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2025-02-08 00:55:14,861 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 156 flow. Second operand 8 states and 103 transitions. [2025-02-08 00:55:14,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 496 flow [2025-02-08 00:55:14,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 488 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-08 00:55:14,865 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 210 flow [2025-02-08 00:55:14,865 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-08 00:55:14,865 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-02-08 00:55:14,866 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 210 flow [2025-02-08 00:55:14,866 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-08 00:55:14,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:14,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:14,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:55:14,866 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-08 00:55:14,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:14,867 INFO L85 PathProgramCache]: Analyzing trace with hash -443489336, now seen corresponding path program 1 times [2025-02-08 00:55:14,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:14,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036072472] [2025-02-08 00:55:14,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:14,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:14,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 00:55:14,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 00:55:14,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:14,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:14,996 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-08 00:55:14,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:14,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036072472] [2025-02-08 00:55:14,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036072472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:14,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:14,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:55:14,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647439215] [2025-02-08 00:55:14,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:14,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:55:14,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:14,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:55:14,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:55:15,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-08 00:55:15,002 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-08 00:55:15,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:15,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-08 00:55:15,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:15,218 INFO L124 PetriNetUnfolderBase]: 337/612 cut-off events. [2025-02-08 00:55:15,218 INFO L125 PetriNetUnfolderBase]: For 1649/1649 co-relation queries the response was YES. [2025-02-08 00:55:15,220 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 2541 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-08 00:55:15,221 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 16 changer transitions 24/89 dead transitions. [2025-02-08 00:55:15,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 607 flow [2025-02-08 00:55:15,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 00:55:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 00:55:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2025-02-08 00:55:15,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-02-08 00:55:15,223 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 210 flow. Second operand 11 states and 135 transitions. [2025-02-08 00:55:15,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 607 flow [2025-02-08 00:55:15,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 540 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-02-08 00:55:15,228 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 279 flow [2025-02-08 00:55:15,228 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-08 00:55:15,229 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2025-02-08 00:55:15,229 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 279 flow [2025-02-08 00:55:15,229 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-08 00:55:15,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:15,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:15,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:55:15,230 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-08 00:55:15,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:15,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1513461300, now seen corresponding path program 2 times [2025-02-08 00:55:15,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:15,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080262559] [2025-02-08 00:55:15,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:55:15,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:15,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-02-08 00:55:15,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 00:55:15,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 00:55:15,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:15,303 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-08 00:55:15,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080262559] [2025-02-08 00:55:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080262559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:15,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:15,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:55:15,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345550707] [2025-02-08 00:55:15,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:15,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:55:15,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:15,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:55:15,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:55:15,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-08 00:55:15,311 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-08 00:55:15,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:15,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-08 00:55:15,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:15,507 INFO L124 PetriNetUnfolderBase]: 409/742 cut-off events. [2025-02-08 00:55:15,507 INFO L125 PetriNetUnfolderBase]: For 2292/2292 co-relation queries the response was YES. [2025-02-08 00:55:15,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 742 events. 409/742 cut-off events. For 2292/2292 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3153 event pairs, 71 based on Foata normal form. 27/764 useless extension candidates. Maximal degree in co-relation 2412. Up to 220 conditions per place. [2025-02-08 00:55:15,510 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 43 selfloop transitions, 18 changer transitions 28/92 dead transitions. [2025-02-08 00:55:15,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 685 flow [2025-02-08 00:55:15,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:55:15,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 00:55:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2025-02-08 00:55:15,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-02-08 00:55:15,527 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 279 flow. Second operand 10 states and 125 transitions. [2025-02-08 00:55:15,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 685 flow [2025-02-08 00:55:15,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 633 flow, removed 20 selfloop flow, removed 4 redundant places. [2025-02-08 00:55:15,534 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 347 flow [2025-02-08 00:55:15,534 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=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=347, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2025-02-08 00:55:15,536 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 37 predicate places. [2025-02-08 00:55:15,537 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 347 flow [2025-02-08 00:55:15,537 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-08 00:55:15,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:15,538 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:15,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:55:15,539 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-08 00:55:15,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:15,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1437571864, now seen corresponding path program 1 times [2025-02-08 00:55:15,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:15,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455145418] [2025-02-08 00:55:15,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:15,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:15,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 00:55:15,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 00:55:15,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:15,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:15,652 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-08 00:55:15,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:15,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455145418] [2025-02-08 00:55:15,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455145418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:15,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:15,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:55:15,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906234911] [2025-02-08 00:55:15,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:15,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:55:15,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:15,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:55:15,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:55:15,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-08 00:55:15,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 347 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-08 00:55:15,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:15,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-08 00:55:15,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:15,850 INFO L124 PetriNetUnfolderBase]: 436/793 cut-off events. [2025-02-08 00:55:15,851 INFO L125 PetriNetUnfolderBase]: For 3583/3583 co-relation queries the response was YES. [2025-02-08 00:55:15,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2909 conditions, 793 events. 436/793 cut-off events. For 3583/3583 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3439 event pairs, 59 based on Foata normal form. 18/806 useless extension candidates. Maximal degree in co-relation 2878. Up to 154 conditions per place. [2025-02-08 00:55:15,855 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 44 selfloop transitions, 24 changer transitions 23/94 dead transitions. [2025-02-08 00:55:15,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 94 transitions, 795 flow [2025-02-08 00:55:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:55:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 00:55:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2025-02-08 00:55:15,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-02-08 00:55:15,857 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 347 flow. Second operand 10 states and 125 transitions. [2025-02-08 00:55:15,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 94 transitions, 795 flow [2025-02-08 00:55:15,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 94 transitions, 751 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-02-08 00:55:15,864 INFO L231 Difference]: Finished difference. Result has 68 places, 46 transitions, 435 flow [2025-02-08 00:55:15,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=435, PETRI_PLACES=68, PETRI_TRANSITIONS=46} [2025-02-08 00:55:15,864 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 42 predicate places. [2025-02-08 00:55:15,864 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 435 flow [2025-02-08 00:55:15,864 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-08 00:55:15,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:15,865 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:15,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:55:15,865 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-08 00:55:15,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash -245987901, now seen corresponding path program 1 times [2025-02-08 00:55:15,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:15,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823646507] [2025-02-08 00:55:15,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:15,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:15,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 00:55:15,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 00:55:15,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:15,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:15,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:15,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823646507] [2025-02-08 00:55:15,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823646507] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:55:15,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003006376] [2025-02-08 00:55:15,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:15,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:15,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:55:15,977 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-08 00:55:15,978 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-08 00:55:16,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 00:55:16,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 00:55:16,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:16,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:16,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 00:55:16,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:55:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:16,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:55:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:16,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003006376] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:55:16,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:55:16,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-08 00:55:16,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108159441] [2025-02-08 00:55:16,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:55:16,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 00:55:16,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:16,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 00:55:16,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:55:16,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-08 00:55:16,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 46 transitions, 435 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-08 00:55:16,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:16,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-08 00:55:16,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:16,640 INFO L124 PetriNetUnfolderBase]: 580/1068 cut-off events. [2025-02-08 00:55:16,641 INFO L125 PetriNetUnfolderBase]: For 8203/8203 co-relation queries the response was YES. [2025-02-08 00:55:16,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4410 conditions, 1068 events. 580/1068 cut-off events. For 8203/8203 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4469 event pairs, 149 based on Foata normal form. 63/1127 useless extension candidates. Maximal degree in co-relation 4377. Up to 504 conditions per place. [2025-02-08 00:55:16,647 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 65 selfloop transitions, 17 changer transitions 67/152 dead transitions. [2025-02-08 00:55:16,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 152 transitions, 1435 flow [2025-02-08 00:55:16,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 00:55:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-08 00:55:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2025-02-08 00:55:16,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2025-02-08 00:55:16,648 INFO L175 Difference]: Start difference. First operand has 68 places, 46 transitions, 435 flow. Second operand 19 states and 231 transitions. [2025-02-08 00:55:16,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 152 transitions, 1435 flow [2025-02-08 00:55:16,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 152 transitions, 1343 flow, removed 30 selfloop flow, removed 7 redundant places. [2025-02-08 00:55:16,661 INFO L231 Difference]: Finished difference. Result has 90 places, 52 transitions, 559 flow [2025-02-08 00:55:16,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=559, PETRI_PLACES=90, PETRI_TRANSITIONS=52} [2025-02-08 00:55:16,662 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 64 predicate places. [2025-02-08 00:55:16,662 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 52 transitions, 559 flow [2025-02-08 00:55:16,662 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-08 00:55:16,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:16,662 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:16,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 00:55:16,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:16,866 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-08 00:55:16,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1752855453, now seen corresponding path program 2 times [2025-02-08 00:55:16,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:16,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437860026] [2025-02-08 00:55:16,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:55:16,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:16,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-02-08 00:55:16,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 00:55:16,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 00:55:16,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:16,967 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-08 00:55:16,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:16,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437860026] [2025-02-08 00:55:16,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437860026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:16,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:16,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:55:16,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818273518] [2025-02-08 00:55:16,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:16,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:55:16,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:16,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:55:16,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:55:16,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-08 00:55:16,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 52 transitions, 559 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-08 00:55:16,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:16,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-08 00:55:16,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:17,256 INFO L124 PetriNetUnfolderBase]: 661/1235 cut-off events. [2025-02-08 00:55:17,257 INFO L125 PetriNetUnfolderBase]: For 21079/21079 co-relation queries the response was YES. [2025-02-08 00:55:17,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6357 conditions, 1235 events. 661/1235 cut-off events. For 21079/21079 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5748 event pairs, 144 based on Foata normal form. 27/1258 useless extension candidates. Maximal degree in co-relation 6313. Up to 501 conditions per place. [2025-02-08 00:55:17,264 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 77 selfloop transitions, 23 changer transitions 31/134 dead transitions. [2025-02-08 00:55:17,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 134 transitions, 1579 flow [2025-02-08 00:55:17,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 00:55:17,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 00:55:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 187 transitions. [2025-02-08 00:55:17,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2025-02-08 00:55:17,265 INFO L175 Difference]: Start difference. First operand has 90 places, 52 transitions, 559 flow. Second operand 15 states and 187 transitions. [2025-02-08 00:55:17,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 134 transitions, 1579 flow [2025-02-08 00:55:17,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 134 transitions, 1247 flow, removed 155 selfloop flow, removed 12 redundant places. [2025-02-08 00:55:17,281 INFO L231 Difference]: Finished difference. Result has 92 places, 58 transitions, 617 flow [2025-02-08 00:55:17,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=617, PETRI_PLACES=92, PETRI_TRANSITIONS=58} [2025-02-08 00:55:17,282 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 66 predicate places. [2025-02-08 00:55:17,282 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 58 transitions, 617 flow [2025-02-08 00:55:17,282 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-08 00:55:17,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:17,282 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:17,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:55:17,282 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-08 00:55:17,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:17,283 INFO L85 PathProgramCache]: Analyzing trace with hash 419544819, now seen corresponding path program 3 times [2025-02-08 00:55:17,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:17,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611404620] [2025-02-08 00:55:17,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 00:55:17,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:17,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-02-08 00:55:17,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 00:55:17,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 00:55:17,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:17,363 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-08 00:55:17,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:17,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611404620] [2025-02-08 00:55:17,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611404620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:17,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:17,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:55:17,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314573877] [2025-02-08 00:55:17,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:17,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:55:17,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:17,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:55:17,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:55:17,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-08 00:55:17,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 58 transitions, 617 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-08 00:55:17,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:17,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-08 00:55:17,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:17,623 INFO L124 PetriNetUnfolderBase]: 598/1127 cut-off events. [2025-02-08 00:55:17,623 INFO L125 PetriNetUnfolderBase]: For 15552/15552 co-relation queries the response was YES. [2025-02-08 00:55:17,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5381 conditions, 1127 events. 598/1127 cut-off events. For 15552/15552 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5166 event pairs, 150 based on Foata normal form. 45/1168 useless extension candidates. Maximal degree in co-relation 5337. Up to 471 conditions per place. [2025-02-08 00:55:17,631 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 65 selfloop transitions, 24 changer transitions 39/131 dead transitions. [2025-02-08 00:55:17,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 131 transitions, 1473 flow [2025-02-08 00:55:17,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 00:55:17,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 00:55:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 173 transitions. [2025-02-08 00:55:17,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5148809523809523 [2025-02-08 00:55:17,632 INFO L175 Difference]: Start difference. First operand has 92 places, 58 transitions, 617 flow. Second operand 14 states and 173 transitions. [2025-02-08 00:55:17,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 131 transitions, 1473 flow [2025-02-08 00:55:17,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 131 transitions, 1293 flow, removed 74 selfloop flow, removed 10 redundant places. [2025-02-08 00:55:17,651 INFO L231 Difference]: Finished difference. Result has 97 places, 59 transitions, 614 flow [2025-02-08 00:55:17,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=614, PETRI_PLACES=97, PETRI_TRANSITIONS=59} [2025-02-08 00:55:17,652 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 71 predicate places. [2025-02-08 00:55:17,652 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 59 transitions, 614 flow [2025-02-08 00:55:17,652 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-08 00:55:17,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:17,652 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:17,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:55:17,653 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-08 00:55:17,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:17,653 INFO L85 PathProgramCache]: Analyzing trace with hash 286114721, now seen corresponding path program 1 times [2025-02-08 00:55:17,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:17,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488748842] [2025-02-08 00:55:17,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:17,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:17,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 00:55:17,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 00:55:17,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:17,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:17,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:17,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488748842] [2025-02-08 00:55:17,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488748842] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:55:17,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752709449] [2025-02-08 00:55:17,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:17,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:17,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:55:17,767 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-08 00:55:17,769 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-08 00:55:17,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 00:55:17,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 00:55:17,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:17,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:17,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 00:55:17,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:55:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:17,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:55:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752709449] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:55:17,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:55:17,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-02-08 00:55:17,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971707233] [2025-02-08 00:55:17,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:55:17,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 00:55:17,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:17,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 00:55:17,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-02-08 00:55:17,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-08 00:55:17,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 59 transitions, 614 flow. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:17,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:17,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-08 00:55:17,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:18,517 INFO L124 PetriNetUnfolderBase]: 841/1575 cut-off events. [2025-02-08 00:55:18,518 INFO L125 PetriNetUnfolderBase]: For 27476/27476 co-relation queries the response was YES. [2025-02-08 00:55:18,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8184 conditions, 1575 events. 841/1575 cut-off events. For 27476/27476 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7782 event pairs, 36 based on Foata normal form. 72/1643 useless extension candidates. Maximal degree in co-relation 8138. Up to 255 conditions per place. [2025-02-08 00:55:18,527 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 79 selfloop transitions, 55 changer transitions 88/225 dead transitions. [2025-02-08 00:55:18,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 225 transitions, 2634 flow [2025-02-08 00:55:18,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 00:55:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-02-08 00:55:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 341 transitions. [2025-02-08 00:55:18,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5074404761904762 [2025-02-08 00:55:18,529 INFO L175 Difference]: Start difference. First operand has 97 places, 59 transitions, 614 flow. Second operand 28 states and 341 transitions. [2025-02-08 00:55:18,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 225 transitions, 2634 flow [2025-02-08 00:55:18,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 225 transitions, 2456 flow, removed 67 selfloop flow, removed 12 redundant places. [2025-02-08 00:55:18,558 INFO L231 Difference]: Finished difference. Result has 127 places, 76 transitions, 1102 flow [2025-02-08 00:55:18,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1102, PETRI_PLACES=127, PETRI_TRANSITIONS=76} [2025-02-08 00:55:18,559 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 101 predicate places. [2025-02-08 00:55:18,559 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 76 transitions, 1102 flow [2025-02-08 00:55:18,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:18,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:18,559 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:18,566 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-08 00:55:18,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:18,760 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-08 00:55:18,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:18,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1629126176, now seen corresponding path program 2 times [2025-02-08 00:55:18,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:18,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819565918] [2025-02-08 00:55:18,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:55:18,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:18,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 00:55:18,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 00:55:18,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:55:18,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:18,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:18,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819565918] [2025-02-08 00:55:18,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819565918] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:55:18,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242720759] [2025-02-08 00:55:18,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:55:18,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:18,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:55:18,900 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-08 00:55:18,902 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-08 00:55:18,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 00:55:18,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 00:55:18,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:55:18,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:18,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 00:55:18,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:55:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:18,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:55:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:19,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242720759] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:55:19,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:55:19,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-02-08 00:55:19,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815899805] [2025-02-08 00:55:19,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:55:19,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 00:55:19,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:19,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 00:55:19,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:55:19,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-08 00:55:19,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 76 transitions, 1102 flow. Second operand has 17 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 17 states have internal predecessors, (120), 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-08 00:55:19,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:19,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-08 00:55:19,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:19,924 INFO L124 PetriNetUnfolderBase]: 1417/2670 cut-off events. [2025-02-08 00:55:19,924 INFO L125 PetriNetUnfolderBase]: For 116610/116610 co-relation queries the response was YES. [2025-02-08 00:55:19,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19112 conditions, 2670 events. 1417/2670 cut-off events. For 116610/116610 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 14779 event pairs, 54 based on Foata normal form. 90/2756 useless extension candidates. Maximal degree in co-relation 19051. Up to 534 conditions per place. [2025-02-08 00:55:19,946 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 120 selfloop transitions, 91 changer transitions 110/324 dead transitions. [2025-02-08 00:55:19,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 324 transitions, 5645 flow [2025-02-08 00:55:19,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-08 00:55:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-02-08 00:55:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 456 transitions. [2025-02-08 00:55:19,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2025-02-08 00:55:19,948 INFO L175 Difference]: Start difference. First operand has 127 places, 76 transitions, 1102 flow. Second operand 37 states and 456 transitions. [2025-02-08 00:55:19,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 324 transitions, 5645 flow [2025-02-08 00:55:20,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 324 transitions, 4418 flow, removed 583 selfloop flow, removed 17 redundant places. [2025-02-08 00:55:20,028 INFO L231 Difference]: Finished difference. Result has 163 places, 116 transitions, 1998 flow [2025-02-08 00:55:20,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1998, PETRI_PLACES=163, PETRI_TRANSITIONS=116} [2025-02-08 00:55:20,029 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 137 predicate places. [2025-02-08 00:55:20,029 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 116 transitions, 1998 flow [2025-02-08 00:55:20,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 17 states have internal predecessors, (120), 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-08 00:55:20,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:20,030 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:20,036 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-08 00:55:20,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:20,234 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-08 00:55:20,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:20,235 INFO L85 PathProgramCache]: Analyzing trace with hash 728336222, now seen corresponding path program 3 times [2025-02-08 00:55:20,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:20,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405477671] [2025-02-08 00:55:20,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 00:55:20,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:20,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-02-08 00:55:20,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 00:55:20,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 00:55:20,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:20,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:20,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:20,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405477671] [2025-02-08 00:55:20,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405477671] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:55:20,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657358553] [2025-02-08 00:55:20,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 00:55:20,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:55:20,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:55:20,358 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-08 00:55:20,359 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-08 00:55:20,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-02-08 00:55:20,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 00:55:20,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 00:55:20,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:20,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 00:55:20,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:55:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:20,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:55:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:20,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657358553] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:55:20,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:55:20,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2025-02-08 00:55:20,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149986370] [2025-02-08 00:55:20,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:55:20,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 00:55:20,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:20,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 00:55:20,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-02-08 00:55:20,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-08 00:55:20,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 116 transitions, 1998 flow. Second operand has 18 states, 18 states have (on average 7.222222222222222) internal successors, (130), 18 states have internal predecessors, (130), 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-08 00:55:20,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:20,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-08 00:55:20,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:21,589 INFO L124 PetriNetUnfolderBase]: 1660/3200 cut-off events. [2025-02-08 00:55:21,589 INFO L125 PetriNetUnfolderBase]: For 244879/244879 co-relation queries the response was YES. [2025-02-08 00:55:21,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25777 conditions, 3200 events. 1660/3200 cut-off events. For 244879/244879 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 17648 event pairs, 44 based on Foata normal form. 108/3304 useless extension candidates. Maximal degree in co-relation 25700. Up to 645 conditions per place. [2025-02-08 00:55:21,612 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 115 selfloop transitions, 118 changer transitions 103/339 dead transitions. [2025-02-08 00:55:21,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 339 transitions, 6969 flow [2025-02-08 00:55:21,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-08 00:55:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-02-08 00:55:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 417 transitions. [2025-02-08 00:55:21,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5110294117647058 [2025-02-08 00:55:21,614 INFO L175 Difference]: Start difference. First operand has 163 places, 116 transitions, 1998 flow. Second operand 34 states and 417 transitions. [2025-02-08 00:55:21,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 339 transitions, 6969 flow [2025-02-08 00:55:21,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 339 transitions, 5145 flow, removed 888 selfloop flow, removed 22 redundant places. [2025-02-08 00:55:21,847 INFO L231 Difference]: Finished difference. Result has 181 places, 143 transitions, 2450 flow [2025-02-08 00:55:21,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2450, PETRI_PLACES=181, PETRI_TRANSITIONS=143} [2025-02-08 00:55:21,848 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 155 predicate places. [2025-02-08 00:55:21,848 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 143 transitions, 2450 flow [2025-02-08 00:55:21,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.222222222222222) internal successors, (130), 18 states have internal predecessors, (130), 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-08 00:55:21,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:21,848 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:21,854 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-08 00:55:22,048 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,SelfDestructingSolverStorable11 [2025-02-08 00:55:22,049 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-08 00:55:22,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:22,050 INFO L85 PathProgramCache]: Analyzing trace with hash 998932156, now seen corresponding path program 4 times [2025-02-08 00:55:22,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:22,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641316923] [2025-02-08 00:55:22,050 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 00:55:22,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:22,055 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-02-08 00:55:22,058 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 42 statements. [2025-02-08 00:55:22,058 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 00:55:22,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 00:55:22,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:22,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641316923] [2025-02-08 00:55:22,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641316923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:22,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:22,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:55:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330403358] [2025-02-08 00:55:22,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:22,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:55:22,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:22,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:55:22,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:55:22,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 00:55:22,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 143 transitions, 2450 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:22,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:22,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 00:55:22,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:23,065 INFO L124 PetriNetUnfolderBase]: 4617/8013 cut-off events. [2025-02-08 00:55:23,066 INFO L125 PetriNetUnfolderBase]: For 361446/361446 co-relation queries the response was YES. [2025-02-08 00:55:23,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47921 conditions, 8013 events. 4617/8013 cut-off events. For 361446/361446 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 51874 event pairs, 160 based on Foata normal form. 0/7289 useless extension candidates. Maximal degree in co-relation 47848. Up to 2055 conditions per place. [2025-02-08 00:55:23,110 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 0 selfloop transitions, 0 changer transitions 546/546 dead transitions. [2025-02-08 00:55:23,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 546 transitions, 9476 flow [2025-02-08 00:55:23,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:55:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 00:55:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2025-02-08 00:55:23,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.671875 [2025-02-08 00:55:23,114 INFO L175 Difference]: Start difference. First operand has 181 places, 143 transitions, 2450 flow. Second operand 8 states and 129 transitions. [2025-02-08 00:55:23,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 546 transitions, 9476 flow [2025-02-08 00:55:23,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 546 transitions, 8000 flow, removed 593 selfloop flow, removed 20 redundant places. [2025-02-08 00:55:23,468 INFO L231 Difference]: Finished difference. Result has 157 places, 0 transitions, 0 flow [2025-02-08 00:55:23,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1691, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=157, PETRI_TRANSITIONS=0} [2025-02-08 00:55:23,468 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 131 predicate places. [2025-02-08 00:55:23,468 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 0 transitions, 0 flow [2025-02-08 00:55:23,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:23,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-02-08 00:55:23,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-02-08 00:55:23,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-02-08 00:55:23,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 00:55:23,471 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1] [2025-02-08 00:55:23,474 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 00:55:23,474 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:55:23,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:55:23 BasicIcfg [2025-02-08 00:55:23,478 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:55:23,478 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:55:23,479 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:55:23,479 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:55:23,479 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:55:13" (3/4) ... [2025-02-08 00:55:23,481 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 00:55:23,483 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-02-08 00:55:23,483 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-02-08 00:55:23,485 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-02-08 00:55:23,485 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-08 00:55:23,485 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 00:55:23,485 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 00:55:23,485 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 00:55:23,533 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 00:55:23,533 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 00:55:23,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:55:23,534 INFO L158 Benchmark]: Toolchain (without parser) took 10965.07ms. Allocated memory was 142.6MB in the beginning and 461.4MB in the end (delta: 318.8MB). Free memory was 104.9MB in the beginning and 200.3MB in the end (delta: -95.4MB). Peak memory consumption was 225.8MB. Max. memory is 16.1GB. [2025-02-08 00:55:23,534 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:55:23,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.98ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 84.5MB in the end (delta: 19.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 00:55:23,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.47ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 83.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:55:23,535 INFO L158 Benchmark]: Boogie Preprocessor took 20.03ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 82.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:55:23,535 INFO L158 Benchmark]: IcfgBuilder took 323.93ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 64.3MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:55:23,535 INFO L158 Benchmark]: TraceAbstraction took 10123.31ms. Allocated memory was 142.6MB in the beginning and 461.4MB in the end (delta: 318.8MB). Free memory was 63.2MB in the beginning and 208.7MB in the end (delta: -145.5MB). Peak memory consumption was 402.0MB. Max. memory is 16.1GB. [2025-02-08 00:55:23,535 INFO L158 Benchmark]: Witness Printer took 55.15ms. Allocated memory is still 461.4MB. Free memory was 208.7MB in the beginning and 200.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:55:23,536 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.26ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.98ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 84.5MB in the end (delta: 19.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.47ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 83.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.03ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 82.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 323.93ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 64.3MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10123.31ms. Allocated memory was 142.6MB in the beginning and 461.4MB in the end (delta: 318.8MB). Free memory was 63.2MB in the beginning and 208.7MB in the end (delta: -145.5MB). Peak memory consumption was 402.0MB. Max. memory is 16.1GB. * Witness Printer took 55.15ms. Allocated memory is still 461.4MB. Free memory was 208.7MB in the beginning and 200.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 722]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 34 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.0s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2023 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2017 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3331 IncrementalHoareTripleChecker+Invalid, 3445 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 3 mSDtfsCounter, 3331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 404 GetRequests, 158 SyntacticMatches, 2 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1733 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2450occurred in iteration=12, InterpolantAutomatonStates: 209, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 339 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 1593 SizeOfPredicates, 22 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 21 InterpolantComputations, 9 PerfectInterpolantSequences, 52/115 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 00:55:23,549 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 Result: TRUE