./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/triangular-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:15:15,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:15:15,731 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:15:15,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:15:15,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:15:15,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:15:15,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:15:15,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:15:15,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:15:15,749 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:15:15,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:15:15,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:15:15,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:15:15,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:15:15,750 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:15:15,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:15:15,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:15:15,750 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:15:15,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:15:15,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:15:15,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:15:15,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:15:15,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:15:15,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:15:15,751 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:15:15,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:15:15,751 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:15:15,751 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:15:15,751 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:15:15,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:15:15,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:15:15,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:15:15,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:15:15,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:15:15,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:15:15,752 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:15:15,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:15:15,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:15:15,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:15:15,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:15:15,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:15:15,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:15:15,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:15:15,752 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 -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2025-02-06 04:15:15,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:15:15,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:15:15,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:15:15,992 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:15:15,992 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:15:15,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-2.i [2025-02-06 04:15:17,177 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc1c9b24d/540c1666fff6406f89f63f938ffb2207/FLAG8888fa205 [2025-02-06 04:15:17,469 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:15:17,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2025-02-06 04:15:17,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc1c9b24d/540c1666fff6406f89f63f938ffb2207/FLAG8888fa205 [2025-02-06 04:15:17,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc1c9b24d/540c1666fff6406f89f63f938ffb2207 [2025-02-06 04:15:17,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:15:17,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:15:17,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:15:17,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:15:17,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:15:17,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:15:17" (1/1) ... [2025-02-06 04:15:17,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f06443e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:17, skipping insertion in model container [2025-02-06 04:15:17,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:15:17" (1/1) ... [2025-02-06 04:15:17,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:15:17,751 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-2.i[30952,30965] [2025-02-06 04:15:17,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:15:17,763 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:15:17,799 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-2.i[30952,30965] [2025-02-06 04:15:17,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:15:17,820 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:15:17,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:17 WrapperNode [2025-02-06 04:15:17,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:15:17,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:15:17,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:15:17,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:15:17,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:17" (1/1) ... [2025-02-06 04:15:17,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:17" (1/1) ... [2025-02-06 04:15:17,845 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-02-06 04:15:17,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:15:17,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:15:17,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:15:17,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:15:17,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:17" (1/1) ... [2025-02-06 04:15:17,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:17" (1/1) ... [2025-02-06 04:15:17,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:17" (1/1) ... [2025-02-06 04:15:17,858 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 04:15:17,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:17" (1/1) ... [2025-02-06 04:15:17,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:17" (1/1) ... [2025-02-06 04:15:17,861 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:17" (1/1) ... [2025-02-06 04:15:17,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:17" (1/1) ... [2025-02-06 04:15:17,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:17" (1/1) ... [2025-02-06 04:15:17,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:17" (1/1) ... [2025-02-06 04:15:17,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:15:17,864 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:15:17,864 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:15:17,864 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:15:17,865 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:17" (1/1) ... [2025-02-06 04:15:17,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:15:17,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:17,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:15:17,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:15:17,908 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 04:15:17,909 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 04:15:17,909 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 04:15:17,909 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 04:15:17,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:15:17,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:15:17,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:15:17,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:15:17,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:15:17,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:15:17,910 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:15:17,997 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:15:17,998 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:15:18,108 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:15:18,108 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:15:18,156 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:15:18,156 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:15:18,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:15:18 BoogieIcfgContainer [2025-02-06 04:15:18,156 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:15:18,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:15:18,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:15:18,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:15:18,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:15:17" (1/3) ... [2025-02-06 04:15:18,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afa3471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:15:18, skipping insertion in model container [2025-02-06 04:15:18,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:15:17" (2/3) ... [2025-02-06 04:15:18,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afa3471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:15:18, skipping insertion in model container [2025-02-06 04:15:18,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:15:18" (3/3) ... [2025-02-06 04:15:18,162 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2025-02-06 04:15:18,171 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:15:18,173 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-2.i that has 3 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-06 04:15:18,173 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:15:18,209 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:15:18,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2025-02-06 04:15:18,276 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-02-06 04:15:18,277 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:15:18,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-02-06 04:15:18,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2025-02-06 04:15:18,288 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2025-02-06 04:15:18,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:15:18,301 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;@237f018f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:15:18,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 04:15:18,308 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:15:18,308 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-02-06 04:15:18,308 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:15:18,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:18,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:18,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:15:18,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:18,313 INFO L85 PathProgramCache]: Analyzing trace with hash 341173782, now seen corresponding path program 1 times [2025-02-06 04:15:18,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:18,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831665380] [2025-02-06 04:15:18,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:18,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:18,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 04:15:18,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 04:15:18,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:18,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:18,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:18,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:18,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831665380] [2025-02-06 04:15:18,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831665380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:18,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:18,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:15:18,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568105682] [2025-02-06 04:15:18,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:18,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:15:18,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:18,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:15:18,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:15:18,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:18,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:18,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:18,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:18,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:18,840 INFO L124 PetriNetUnfolderBase]: 321/540 cut-off events. [2025-02-06 04:15:18,840 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:15:18,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 540 events. 321/540 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2134 event pairs, 62 based on Foata normal form. 12/535 useless extension candidates. Maximal degree in co-relation 1042. Up to 221 conditions per place. [2025-02-06 04:15:18,844 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2025-02-06 04:15:18,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2025-02-06 04:15:18,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:15:18,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:15:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-02-06 04:15:18,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-02-06 04:15:18,853 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 6 states and 84 transitions. [2025-02-06 04:15:18,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 54 transitions, 216 flow [2025-02-06 04:15:18,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:15:18,863 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 71 flow [2025-02-06 04:15:18,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2025-02-06 04:15:18,869 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2025-02-06 04:15:18,869 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 71 flow [2025-02-06 04:15:18,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:18,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:18,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:18,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:15:18,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:15:18,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:18,870 INFO L85 PathProgramCache]: Analyzing trace with hash -26154636, now seen corresponding path program 1 times [2025-02-06 04:15:18,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:18,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150449236] [2025-02-06 04:15:18,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:18,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:18,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 04:15:18,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 04:15:18,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:18,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:19,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:19,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150449236] [2025-02-06 04:15:19,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150449236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:19,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:19,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:15:19,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080262559] [2025-02-06 04:15:19,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:19,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:15:19,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:19,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:15:19,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:15:19,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:19,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:19,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:19,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:19,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:19,246 INFO L124 PetriNetUnfolderBase]: 382/687 cut-off events. [2025-02-06 04:15:19,246 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2025-02-06 04:15:19,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 687 events. 382/687 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2911 event pairs, 65 based on Foata normal form. 27/710 useless extension candidates. Maximal degree in co-relation 1570. Up to 246 conditions per place. [2025-02-06 04:15:19,253 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 9 changer transitions 20/78 dead transitions. [2025-02-06 04:15:19,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 78 transitions, 379 flow [2025-02-06 04:15:19,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:15:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:15:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2025-02-06 04:15:19,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-02-06 04:15:19,256 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 71 flow. Second operand 9 states and 117 transitions. [2025-02-06 04:15:19,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 78 transitions, 379 flow [2025-02-06 04:15:19,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 363 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-02-06 04:15:19,261 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 156 flow [2025-02-06 04:15:19,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2025-02-06 04:15:19,263 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2025-02-06 04:15:19,263 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 156 flow [2025-02-06 04:15:19,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:19,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:19,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:19,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:15:19,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:15:19,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:19,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1984146740, now seen corresponding path program 2 times [2025-02-06 04:15:19,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:19,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435623504] [2025-02-06 04:15:19,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:15:19,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:19,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-02-06 04:15:19,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 04:15:19,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:15:19,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:19,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-06 04:15:19,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:19,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435623504] [2025-02-06 04:15:19,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435623504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:19,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:19,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:15:19,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240864650] [2025-02-06 04:15:19,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:19,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:15:19,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:19,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:15:19,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:15:19,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:19,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:19,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:19,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:19,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:19,503 INFO L124 PetriNetUnfolderBase]: 328/603 cut-off events. [2025-02-06 04:15:19,504 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2025-02-06 04:15:19,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1732 conditions, 603 events. 328/603 cut-off events. For 971/971 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2513 event pairs, 65 based on Foata normal form. 45/644 useless extension candidates. Maximal degree in co-relation 1711. Up to 234 conditions per place. [2025-02-06 04:15:19,506 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 9 changer transitions 28/78 dead transitions. [2025-02-06 04:15:19,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 496 flow [2025-02-06 04:15:19,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:15:19,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:15:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-02-06 04:15:19,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2025-02-06 04:15:19,508 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 156 flow. Second operand 8 states and 103 transitions. [2025-02-06 04:15:19,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 496 flow [2025-02-06 04:15:19,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 488 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-06 04:15:19,511 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 210 flow [2025-02-06 04:15:19,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2025-02-06 04:15:19,512 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-02-06 04:15:19,512 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 210 flow [2025-02-06 04:15:19,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:19,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:19,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:19,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:15:19,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:15:19,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:19,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1835947175, now seen corresponding path program 1 times [2025-02-06 04:15:19,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:19,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329802412] [2025-02-06 04:15:19,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:19,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:19,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 04:15:19,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 04:15:19,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:19,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:19,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:19,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329802412] [2025-02-06 04:15:19,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329802412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:19,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:19,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:15:19,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506386721] [2025-02-06 04:15:19,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:19,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:15:19,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:19,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:15:19,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:15:19,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:19,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:19,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:19,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:19,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:19,837 INFO L124 PetriNetUnfolderBase]: 337/612 cut-off events. [2025-02-06 04:15:19,837 INFO L125 PetriNetUnfolderBase]: For 1649/1649 co-relation queries the response was YES. [2025-02-06 04:15:19,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1937 conditions, 612 events. 337/612 cut-off events. For 1649/1649 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2551 event pairs, 74 based on Foata normal form. 18/626 useless extension candidates. Maximal degree in co-relation 1911. Up to 237 conditions per place. [2025-02-06 04:15:19,840 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 16 changer transitions 24/89 dead transitions. [2025-02-06 04:15:19,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 607 flow [2025-02-06 04:15:19,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:15:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:15:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2025-02-06 04:15:19,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-02-06 04:15:19,841 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 210 flow. Second operand 11 states and 135 transitions. [2025-02-06 04:15:19,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 607 flow [2025-02-06 04:15:19,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 540 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-02-06 04:15:19,846 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 279 flow [2025-02-06 04:15:19,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=279, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2025-02-06 04:15:19,846 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2025-02-06 04:15:19,847 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 279 flow [2025-02-06 04:15:19,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:19,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:19,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:19,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:15:19,847 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:15:19,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:19,847 INFO L85 PathProgramCache]: Analyzing trace with hash 765975211, now seen corresponding path program 2 times [2025-02-06 04:15:19,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:19,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304126862] [2025-02-06 04:15:19,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:15:19,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:19,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-02-06 04:15:19,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 04:15:19,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:15:19,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:19,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:19,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304126862] [2025-02-06 04:15:19,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304126862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:19,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:19,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:15:19,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133219019] [2025-02-06 04:15:19,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:19,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:15:19,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:19,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:15:19,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:15:19,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:19,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 279 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:19,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:19,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:19,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:20,106 INFO L124 PetriNetUnfolderBase]: 445/801 cut-off events. [2025-02-06 04:15:20,106 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2025-02-06 04:15:20,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2627 conditions, 801 events. 445/801 cut-off events. For 2473/2473 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3459 event pairs, 59 based on Foata normal form. 27/823 useless extension candidates. Maximal degree in co-relation 2600. Up to 151 conditions per place. [2025-02-06 04:15:20,109 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 44 selfloop transitions, 23 changer transitions 30/100 dead transitions. [2025-02-06 04:15:20,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 100 transitions, 739 flow [2025-02-06 04:15:20,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:15:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:15:20,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2025-02-06 04:15:20,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-02-06 04:15:20,111 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 279 flow. Second operand 11 states and 138 transitions. [2025-02-06 04:15:20,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 100 transitions, 739 flow [2025-02-06 04:15:20,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 685 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-02-06 04:15:20,116 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 390 flow [2025-02-06 04:15:20,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=390, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2025-02-06 04:15:20,117 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2025-02-06 04:15:20,117 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 390 flow [2025-02-06 04:15:20,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:20,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:20,117 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:20,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:15:20,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:15:20,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:20,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1363386587, now seen corresponding path program 1 times [2025-02-06 04:15:20,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:20,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712452900] [2025-02-06 04:15:20,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:20,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:20,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:15:20,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:15:20,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:20,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:20,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:20,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712452900] [2025-02-06 04:15:20,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712452900] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:15:20,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900655477] [2025-02-06 04:15:20,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:20,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:20,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:20,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:15:20,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:15:20,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:15:20,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:15:20,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:20,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:20,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 04:15:20,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:15:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:20,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:15:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:20,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900655477] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:15:20,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:15:20,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-06 04:15:20,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669306286] [2025-02-06 04:15:20,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:15:20,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:15:20,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:20,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:15:20,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:15:20,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:20,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 390 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:20,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:20,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:20,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:20,861 INFO L124 PetriNetUnfolderBase]: 571/1050 cut-off events. [2025-02-06 04:15:20,861 INFO L125 PetriNetUnfolderBase]: For 6872/6872 co-relation queries the response was YES. [2025-02-06 04:15:20,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4139 conditions, 1050 events. 571/1050 cut-off events. For 6872/6872 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4364 event pairs, 137 based on Foata normal form. 63/1109 useless extension candidates. Maximal degree in co-relation 4107. Up to 486 conditions per place. [2025-02-06 04:15:20,876 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 64 selfloop transitions, 17 changer transitions 67/151 dead transitions. [2025-02-06 04:15:20,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 151 transitions, 1346 flow [2025-02-06 04:15:20,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 04:15:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-06 04:15:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2025-02-06 04:15:20,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2025-02-06 04:15:20,878 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 390 flow. Second operand 19 states and 231 transitions. [2025-02-06 04:15:20,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 151 transitions, 1346 flow [2025-02-06 04:15:20,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 151 transitions, 1267 flow, removed 32 selfloop flow, removed 5 redundant places. [2025-02-06 04:15:20,895 INFO L231 Difference]: Finished difference. Result has 88 places, 51 transitions, 521 flow [2025-02-06 04:15:20,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=521, PETRI_PLACES=88, PETRI_TRANSITIONS=51} [2025-02-06 04:15:20,895 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 62 predicate places. [2025-02-06 04:15:20,895 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 51 transitions, 521 flow [2025-02-06 04:15:20,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:20,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:20,895 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:20,902 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-06 04:15:21,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:21,096 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:15:21,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:21,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1919587149, now seen corresponding path program 2 times [2025-02-06 04:15:21,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:21,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568756394] [2025-02-06 04:15:21,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:15:21,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:21,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:15:21,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:15:21,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:15:21,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:21,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:21,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568756394] [2025-02-06 04:15:21,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568756394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:15:21,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:15:21,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:15:21,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499794235] [2025-02-06 04:15:21,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:15:21,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:15:21,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:21,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:15:21,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:15:21,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:21,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 51 transitions, 521 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:21,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:21,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:21,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:21,556 INFO L124 PetriNetUnfolderBase]: 652/1217 cut-off events. [2025-02-06 04:15:21,557 INFO L125 PetriNetUnfolderBase]: For 19130/19130 co-relation queries the response was YES. [2025-02-06 04:15:21,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6062 conditions, 1217 events. 652/1217 cut-off events. For 19130/19130 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5640 event pairs, 132 based on Foata normal form. 27/1240 useless extension candidates. Maximal degree in co-relation 6019. Up to 483 conditions per place. [2025-02-06 04:15:21,565 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 76 selfloop transitions, 23 changer transitions 31/133 dead transitions. [2025-02-06 04:15:21,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 133 transitions, 1509 flow [2025-02-06 04:15:21,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 04:15:21,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 04:15:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 187 transitions. [2025-02-06 04:15:21,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2025-02-06 04:15:21,567 INFO L175 Difference]: Start difference. First operand has 88 places, 51 transitions, 521 flow. Second operand 15 states and 187 transitions. [2025-02-06 04:15:21,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 133 transitions, 1509 flow [2025-02-06 04:15:21,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 133 transitions, 1211 flow, removed 138 selfloop flow, removed 12 redundant places. [2025-02-06 04:15:21,589 INFO L231 Difference]: Finished difference. Result has 90 places, 57 transitions, 583 flow [2025-02-06 04:15:21,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=583, PETRI_PLACES=90, PETRI_TRANSITIONS=57} [2025-02-06 04:15:21,590 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 64 predicate places. [2025-02-06 04:15:21,590 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 57 transitions, 583 flow [2025-02-06 04:15:21,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:21,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:21,591 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:21,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:15:21,591 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:15:21,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:21,592 INFO L85 PathProgramCache]: Analyzing trace with hash -744688909, now seen corresponding path program 3 times [2025-02-06 04:15:21,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:21,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369354727] [2025-02-06 04:15:21,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:15:21,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:21,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-02-06 04:15:21,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:15:21,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:15:21,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:21,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:21,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369354727] [2025-02-06 04:15:21,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369354727] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:15:21,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128653824] [2025-02-06 04:15:21,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:15:21,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:21,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:21,694 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:15:21,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:15:21,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-02-06 04:15:21,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:15:21,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:15:21,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:21,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 04:15:21,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:15:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:21,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:15:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:21,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128653824] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:15:21,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:15:21,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-06 04:15:21,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835023896] [2025-02-06 04:15:21,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:15:21,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:15:21,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:21,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:15:21,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:15:21,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:21,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 57 transitions, 583 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:21,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:21,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:21,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:22,396 INFO L124 PetriNetUnfolderBase]: 814/1489 cut-off events. [2025-02-06 04:15:22,397 INFO L125 PetriNetUnfolderBase]: For 23715/23715 co-relation queries the response was YES. [2025-02-06 04:15:22,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7554 conditions, 1489 events. 814/1489 cut-off events. For 23715/23715 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6954 event pairs, 72 based on Foata normal form. 81/1566 useless extension candidates. Maximal degree in co-relation 7511. Up to 237 conditions per place. [2025-02-06 04:15:22,407 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 78 selfloop transitions, 45 changer transitions 81/207 dead transitions. [2025-02-06 04:15:22,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 207 transitions, 2402 flow [2025-02-06 04:15:22,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 04:15:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-02-06 04:15:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 308 transitions. [2025-02-06 04:15:22,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2025-02-06 04:15:22,410 INFO L175 Difference]: Start difference. First operand has 90 places, 57 transitions, 583 flow. Second operand 25 states and 308 transitions. [2025-02-06 04:15:22,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 207 transitions, 2402 flow [2025-02-06 04:15:22,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 207 transitions, 2182 flow, removed 94 selfloop flow, removed 10 redundant places. [2025-02-06 04:15:22,443 INFO L231 Difference]: Finished difference. Result has 117 places, 69 transitions, 910 flow [2025-02-06 04:15:22,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=910, PETRI_PLACES=117, PETRI_TRANSITIONS=69} [2025-02-06 04:15:22,445 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 91 predicate places. [2025-02-06 04:15:22,446 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 69 transitions, 910 flow [2025-02-06 04:15:22,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:22,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:22,446 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:22,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:15:22,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:22,647 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:15:22,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:22,647 INFO L85 PathProgramCache]: Analyzing trace with hash 183631300, now seen corresponding path program 1 times [2025-02-06 04:15:22,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:22,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897805888] [2025-02-06 04:15:22,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:22,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:22,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:15:22,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:15:22,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:22,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:22,807 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-06 04:15:22,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:22,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897805888] [2025-02-06 04:15:22,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897805888] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:15:22,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731044689] [2025-02-06 04:15:22,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:15:22,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:22,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:22,810 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:15:22,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:15:22,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:15:22,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:15:22,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:22,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:22,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 04:15:22,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:15:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:22,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:15:23,111 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-06 04:15:23,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731044689] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:15:23,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:15:23,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-02-06 04:15:23,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213523823] [2025-02-06 04:15:23,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:15:23,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 04:15:23,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:23,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 04:15:23,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-02-06 04:15:23,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:23,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 69 transitions, 910 flow. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:23,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:23,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:23,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:24,052 INFO L124 PetriNetUnfolderBase]: 1129/2119 cut-off events. [2025-02-06 04:15:24,052 INFO L125 PetriNetUnfolderBase]: For 69281/69281 co-relation queries the response was YES. [2025-02-06 04:15:24,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13163 conditions, 2119 events. 1129/2119 cut-off events. For 69281/69281 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 11353 event pairs, 70 based on Foata normal form. 72/2187 useless extension candidates. Maximal degree in co-relation 13107. Up to 400 conditions per place. [2025-02-06 04:15:24,066 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 90 selfloop transitions, 66 changer transitions 88/247 dead transitions. [2025-02-06 04:15:24,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 247 transitions, 3782 flow [2025-02-06 04:15:24,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 04:15:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-02-06 04:15:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 341 transitions. [2025-02-06 04:15:24,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5074404761904762 [2025-02-06 04:15:24,071 INFO L175 Difference]: Start difference. First operand has 117 places, 69 transitions, 910 flow. Second operand 28 states and 341 transitions. [2025-02-06 04:15:24,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 247 transitions, 3782 flow [2025-02-06 04:15:24,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 247 transitions, 3161 flow, removed 288 selfloop flow, removed 17 redundant places. [2025-02-06 04:15:24,130 INFO L231 Difference]: Finished difference. Result has 138 places, 97 transitions, 1499 flow [2025-02-06 04:15:24,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1499, PETRI_PLACES=138, PETRI_TRANSITIONS=97} [2025-02-06 04:15:24,132 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 112 predicate places. [2025-02-06 04:15:24,132 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 97 transitions, 1499 flow [2025-02-06 04:15:24,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:24,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:24,132 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:24,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:15:24,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:24,333 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:15:24,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:24,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1643456023, now seen corresponding path program 2 times [2025-02-06 04:15:24,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:24,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804999117] [2025-02-06 04:15:24,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:15:24,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:24,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:15:24,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:15:24,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:15:24,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:24,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:24,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804999117] [2025-02-06 04:15:24,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804999117] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:15:24,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807010123] [2025-02-06 04:15:24,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:15:24,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:24,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:24,491 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:15:24,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:15:24,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:15:24,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:15:24,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:15:24,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:24,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 04:15:24,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:15:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:24,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:15:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:24,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807010123] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:15:24,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:15:24,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2025-02-06 04:15:24,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745351598] [2025-02-06 04:15:24,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:15:24,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 04:15:24,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:24,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 04:15:24,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-02-06 04:15:24,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:24,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 97 transitions, 1499 flow. Second operand has 19 states, 19 states have (on average 7.105263157894737) internal successors, (135), 19 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:24,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:24,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:24,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:25,363 INFO L124 PetriNetUnfolderBase]: 1372/2603 cut-off events. [2025-02-06 04:15:25,364 INFO L125 PetriNetUnfolderBase]: For 133366/133366 co-relation queries the response was YES. [2025-02-06 04:15:25,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18222 conditions, 2603 events. 1372/2603 cut-off events. For 133366/133366 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 14085 event pairs, 38 based on Foata normal form. 54/2653 useless extension candidates. Maximal degree in co-relation 18156. Up to 513 conditions per place. [2025-02-06 04:15:25,383 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 93 selfloop transitions, 96 changer transitions 79/271 dead transitions. [2025-02-06 04:15:25,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 271 transitions, 4770 flow [2025-02-06 04:15:25,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 04:15:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-02-06 04:15:25,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 343 transitions. [2025-02-06 04:15:25,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2025-02-06 04:15:25,385 INFO L175 Difference]: Start difference. First operand has 138 places, 97 transitions, 1499 flow. Second operand 28 states and 343 transitions. [2025-02-06 04:15:25,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 271 transitions, 4770 flow [2025-02-06 04:15:25,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 271 transitions, 3665 flow, removed 528 selfloop flow, removed 15 redundant places. [2025-02-06 04:15:25,516 INFO L231 Difference]: Finished difference. Result has 156 places, 121 transitions, 1893 flow [2025-02-06 04:15:25,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1893, PETRI_PLACES=156, PETRI_TRANSITIONS=121} [2025-02-06 04:15:25,517 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 130 predicate places. [2025-02-06 04:15:25,517 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 121 transitions, 1893 flow [2025-02-06 04:15:25,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.105263157894737) internal successors, (135), 19 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:25,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:25,517 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:25,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 04:15:25,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 04:15:25,721 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:15:25,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1211190238, now seen corresponding path program 3 times [2025-02-06 04:15:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:25,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507725474] [2025-02-06 04:15:25,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:15:25,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:25,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 5 equivalence classes. [2025-02-06 04:15:25,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:15:25,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-06 04:15:25,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:25,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:15:25,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507725474] [2025-02-06 04:15:25,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507725474] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:15:25,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050239975] [2025-02-06 04:15:25,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:15:25,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:15:25,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:15:25,848 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:15:25,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 04:15:25,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 5 equivalence classes. [2025-02-06 04:15:25,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:15:25,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-06 04:15:25,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:15:25,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 04:15:25,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:15:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:25,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:15:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:15:26,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050239975] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:15:26,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:15:26,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2025-02-06 04:15:26,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911620608] [2025-02-06 04:15:26,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:15:26,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 04:15:26,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:15:26,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 04:15:26,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-02-06 04:15:26,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-02-06 04:15:26,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 121 transitions, 1893 flow. Second operand has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:26,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:15:26,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-02-06 04:15:26,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:15:26,958 INFO L124 PetriNetUnfolderBase]: 1696/3169 cut-off events. [2025-02-06 04:15:26,958 INFO L125 PetriNetUnfolderBase]: For 156825/156825 co-relation queries the response was YES. [2025-02-06 04:15:26,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22103 conditions, 3169 events. 1696/3169 cut-off events. For 156825/156825 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 17187 event pairs, 50 based on Foata normal form. 54/3219 useless extension candidates. Maximal degree in co-relation 22030. Up to 621 conditions per place. [2025-02-06 04:15:26,983 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 117 selfloop transitions, 120 changer transitions 91/331 dead transitions. [2025-02-06 04:15:26,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 331 transitions, 5780 flow [2025-02-06 04:15:26,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-06 04:15:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-02-06 04:15:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 417 transitions. [2025-02-06 04:15:26,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5110294117647058 [2025-02-06 04:15:26,987 INFO L175 Difference]: Start difference. First operand has 156 places, 121 transitions, 1893 flow. Second operand 34 states and 417 transitions. [2025-02-06 04:15:26,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 331 transitions, 5780 flow [2025-02-06 04:15:27,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 331 transitions, 4884 flow, removed 413 selfloop flow, removed 19 redundant places. [2025-02-06 04:15:27,152 INFO L231 Difference]: Finished difference. Result has 180 places, 145 transitions, 2474 flow [2025-02-06 04:15:27,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2474, PETRI_PLACES=180, PETRI_TRANSITIONS=145} [2025-02-06 04:15:27,153 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 154 predicate places. [2025-02-06 04:15:27,153 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 145 transitions, 2474 flow [2025-02-06 04:15:27,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:15:27,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:15:27,153 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:15:27,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 04:15:27,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 04:15:27,354 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:15:27,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:15:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1587385759, now seen corresponding path program 4 times [2025-02-06 04:15:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:15:27,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794921166] [2025-02-06 04:15:27,354 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:15:27,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:15:27,358 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-02-06 04:15:27,364 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:15:27,364 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:15:27,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:15:27,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:15:27,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 04:15:27,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:15:27,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:15:27,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:15:27,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:15:27,392 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:15:27,392 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-02-06 04:15:27,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-02-06 04:15:27,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-02-06 04:15:27,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:15:27,394 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1] [2025-02-06 04:15:27,446 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:15:27,448 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:15:27,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:15:27 BasicIcfg [2025-02-06 04:15:27,452 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:15:27,452 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:15:27,452 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:15:27,452 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:15:27,455 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:15:18" (3/4) ... [2025-02-06 04:15:27,455 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 04:15:27,508 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-02-06 04:15:27,562 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:15:27,562 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:15:27,562 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:15:27,563 INFO L158 Benchmark]: Toolchain (without parser) took 10072.89ms. Allocated memory was 201.3MB in the beginning and 427.8MB in the end (delta: 226.5MB). Free memory was 152.7MB in the beginning and 153.8MB in the end (delta: -1.1MB). Peak memory consumption was 222.2MB. Max. memory is 16.1GB. [2025-02-06 04:15:27,563 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:15:27,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.99ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 133.4MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:15:27,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.55ms. Allocated memory is still 201.3MB. Free memory was 133.4MB in the beginning and 131.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:15:27,564 INFO L158 Benchmark]: Boogie Preprocessor took 18.23ms. Allocated memory is still 201.3MB. Free memory was 131.6MB in the beginning and 130.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:15:27,564 INFO L158 Benchmark]: IcfgBuilder took 292.45ms. Allocated memory is still 201.3MB. Free memory was 130.5MB in the beginning and 112.7MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:15:27,564 INFO L158 Benchmark]: TraceAbstraction took 9293.97ms. Allocated memory was 201.3MB in the beginning and 427.8MB in the end (delta: 226.5MB). Free memory was 111.6MB in the beginning and 165.7MB in the end (delta: -54.2MB). Peak memory consumption was 171.9MB. Max. memory is 16.1GB. [2025-02-06 04:15:27,565 INFO L158 Benchmark]: Witness Printer took 110.19ms. Allocated memory is still 427.8MB. Free memory was 165.7MB in the beginning and 153.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:15:27,566 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.13ms. Allocated memory is still 226.5MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.99ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 133.4MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.55ms. Allocated memory is still 201.3MB. Free memory was 133.4MB in the beginning and 131.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.23ms. Allocated memory is still 201.3MB. Free memory was 131.6MB in the beginning and 130.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 292.45ms. Allocated memory is still 201.3MB. Free memory was 130.5MB in the beginning and 112.7MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9293.97ms. Allocated memory was 201.3MB in the beginning and 427.8MB in the end (delta: 226.5MB). Free memory was 111.6MB in the beginning and 165.7MB in the end (delta: -54.2MB). Peak memory consumption was 171.9MB. Max. memory is 16.1GB. * Witness Printer took 110.19ms. Allocated memory is still 427.8MB. Free memory was 165.7MB in the beginning and 153.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, argc=49, i=3, id1=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, argc=49, i=3, id1=-1, id2=0, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L716] 0 int condI = i >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, i=7, id1=-1, id2=0, j=8, k=1, k=1] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L719] 0 int condJ = j >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 34 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.2s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1880 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1870 mSDsluCounter, 117 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3062 IncrementalHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 10 mSDtfsCounter, 3062 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 200 SyntacticMatches, 4 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2474occurred in iteration=11, InterpolantAutomatonStates: 194, 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.2s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 1615 SizeOfPredicates, 29 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 1/132 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-06 04:15:27,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE