./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-context1.wvr.c --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/weaver/test-context1.wvr.c -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 d63a80d2bfe8ff8bb62e6b5083cee589f2cb0f37dc67867654ab7601d82af23e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:44:05,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:44:05,348 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:44:05,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:44:05,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:44:05,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:44:05,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:44:05,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:44:05,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:44:05,378 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:44:05,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:44:05,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:44:05,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:44:05,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:44:05,379 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:44:05,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:44:05,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:44:05,379 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:44:05,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:44:05,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:44:05,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:44:05,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:44:05,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:44:05,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:44:05,380 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:44:05,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:44:05,380 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:44:05,380 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:44:05,380 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:44:05,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:44:05,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:44:05,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:44:05,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:44:05,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:44:05,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:44:05,381 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:44:05,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:44:05,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:44:05,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:44:05,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:44:05,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:44:05,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:44:05,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:44:05,382 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 -> d63a80d2bfe8ff8bb62e6b5083cee589f2cb0f37dc67867654ab7601d82af23e [2025-02-06 04:44:05,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:44:05,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:44:05,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:44:05,609 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:44:05,609 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:44:05,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-context1.wvr.c [2025-02-06 04:44:06,784 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa05dad09/78721ec2cedc49048c791b90e24425ac/FLAG3daf9131e [2025-02-06 04:44:07,002 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:44:07,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/test-context1.wvr.c [2025-02-06 04:44:07,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa05dad09/78721ec2cedc49048c791b90e24425ac/FLAG3daf9131e [2025-02-06 04:44:07,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa05dad09/78721ec2cedc49048c791b90e24425ac [2025-02-06 04:44:07,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:44:07,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:44:07,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:44:07,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:44:07,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:44:07,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:44:07" (1/1) ... [2025-02-06 04:44:07,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4918102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:07, skipping insertion in model container [2025-02-06 04:44:07,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:44:07" (1/1) ... [2025-02-06 04:44:07,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:44:07,493 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/weaver/test-context1.wvr.c[2459,2472] [2025-02-06 04:44:07,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:44:07,507 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:44:07,519 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/weaver/test-context1.wvr.c[2459,2472] [2025-02-06 04:44:07,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:44:07,539 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:44:07,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:07 WrapperNode [2025-02-06 04:44:07,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:44:07,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:44:07,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:44:07,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:44:07,544 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:44:07" (1/1) ... [2025-02-06 04:44:07,549 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:44:07" (1/1) ... [2025-02-06 04:44:07,561 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 122 [2025-02-06 04:44:07,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:44:07,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:44:07,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:44:07,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:44:07,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:07" (1/1) ... [2025-02-06 04:44:07,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:07" (1/1) ... [2025-02-06 04:44:07,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:07" (1/1) ... [2025-02-06 04:44:07,580 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-06 04:44:07,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:07" (1/1) ... [2025-02-06 04:44:07,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:07" (1/1) ... [2025-02-06 04:44:07,584 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:07" (1/1) ... [2025-02-06 04:44:07,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:07" (1/1) ... [2025-02-06 04:44:07,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:07" (1/1) ... [2025-02-06 04:44:07,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:07" (1/1) ... [2025-02-06 04:44:07,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:44:07,587 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:44:07,588 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:44:07,588 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:44:07,588 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:07" (1/1) ... [2025-02-06 04:44:07,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:44:07,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:44:07,610 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:44:07,612 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:44:07,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:44:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:44:07,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:44:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:44:07,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:44:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:44:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:44:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:44:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:44:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:44:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:44:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:44:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:44:07,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:44:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:44:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:44:07,629 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:44:07,694 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:44:07,695 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:44:07,865 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:44:07,865 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:44:08,010 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:44:08,010 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:44:08,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:44:08 BoogieIcfgContainer [2025-02-06 04:44:08,011 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:44:08,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:44:08,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:44:08,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:44:08,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:44:07" (1/3) ... [2025-02-06 04:44:08,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a42cd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:44:08, skipping insertion in model container [2025-02-06 04:44:08,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:44:07" (2/3) ... [2025-02-06 04:44:08,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a42cd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:44:08, skipping insertion in model container [2025-02-06 04:44:08,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:44:08" (3/3) ... [2025-02-06 04:44:08,019 INFO L128 eAbstractionObserver]: Analyzing ICFG test-context1.wvr.c [2025-02-06 04:44:08,032 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:44:08,036 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-context1.wvr.c that has 3 procedures, 24 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-06 04:44:08,036 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:44:08,070 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:44:08,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 70 flow [2025-02-06 04:44:08,117 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2025-02-06 04:44:08,119 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:44:08,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 5/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-02-06 04:44:08,121 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 28 transitions, 70 flow [2025-02-06 04:44:08,123 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 25 transitions, 62 flow [2025-02-06 04:44:08,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:44:08,141 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;@74943168, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:44:08,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 04:44:08,148 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:44:08,148 INFO L124 PetriNetUnfolderBase]: 5/24 cut-off events. [2025-02-06 04:44:08,148 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:44:08,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:08,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:08,149 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:44:08,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1452471426, now seen corresponding path program 1 times [2025-02-06 04:44:08,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:08,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258859213] [2025-02-06 04:44:08,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:44:08,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:08,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 04:44:08,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 04:44:08,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:44:08,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:08,291 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:44:08,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:08,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258859213] [2025-02-06 04:44:08,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258859213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:44:08,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:44:08,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:44:08,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098918570] [2025-02-06 04:44:08,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:44:08,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:44:08,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:08,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:44:08,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:44:08,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:44:08,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 62 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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:44:08,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:08,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:44:08,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:08,429 INFO L124 PetriNetUnfolderBase]: 122/217 cut-off events. [2025-02-06 04:44:08,430 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 04:44:08,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 217 events. 122/217 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 711 event pairs, 94 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 405. Up to 214 conditions per place. [2025-02-06 04:44:08,434 INFO L140 encePairwiseOnDemand]: 26/28 looper letters, 20 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2025-02-06 04:44:08,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 98 flow [2025-02-06 04:44:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:44:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 04:44:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2025-02-06 04:44:08,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-02-06 04:44:08,447 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 62 flow. Second operand 2 states and 32 transitions. [2025-02-06 04:44:08,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 98 flow [2025-02-06 04:44:08,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 90 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:44:08,452 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 50 flow [2025-02-06 04:44:08,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=50, PETRI_PLACES=24, PETRI_TRANSITIONS=23} [2025-02-06 04:44:08,455 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2025-02-06 04:44:08,456 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 50 flow [2025-02-06 04:44:08,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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:44:08,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:08,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:08,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:44:08,457 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:44:08,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:08,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2006393121, now seen corresponding path program 1 times [2025-02-06 04:44:08,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:08,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499199969] [2025-02-06 04:44:08,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:44:08,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:08,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:44:08,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:44:08,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:44:08,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:08,542 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:44:08,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:08,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499199969] [2025-02-06 04:44:08,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499199969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:44:08,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:44:08,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:44:08,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139715385] [2025-02-06 04:44:08,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:44:08,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:44:08,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:08,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:44:08,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:44:08,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:44:08,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:44:08,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:08,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:44:08,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:08,640 INFO L124 PetriNetUnfolderBase]: 203/353 cut-off events. [2025-02-06 04:44:08,640 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 04:44:08,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 353 events. 203/353 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1272 event pairs, 82 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 709. Up to 176 conditions per place. [2025-02-06 04:44:08,644 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 28 selfloop transitions, 2 changer transitions 3/36 dead transitions. [2025-02-06 04:44:08,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 36 transitions, 144 flow [2025-02-06 04:44:08,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:44:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:44:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-02-06 04:44:08,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-02-06 04:44:08,647 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 50 flow. Second operand 3 states and 49 transitions. [2025-02-06 04:44:08,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 36 transitions, 144 flow [2025-02-06 04:44:08,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:44:08,648 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 62 flow [2025-02-06 04:44:08,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2025-02-06 04:44:08,651 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2025-02-06 04:44:08,651 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 62 flow [2025-02-06 04:44:08,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:44:08,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:08,651 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:08,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:44:08,652 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:44:08,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:08,652 INFO L85 PathProgramCache]: Analyzing trace with hash -351831662, now seen corresponding path program 1 times [2025-02-06 04:44:08,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:08,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276608788] [2025-02-06 04:44:08,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:44:08,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:08,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:44:08,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:44:08,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:44:08,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:08,785 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:44:08,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:08,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276608788] [2025-02-06 04:44:08,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276608788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:44:08,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:44:08,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:44:08,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356753298] [2025-02-06 04:44:08,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:44:08,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:44:08,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:08,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:44:08,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:44:08,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:44:08,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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:44:08,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:08,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:44:08,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:08,886 INFO L124 PetriNetUnfolderBase]: 251/446 cut-off events. [2025-02-06 04:44:08,886 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-02-06 04:44:08,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 446 events. 251/446 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1678 event pairs, 113 based on Foata normal form. 11/387 useless extension candidates. Maximal degree in co-relation 934. Up to 306 conditions per place. [2025-02-06 04:44:08,888 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 27 selfloop transitions, 2 changer transitions 6/38 dead transitions. [2025-02-06 04:44:08,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 38 transitions, 163 flow [2025-02-06 04:44:08,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:44:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:44:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-02-06 04:44:08,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-02-06 04:44:08,889 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 62 flow. Second operand 3 states and 50 transitions. [2025-02-06 04:44:08,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 38 transitions, 163 flow [2025-02-06 04:44:08,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:44:08,890 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 72 flow [2025-02-06 04:44:08,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2025-02-06 04:44:08,891 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2025-02-06 04:44:08,891 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 72 flow [2025-02-06 04:44:08,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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:44:08,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:08,892 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:08,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:44:08,892 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:44:08,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:08,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1184158308, now seen corresponding path program 1 times [2025-02-06 04:44:08,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:08,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628459070] [2025-02-06 04:44:08,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:44:08,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:08,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:44:08,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:44:08,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:44:08,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:09,119 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:44:09,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:09,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628459070] [2025-02-06 04:44:09,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628459070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:44:09,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:44:09,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:44:09,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238895683] [2025-02-06 04:44:09,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:44:09,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:44:09,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:09,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:44:09,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:44:09,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:44:09,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:44:09,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:09,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:44:09,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:09,243 INFO L124 PetriNetUnfolderBase]: 319/585 cut-off events. [2025-02-06 04:44:09,243 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-02-06 04:44:09,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 585 events. 319/585 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2405 event pairs, 285 based on Foata normal form. 12/503 useless extension candidates. Maximal degree in co-relation 1262. Up to 443 conditions per place. [2025-02-06 04:44:09,248 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 21 selfloop transitions, 2 changer transitions 15/41 dead transitions. [2025-02-06 04:44:09,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 184 flow [2025-02-06 04:44:09,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:44:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:44:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-02-06 04:44:09,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2025-02-06 04:44:09,250 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 72 flow. Second operand 4 states and 57 transitions. [2025-02-06 04:44:09,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 184 flow [2025-02-06 04:44:09,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:44:09,251 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 84 flow [2025-02-06 04:44:09,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2025-02-06 04:44:09,252 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2025-02-06 04:44:09,252 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 84 flow [2025-02-06 04:44:09,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:44:09,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:09,252 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:09,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:44:09,252 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:44:09,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:09,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1137062934, now seen corresponding path program 1 times [2025-02-06 04:44:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:09,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094313877] [2025-02-06 04:44:09,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:44:09,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:09,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:44:09,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:44:09,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:44:09,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:44:09,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:09,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094313877] [2025-02-06 04:44:09,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094313877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:44:09,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:44:09,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:44:09,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775888369] [2025-02-06 04:44:09,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:44:09,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:44:09,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:09,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:44:09,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:44:09,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:44:09,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:44:09,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:09,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:44:09,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:09,746 INFO L124 PetriNetUnfolderBase]: 331/583 cut-off events. [2025-02-06 04:44:09,746 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-02-06 04:44:09,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1289 conditions, 583 events. 331/583 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2176 event pairs, 68 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 1281. Up to 157 conditions per place. [2025-02-06 04:44:09,748 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 44 selfloop transitions, 5 changer transitions 12/64 dead transitions. [2025-02-06 04:44:09,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 64 transitions, 295 flow [2025-02-06 04:44:09,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:44:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:44:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2025-02-06 04:44:09,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-02-06 04:44:09,749 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 84 flow. Second operand 6 states and 91 transitions. [2025-02-06 04:44:09,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 64 transitions, 295 flow [2025-02-06 04:44:09,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 64 transitions, 289 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 04:44:09,751 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 98 flow [2025-02-06 04:44:09,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2025-02-06 04:44:09,752 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2025-02-06 04:44:09,752 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 98 flow [2025-02-06 04:44:09,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:44:09,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:09,752 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:09,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:44:09,752 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:44:09,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash -72371257, now seen corresponding path program 2 times [2025-02-06 04:44:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:09,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759066780] [2025-02-06 04:44:09,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:44:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:09,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-06 04:44:09,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:44:09,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:44:09,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:44:09,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:09,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759066780] [2025-02-06 04:44:09,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759066780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:44:09,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:44:09,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:44:09,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539527706] [2025-02-06 04:44:09,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:44:09,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:44:09,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:09,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:44:09,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:44:09,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:44:09,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:44:09,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:09,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:44:09,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:09,974 INFO L124 PetriNetUnfolderBase]: 719/1265 cut-off events. [2025-02-06 04:44:09,974 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-02-06 04:44:09,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1265 events. 719/1265 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5603 event pairs, 280 based on Foata normal form. 22/1090 useless extension candidates. Maximal degree in co-relation 2837. Up to 462 conditions per place. [2025-02-06 04:44:09,979 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 50 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-02-06 04:44:09,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 312 flow [2025-02-06 04:44:09,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:44:09,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:44:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-02-06 04:44:09,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-02-06 04:44:09,980 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 98 flow. Second operand 4 states and 72 transitions. [2025-02-06 04:44:09,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 312 flow [2025-02-06 04:44:09,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 60 transitions, 298 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 04:44:09,983 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 152 flow [2025-02-06 04:44:09,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-02-06 04:44:09,984 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2025-02-06 04:44:09,984 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 152 flow [2025-02-06 04:44:09,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:44:09,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:09,984 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:09,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:44:09,984 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:44:09,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:09,985 INFO L85 PathProgramCache]: Analyzing trace with hash -570701833, now seen corresponding path program 3 times [2025-02-06 04:44:09,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:09,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943974236] [2025-02-06 04:44:09,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:44:09,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:09,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-02-06 04:44:10,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:44:10,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:44:10,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:10,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:10,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943974236] [2025-02-06 04:44:10,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943974236] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:44:10,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024585466] [2025-02-06 04:44:10,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:44:10,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:10,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:44:10,154 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:44:10,156 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:44:10,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-02-06 04:44:10,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:44:10,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:44:10,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:10,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 04:44:10,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:44:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:10,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:44:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:10,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024585466] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:44:10,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:44:10,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-06 04:44:10,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080810748] [2025-02-06 04:44:10,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:44:10,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 04:44:10,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:10,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 04:44:10,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-02-06 04:44:10,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:44:10,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 152 flow. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 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:44:10,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:10,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:44:10,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:10,953 INFO L124 PetriNetUnfolderBase]: 1255/2228 cut-off events. [2025-02-06 04:44:10,953 INFO L125 PetriNetUnfolderBase]: For 1347/1347 co-relation queries the response was YES. [2025-02-06 04:44:10,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5331 conditions, 2228 events. 1255/2228 cut-off events. For 1347/1347 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 11610 event pairs, 404 based on Foata normal form. 33/1909 useless extension candidates. Maximal degree in co-relation 5321. Up to 1122 conditions per place. [2025-02-06 04:44:10,965 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 33 selfloop transitions, 4 changer transitions 65/105 dead transitions. [2025-02-06 04:44:10,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 105 transitions, 574 flow [2025-02-06 04:44:10,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:44:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:44:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2025-02-06 04:44:10,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-02-06 04:44:10,968 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 152 flow. Second operand 9 states and 138 transitions. [2025-02-06 04:44:10,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 105 transitions, 574 flow [2025-02-06 04:44:10,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 105 transitions, 564 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-02-06 04:44:10,976 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 180 flow [2025-02-06 04:44:10,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2025-02-06 04:44:10,977 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 22 predicate places. [2025-02-06 04:44:10,978 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 180 flow [2025-02-06 04:44:10,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 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:44:10,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:10,978 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:10,985 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:44:11,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:11,180 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:44:11,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:11,181 INFO L85 PathProgramCache]: Analyzing trace with hash 817461091, now seen corresponding path program 4 times [2025-02-06 04:44:11,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:11,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649848699] [2025-02-06 04:44:11,181 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:44:11,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:11,196 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-06 04:44:11,210 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:44:11,210 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:44:11,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:44:11,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:11,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649848699] [2025-02-06 04:44:11,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649848699] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:44:11,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733831979] [2025-02-06 04:44:11,437 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:44:11,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:11,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:44:11,439 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:44:11,441 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:44:11,483 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-06 04:44:11,502 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:44:11,502 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:44:11,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:11,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 04:44:11,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:44:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:44:11,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:44:11,760 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 04:44:11,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2025-02-06 04:44:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:44:11,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733831979] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:44:11,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:44:11,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 16 [2025-02-06 04:44:11,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4953838] [2025-02-06 04:44:11,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:44:11,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 04:44:11,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:11,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 04:44:11,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:44:11,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:44:11,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 180 flow. Second operand has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 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:44:11,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:11,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:44:11,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:12,642 INFO L124 PetriNetUnfolderBase]: 1998/3447 cut-off events. [2025-02-06 04:44:12,642 INFO L125 PetriNetUnfolderBase]: For 3501/3501 co-relation queries the response was YES. [2025-02-06 04:44:12,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8738 conditions, 3447 events. 1998/3447 cut-off events. For 3501/3501 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 18228 event pairs, 104 based on Foata normal form. 24/2935 useless extension candidates. Maximal degree in co-relation 8723. Up to 625 conditions per place. [2025-02-06 04:44:12,656 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 139 selfloop transitions, 37 changer transitions 90/269 dead transitions. [2025-02-06 04:44:12,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 269 transitions, 1452 flow [2025-02-06 04:44:12,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 04:44:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 04:44:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 381 transitions. [2025-02-06 04:44:12,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6185064935064936 [2025-02-06 04:44:12,659 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 180 flow. Second operand 22 states and 381 transitions. [2025-02-06 04:44:12,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 269 transitions, 1452 flow [2025-02-06 04:44:12,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 269 transitions, 1422 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-02-06 04:44:12,667 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 604 flow [2025-02-06 04:44:12,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=604, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2025-02-06 04:44:12,668 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 45 predicate places. [2025-02-06 04:44:12,668 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 604 flow [2025-02-06 04:44:12,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 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:44:12,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:12,668 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:12,675 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:44:12,869 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:44:12,869 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:44:12,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:12,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1021840888, now seen corresponding path program 5 times [2025-02-06 04:44:12,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:12,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998596871] [2025-02-06 04:44:12,870 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:44:12,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:12,879 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-02-06 04:44:12,891 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 04:44:12,891 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 04:44:12,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 04:44:12,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:12,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998596871] [2025-02-06 04:44:12,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998596871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:44:12,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956610756] [2025-02-06 04:44:12,998 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:44:12,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:12,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:44:13,000 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:44:13,002 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:44:13,039 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-02-06 04:44:13,062 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 04:44:13,062 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 04:44:13,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:13,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 04:44:13,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:44:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 04:44:13,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:44:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 04:44:13,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956610756] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:44:13,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:44:13,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-02-06 04:44:13,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592896395] [2025-02-06 04:44:13,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:44:13,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 04:44:13,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:13,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 04:44:13,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-02-06 04:44:13,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:44:13,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 604 flow. Second operand has 20 states, 20 states have (on average 8.25) internal successors, (165), 20 states have internal predecessors, (165), 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:44:13,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:13,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:44:13,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:13,867 INFO L124 PetriNetUnfolderBase]: 2573/4505 cut-off events. [2025-02-06 04:44:13,867 INFO L125 PetriNetUnfolderBase]: For 7404/7404 co-relation queries the response was YES. [2025-02-06 04:44:13,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11890 conditions, 4505 events. 2573/4505 cut-off events. For 7404/7404 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 26609 event pairs, 1832 based on Foata normal form. 52/3848 useless extension candidates. Maximal degree in co-relation 11866. Up to 3442 conditions per place. [2025-02-06 04:44:13,886 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 59 selfloop transitions, 4 changer transitions 81/147 dead transitions. [2025-02-06 04:44:13,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 147 transitions, 1149 flow [2025-02-06 04:44:13,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:44:13,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:44:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2025-02-06 04:44:13,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-02-06 04:44:13,888 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 604 flow. Second operand 11 states and 161 transitions. [2025-02-06 04:44:13,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 147 transitions, 1149 flow [2025-02-06 04:44:13,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 147 transitions, 895 flow, removed 114 selfloop flow, removed 6 redundant places. [2025-02-06 04:44:13,908 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 416 flow [2025-02-06 04:44:13,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=416, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2025-02-06 04:44:13,910 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 56 predicate places. [2025-02-06 04:44:13,910 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 416 flow [2025-02-06 04:44:13,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.25) internal successors, (165), 20 states have internal predecessors, (165), 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:44:13,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:13,911 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:13,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 04:44:14,111 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:44:14,111 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:44:14,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:14,112 INFO L85 PathProgramCache]: Analyzing trace with hash 972261912, now seen corresponding path program 6 times [2025-02-06 04:44:14,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:14,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186573030] [2025-02-06 04:44:14,112 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:44:14,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:14,125 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 3 equivalence classes. [2025-02-06 04:44:14,154 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:44:14,154 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 04:44:14,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:14,466 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:44:14,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:14,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186573030] [2025-02-06 04:44:14,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186573030] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:44:14,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985535618] [2025-02-06 04:44:14,467 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:44:14,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:14,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:44:14,468 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:44:14,470 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:44:14,514 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 3 equivalence classes. [2025-02-06 04:44:14,542 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 04:44:14,542 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 04:44:14,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:14,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 04:44:14,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:44:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 04:44:14,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:44:14,667 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 04:44:14,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2025-02-06 04:44:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 04:44:14,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985535618] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:44:14,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:44:14,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2025-02-06 04:44:14,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391095650] [2025-02-06 04:44:14,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:44:14,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 04:44:14,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:14,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 04:44:14,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:44:14,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:44:14,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 416 flow. Second operand has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 17 states have internal predecessors, (145), 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:44:14,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:14,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:44:14,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:15,848 INFO L124 PetriNetUnfolderBase]: 3206/5541 cut-off events. [2025-02-06 04:44:15,849 INFO L125 PetriNetUnfolderBase]: For 3486/3486 co-relation queries the response was YES. [2025-02-06 04:44:15,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13193 conditions, 5541 events. 3206/5541 cut-off events. For 3486/3486 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 32106 event pairs, 510 based on Foata normal form. 3/4686 useless extension candidates. Maximal degree in co-relation 13164. Up to 1000 conditions per place. [2025-02-06 04:44:15,874 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 144 selfloop transitions, 60 changer transitions 90/297 dead transitions. [2025-02-06 04:44:15,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 297 transitions, 1649 flow [2025-02-06 04:44:15,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 04:44:15,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-02-06 04:44:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 375 transitions. [2025-02-06 04:44:15,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5822981366459627 [2025-02-06 04:44:15,877 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 416 flow. Second operand 23 states and 375 transitions. [2025-02-06 04:44:15,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 297 transitions, 1649 flow [2025-02-06 04:44:15,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 297 transitions, 1593 flow, removed 25 selfloop flow, removed 9 redundant places. [2025-02-06 04:44:15,892 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 688 flow [2025-02-06 04:44:15,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=688, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2025-02-06 04:44:15,893 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 69 predicate places. [2025-02-06 04:44:15,893 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 688 flow [2025-02-06 04:44:15,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 17 states have internal predecessors, (145), 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:44:15,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:15,893 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:15,900 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:44:16,093 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:44:16,094 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:44:16,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:16,094 INFO L85 PathProgramCache]: Analyzing trace with hash -9863523, now seen corresponding path program 7 times [2025-02-06 04:44:16,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:16,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862020167] [2025-02-06 04:44:16,094 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:44:16,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:16,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 04:44:16,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 04:44:16,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:44:16,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 04:44:16,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:16,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862020167] [2025-02-06 04:44:16,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862020167] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:44:16,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258102484] [2025-02-06 04:44:16,192 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:44:16,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:16,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:44:16,194 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:44:16,196 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:44:16,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 04:44:16,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 04:44:16,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:44:16,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:16,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:44:16,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:44:16,295 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 04:44:16,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:44:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 04:44:16,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258102484] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:44:16,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:44:16,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-02-06 04:44:16,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348487906] [2025-02-06 04:44:16,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:44:16,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:44:16,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:16,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:44:16,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:44:16,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:44:16,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 688 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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:44:16,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:16,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:44:16,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:16,988 INFO L124 PetriNetUnfolderBase]: 5593/9636 cut-off events. [2025-02-06 04:44:16,988 INFO L125 PetriNetUnfolderBase]: For 8502/8502 co-relation queries the response was YES. [2025-02-06 04:44:17,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23745 conditions, 9636 events. 5593/9636 cut-off events. For 8502/8502 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 60283 event pairs, 1470 based on Foata normal form. 33/8175 useless extension candidates. Maximal degree in co-relation 23716. Up to 2498 conditions per place. [2025-02-06 04:44:17,031 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 104 selfloop transitions, 81 changer transitions 0/188 dead transitions. [2025-02-06 04:44:17,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 188 transitions, 1677 flow [2025-02-06 04:44:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:44:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:44:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-02-06 04:44:17,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-02-06 04:44:17,032 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 688 flow. Second operand 6 states and 114 transitions. [2025-02-06 04:44:17,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 188 transitions, 1677 flow [2025-02-06 04:44:17,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 188 transitions, 1610 flow, removed 28 selfloop flow, removed 4 redundant places. [2025-02-06 04:44:17,065 INFO L231 Difference]: Finished difference. Result has 101 places, 132 transitions, 1356 flow [2025-02-06 04:44:17,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1356, PETRI_PLACES=101, PETRI_TRANSITIONS=132} [2025-02-06 04:44:17,066 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 74 predicate places. [2025-02-06 04:44:17,066 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 132 transitions, 1356 flow [2025-02-06 04:44:17,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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:44:17,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:17,066 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:17,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 04:44:17,266 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:44:17,267 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:44:17,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:17,267 INFO L85 PathProgramCache]: Analyzing trace with hash -582976617, now seen corresponding path program 8 times [2025-02-06 04:44:17,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:17,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382346239] [2025-02-06 04:44:17,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:44:17,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:17,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-06 04:44:17,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 04:44:17,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:44:17,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:17,545 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 04:44:17,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:17,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382346239] [2025-02-06 04:44:17,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382346239] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:44:17,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303855741] [2025-02-06 04:44:17,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:44:17,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:17,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:44:17,548 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:44:17,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 04:44:17,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-06 04:44:17,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 04:44:17,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:44:17,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:17,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 04:44:17,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:44:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 04:44:17,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:44:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 04:44:18,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303855741] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:44:18,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:44:18,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-02-06 04:44:18,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607380369] [2025-02-06 04:44:18,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:44:18,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 04:44:18,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:18,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 04:44:18,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2025-02-06 04:44:18,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:44:18,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 132 transitions, 1356 flow. Second operand has 27 states, 27 states have (on average 8.25925925925926) internal successors, (223), 27 states have internal predecessors, (223), 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:44:18,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:18,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:44:18,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:19,680 INFO L124 PetriNetUnfolderBase]: 11029/19216 cut-off events. [2025-02-06 04:44:19,680 INFO L125 PetriNetUnfolderBase]: For 29938/29938 co-relation queries the response was YES. [2025-02-06 04:44:19,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49586 conditions, 19216 events. 11029/19216 cut-off events. For 29938/29938 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 141331 event pairs, 3417 based on Foata normal form. 451/16621 useless extension candidates. Maximal degree in co-relation 49553. Up to 7523 conditions per place. [2025-02-06 04:44:19,774 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 108 selfloop transitions, 6 changer transitions 187/304 dead transitions. [2025-02-06 04:44:19,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 304 transitions, 3086 flow [2025-02-06 04:44:19,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:44:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 04:44:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 186 transitions. [2025-02-06 04:44:19,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.510989010989011 [2025-02-06 04:44:19,776 INFO L175 Difference]: Start difference. First operand has 101 places, 132 transitions, 1356 flow. Second operand 13 states and 186 transitions. [2025-02-06 04:44:19,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 304 transitions, 3086 flow [2025-02-06 04:44:19,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 304 transitions, 3064 flow, removed 11 selfloop flow, removed 0 redundant places. [2025-02-06 04:44:19,911 INFO L231 Difference]: Finished difference. Result has 117 places, 110 transitions, 1273 flow [2025-02-06 04:44:19,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1273, PETRI_PLACES=117, PETRI_TRANSITIONS=110} [2025-02-06 04:44:19,912 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 90 predicate places. [2025-02-06 04:44:19,912 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 110 transitions, 1273 flow [2025-02-06 04:44:19,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.25925925925926) internal successors, (223), 27 states have internal predecessors, (223), 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:44:19,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:19,913 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:19,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 04:44:20,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 04:44:20,114 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:44:20,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:20,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2018253699, now seen corresponding path program 9 times [2025-02-06 04:44:20,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:20,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845972174] [2025-02-06 04:44:20,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:44:20,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:20,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-02-06 04:44:20,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 04:44:20,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 04:44:20,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:20,505 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 04:44:20,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:20,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845972174] [2025-02-06 04:44:20,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845972174] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:44:20,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854169827] [2025-02-06 04:44:20,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:44:20,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:20,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:44:20,507 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:44:20,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 04:44:20,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-02-06 04:44:20,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 04:44:20,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 04:44:20,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:20,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 04:44:20,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:44:20,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:44:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:44:21,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:44:21,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2025-02-06 04:44:21,557 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 04:44:21,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 45 [2025-02-06 04:44:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 04:44:21,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854169827] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:44:21,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:44:21,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 12] total 34 [2025-02-06 04:44:21,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823969866] [2025-02-06 04:44:21,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:44:21,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 04:44:21,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:21,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 04:44:21,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 04:44:21,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:44:21,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 110 transitions, 1273 flow. Second operand has 35 states, 35 states have (on average 8.028571428571428) internal successors, (281), 35 states have internal predecessors, (281), 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:44:21,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:21,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:44:21,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:25,795 INFO L124 PetriNetUnfolderBase]: 18958/32476 cut-off events. [2025-02-06 04:44:25,796 INFO L125 PetriNetUnfolderBase]: For 78825/78825 co-relation queries the response was YES. [2025-02-06 04:44:26,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91631 conditions, 32476 events. 18958/32476 cut-off events. For 78825/78825 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 229908 event pairs, 3800 based on Foata normal form. 49/27482 useless extension candidates. Maximal degree in co-relation 91593. Up to 5975 conditions per place. [2025-02-06 04:44:26,078 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 343 selfloop transitions, 246 changer transitions 153/745 dead transitions. [2025-02-06 04:44:26,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 745 transitions, 7568 flow [2025-02-06 04:44:26,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-06 04:44:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-02-06 04:44:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 598 transitions. [2025-02-06 04:44:26,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5932539682539683 [2025-02-06 04:44:26,080 INFO L175 Difference]: Start difference. First operand has 117 places, 110 transitions, 1273 flow. Second operand 36 states and 598 transitions. [2025-02-06 04:44:26,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 745 transitions, 7568 flow [2025-02-06 04:44:26,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 745 transitions, 5986 flow, removed 483 selfloop flow, removed 19 redundant places. [2025-02-06 04:44:26,481 INFO L231 Difference]: Finished difference. Result has 134 places, 327 transitions, 4214 flow [2025-02-06 04:44:26,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=4214, PETRI_PLACES=134, PETRI_TRANSITIONS=327} [2025-02-06 04:44:26,482 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 107 predicate places. [2025-02-06 04:44:26,482 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 327 transitions, 4214 flow [2025-02-06 04:44:26,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.028571428571428) internal successors, (281), 35 states have internal predecessors, (281), 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:44:26,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:26,482 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:26,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 04:44:26,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:26,682 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:44:26,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:26,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1050003554, now seen corresponding path program 10 times [2025-02-06 04:44:26,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:26,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033420995] [2025-02-06 04:44:26,683 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:44:26,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:26,689 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-02-06 04:44:26,696 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 04:44:26,696 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:44:26,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 04:44:26,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:26,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033420995] [2025-02-06 04:44:26,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033420995] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:44:26,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023725283] [2025-02-06 04:44:26,938 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:44:26,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:26,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:44:26,940 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:44:26,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 04:44:26,984 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-02-06 04:44:27,010 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 04:44:27,010 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:44:27,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:27,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 04:44:27,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:44:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 04:44:27,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:44:27,175 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 04:44:27,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2025-02-06 04:44:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 04:44:27,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023725283] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:44:27,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:44:27,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2025-02-06 04:44:27,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013262395] [2025-02-06 04:44:27,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:44:27,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 04:44:27,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:27,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 04:44:27,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-02-06 04:44:27,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:44:27,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 327 transitions, 4214 flow. Second operand has 23 states, 23 states have (on average 8.782608695652174) internal successors, (202), 23 states have internal predecessors, (202), 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:44:27,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:27,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:44:27,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:44:38,502 INFO L124 PetriNetUnfolderBase]: 61300/104540 cut-off events. [2025-02-06 04:44:38,502 INFO L125 PetriNetUnfolderBase]: For 320316/320316 co-relation queries the response was YES. [2025-02-06 04:44:39,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307319 conditions, 104540 events. 61300/104540 cut-off events. For 320316/320316 co-relation queries the response was YES. Maximal size of possible extension queue 1487. Compared 876449 event pairs, 5401 based on Foata normal form. 106/88465 useless extension candidates. Maximal degree in co-relation 307274. Up to 19225 conditions per place. [2025-02-06 04:44:39,648 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 443 selfloop transitions, 903 changer transitions 156/1505 dead transitions. [2025-02-06 04:44:39,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 1505 transitions, 18375 flow [2025-02-06 04:44:39,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-06 04:44:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-02-06 04:44:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 916 transitions. [2025-02-06 04:44:39,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6815476190476191 [2025-02-06 04:44:39,651 INFO L175 Difference]: Start difference. First operand has 134 places, 327 transitions, 4214 flow. Second operand 48 states and 916 transitions. [2025-02-06 04:44:39,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 1505 transitions, 18375 flow [2025-02-06 04:44:41,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 1505 transitions, 17374 flow, removed 487 selfloop flow, removed 8 redundant places. [2025-02-06 04:44:41,911 INFO L231 Difference]: Finished difference. Result has 209 places, 977 transitions, 16340 flow [2025-02-06 04:44:41,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3975, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=301, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=16340, PETRI_PLACES=209, PETRI_TRANSITIONS=977} [2025-02-06 04:44:41,912 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 182 predicate places. [2025-02-06 04:44:41,912 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 977 transitions, 16340 flow [2025-02-06 04:44:41,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.782608695652174) internal successors, (202), 23 states have internal predecessors, (202), 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:44:41,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:44:41,912 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:44:41,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 04:44:42,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:42,113 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:44:42,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:44:42,113 INFO L85 PathProgramCache]: Analyzing trace with hash -989945447, now seen corresponding path program 11 times [2025-02-06 04:44:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:44:42,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025695007] [2025-02-06 04:44:42,113 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:44:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:44:42,120 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 6 equivalence classes. [2025-02-06 04:44:42,132 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 04:44:42,132 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-06 04:44:42,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 40 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 04:44:42,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:44:42,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025695007] [2025-02-06 04:44:42,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025695007] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:44:42,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280095600] [2025-02-06 04:44:42,325 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:44:42,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:44:42,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:44:42,330 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:44:42,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 04:44:42,376 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 6 equivalence classes. [2025-02-06 04:44:42,421 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 04:44:42,422 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-06 04:44:42,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:44:42,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 04:44:42,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:44:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 40 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 04:44:42,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:44:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 38 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 04:44:42,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280095600] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:44:42,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:44:42,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2025-02-06 04:44:42,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915914696] [2025-02-06 04:44:42,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:44:42,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-06 04:44:42,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:44:42,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-06 04:44:42,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1245, Unknown=0, NotChecked=0, Total=1640 [2025-02-06 04:44:42,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-06 04:44:42,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 977 transitions, 16340 flow. Second operand has 41 states, 41 states have (on average 7.804878048780488) internal successors, (320), 41 states have internal predecessors, (320), 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:44:42,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:44:42,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-06 04:44:42,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand