./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/unroll-cond-5.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/unroll-cond-5.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 052a68c73a5d1c6e7122fc0c660c02483f37277d0239d876d93b351fcdd64a16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:45:10,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:45:10,130 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:45:10,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:45:10,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:45:10,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:45:10,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:45:10,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:45:10,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:45:10,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:45:10,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:45:10,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:45:10,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:45:10,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:45:10,164 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:45:10,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:45:10,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:45:10,164 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:45:10,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:45:10,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:45:10,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:45:10,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:45:10,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:45:10,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:45:10,165 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:45:10,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:45:10,165 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:45:10,165 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:45:10,165 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:45:10,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:45:10,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:45:10,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:45:10,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:45:10,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:45:10,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:45:10,166 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:45:10,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:45:10,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:45:10,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:45:10,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:45:10,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:45:10,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:45:10,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:45:10,167 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 -> 052a68c73a5d1c6e7122fc0c660c02483f37277d0239d876d93b351fcdd64a16 [2025-02-06 04:45:10,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:45:10,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:45:10,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:45:10,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:45:10,441 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:45:10,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-5.wvr.c [2025-02-06 04:45:11,646 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2622ee6a3/933ae53c58a34606b6939b24257f06b2/FLAG8a51dfc86 [2025-02-06 04:45:11,885 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:45:11,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-5.wvr.c [2025-02-06 04:45:11,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2622ee6a3/933ae53c58a34606b6939b24257f06b2/FLAG8a51dfc86 [2025-02-06 04:45:12,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2622ee6a3/933ae53c58a34606b6939b24257f06b2 [2025-02-06 04:45:12,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:45:12,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:45:12,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:45:12,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:45:12,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:45:12,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:45:12" (1/1) ... [2025-02-06 04:45:12,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f564414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:12, skipping insertion in model container [2025-02-06 04:45:12,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:45:12" (1/1) ... [2025-02-06 04:45:12,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:45:12,415 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/unroll-cond-5.wvr.c[3001,3014] [2025-02-06 04:45:12,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:45:12,435 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:45:12,466 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/unroll-cond-5.wvr.c[3001,3014] [2025-02-06 04:45:12,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:45:12,484 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:45:12,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:12 WrapperNode [2025-02-06 04:45:12,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:45:12,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:45:12,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:45:12,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:45:12,491 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:45:12" (1/1) ... [2025-02-06 04:45:12,502 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:45:12" (1/1) ... [2025-02-06 04:45:12,525 INFO L138 Inliner]: procedures = 23, calls = 35, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 188 [2025-02-06 04:45:12,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:45:12,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:45:12,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:45:12,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:45:12,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:12" (1/1) ... [2025-02-06 04:45:12,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:12" (1/1) ... [2025-02-06 04:45:12,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:12" (1/1) ... [2025-02-06 04:45:12,552 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 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:45:12,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:12" (1/1) ... [2025-02-06 04:45:12,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:12" (1/1) ... [2025-02-06 04:45:12,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:12" (1/1) ... [2025-02-06 04:45:12,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:12" (1/1) ... [2025-02-06 04:45:12,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:12" (1/1) ... [2025-02-06 04:45:12,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:12" (1/1) ... [2025-02-06 04:45:12,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:45:12,570 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:45:12,571 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:45:12,571 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:45:12,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:12" (1/1) ... [2025-02-06 04:45:12,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:45:12,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:45:12,596 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:45:12,598 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:45:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:45:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:45:12,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:45:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:45:12,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:45:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:45:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:45:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:45:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:45:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:45:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:45:12,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:45:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:45:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:45:12,620 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:45:12,719 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:45:12,721 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:45:13,113 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:45:13,113 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:45:13,420 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:45:13,421 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:45:13,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:45:13 BoogieIcfgContainer [2025-02-06 04:45:13,421 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:45:13,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:45:13,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:45:13,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:45:13,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:45:12" (1/3) ... [2025-02-06 04:45:13,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75507e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:45:13, skipping insertion in model container [2025-02-06 04:45:13,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:12" (2/3) ... [2025-02-06 04:45:13,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75507e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:45:13, skipping insertion in model container [2025-02-06 04:45:13,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:45:13" (3/3) ... [2025-02-06 04:45:13,430 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2025-02-06 04:45:13,443 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:45:13,444 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-5.wvr.c that has 3 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-06 04:45:13,444 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:45:13,505 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:45:13,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2025-02-06 04:45:13,593 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-02-06 04:45:13,596 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:45:13,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-02-06 04:45:13,602 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2025-02-06 04:45:13,604 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2025-02-06 04:45:13,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:45:13,624 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;@680e1822, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:45:13,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 04:45:13,636 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:45:13,636 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-02-06 04:45:13,636 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:45:13,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:13,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:13,638 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:45:13,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:13,644 INFO L85 PathProgramCache]: Analyzing trace with hash -669387975, now seen corresponding path program 1 times [2025-02-06 04:45:13,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:13,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707829060] [2025-02-06 04:45:13,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:13,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:13,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:45:13,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:45:13,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:13,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:14,056 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:45:14,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:14,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707829060] [2025-02-06 04:45:14,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707829060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:14,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:14,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:45:14,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137737587] [2025-02-06 04:45:14,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:14,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:45:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:14,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:45:14,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:45:14,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-02-06 04:45:14,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:45:14,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:14,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-02-06 04:45:14,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:15,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 04:45:15,309 INFO L124 PetriNetUnfolderBase]: 38/71 cut-off events. [2025-02-06 04:45:15,309 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 04:45:15,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 71 events. 38/71 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 119 event pairs, 22 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 120. Up to 70 conditions per place. [2025-02-06 04:45:15,312 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 15 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2025-02-06 04:45:15,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 82 flow [2025-02-06 04:45:15,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:45:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:45:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-02-06 04:45:15,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-02-06 04:45:15,324 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 27 transitions. [2025-02-06 04:45:15,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 82 flow [2025-02-06 04:45:15,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:45:15,332 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2025-02-06 04:45:15,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2025-02-06 04:45:15,337 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-02-06 04:45:15,338 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 18 transitions, 50 flow [2025-02-06 04:45:15,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:45:15,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:15,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:15,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:45:15,339 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:45:15,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:15,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1618550358, now seen corresponding path program 1 times [2025-02-06 04:45:15,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:15,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456964490] [2025-02-06 04:45:15,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:15,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:15,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 04:45:15,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 04:45:15,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:15,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:15,731 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:45:15,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:15,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456964490] [2025-02-06 04:45:15,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456964490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:15,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:15,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:45:15,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848744151] [2025-02-06 04:45:15,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:15,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:45:15,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:15,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:45:15,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:45:15,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-02-06 04:45:15,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:45:15,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:15,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-02-06 04:45:15,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:16,288 INFO L124 PetriNetUnfolderBase]: 65/123 cut-off events. [2025-02-06 04:45:16,288 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:45:16,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 123 events. 65/123 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 321 event pairs, 22 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 248. Up to 71 conditions per place. [2025-02-06 04:45:16,291 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 32 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2025-02-06 04:45:16,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 38 transitions, 169 flow [2025-02-06 04:45:16,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:45:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:45:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-02-06 04:45:16,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-02-06 04:45:16,294 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 50 flow. Second operand 5 states and 52 transitions. [2025-02-06 04:45:16,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 38 transitions, 169 flow [2025-02-06 04:45:16,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 38 transitions, 165 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:45:16,296 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 82 flow [2025-02-06 04:45:16,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-02-06 04:45:16,297 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2025-02-06 04:45:16,297 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 82 flow [2025-02-06 04:45:16,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:45:16,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:16,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:16,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:45:16,298 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:45:16,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:16,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1231893450, now seen corresponding path program 2 times [2025-02-06 04:45:16,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:16,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878699227] [2025-02-06 04:45:16,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:45:16,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:16,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-06 04:45:16,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-02-06 04:45:16,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:45:16,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:16,599 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:45:16,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:16,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878699227] [2025-02-06 04:45:16,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878699227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:16,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:16,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:45:16,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598663151] [2025-02-06 04:45:16,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:16,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:45:16,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:16,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:45:16,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:45:16,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-02-06 04:45:16,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:45:16,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:16,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-02-06 04:45:16,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:16,818 INFO L124 PetriNetUnfolderBase]: 100/190 cut-off events. [2025-02-06 04:45:16,818 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-02-06 04:45:16,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 190 events. 100/190 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 588 event pairs, 39 based on Foata normal form. 2/155 useless extension candidates. Maximal degree in co-relation 531. Up to 120 conditions per place. [2025-02-06 04:45:16,822 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 34 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2025-02-06 04:45:16,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 42 transitions, 242 flow [2025-02-06 04:45:16,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:45:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:45:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-02-06 04:45:16,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-02-06 04:45:16,825 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 82 flow. Second operand 5 states and 48 transitions. [2025-02-06 04:45:16,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 42 transitions, 242 flow [2025-02-06 04:45:16,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 42 transitions, 225 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-06 04:45:16,828 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 124 flow [2025-02-06 04:45:16,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2025-02-06 04:45:16,829 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2025-02-06 04:45:16,829 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 124 flow [2025-02-06 04:45:16,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:45:16,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:16,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:16,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:45:16,831 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:45:16,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:16,831 INFO L85 PathProgramCache]: Analyzing trace with hash 831937644, now seen corresponding path program 3 times [2025-02-06 04:45:16,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:16,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820207181] [2025-02-06 04:45:16,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:45:16,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:16,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-02-06 04:45:16,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-02-06 04:45:16,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:45:16,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:17,029 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:45:17,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:17,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820207181] [2025-02-06 04:45:17,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820207181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:17,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:17,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:45:17,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295379350] [2025-02-06 04:45:17,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:17,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:45:17,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:17,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:45:17,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:45:17,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-02-06 04:45:17,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:45:17,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:17,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-02-06 04:45:17,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:17,199 INFO L124 PetriNetUnfolderBase]: 109/204 cut-off events. [2025-02-06 04:45:17,199 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2025-02-06 04:45:17,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 204 events. 109/204 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 646 event pairs, 39 based on Foata normal form. 3/182 useless extension candidates. Maximal degree in co-relation 689. Up to 111 conditions per place. [2025-02-06 04:45:17,202 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 33 selfloop transitions, 12 changer transitions 0/46 dead transitions. [2025-02-06 04:45:17,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 307 flow [2025-02-06 04:45:17,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:45:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:45:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-02-06 04:45:17,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-02-06 04:45:17,205 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 124 flow. Second operand 5 states and 52 transitions. [2025-02-06 04:45:17,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 307 flow [2025-02-06 04:45:17,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 283 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-02-06 04:45:17,209 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 203 flow [2025-02-06 04:45:17,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-02-06 04:45:17,210 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2025-02-06 04:45:17,210 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 203 flow [2025-02-06 04:45:17,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:45:17,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:17,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:17,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:45:17,211 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:45:17,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2008245736, now seen corresponding path program 4 times [2025-02-06 04:45:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:17,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286336800] [2025-02-06 04:45:17,212 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:45:17,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:17,222 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-02-06 04:45:17,258 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 04:45:17,259 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:45:17,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:17,473 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:45:17,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:17,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286336800] [2025-02-06 04:45:17,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286336800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:17,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:17,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:45:17,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392972071] [2025-02-06 04:45:17,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:17,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:45:17,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:17,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:45:17,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:45:17,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-02-06 04:45:17,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:45:17,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:17,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-02-06 04:45:17,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:17,670 INFO L124 PetriNetUnfolderBase]: 106/201 cut-off events. [2025-02-06 04:45:17,671 INFO L125 PetriNetUnfolderBase]: For 471/471 co-relation queries the response was YES. [2025-02-06 04:45:17,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 201 events. 106/201 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 638 event pairs, 46 based on Foata normal form. 3/179 useless extension candidates. Maximal degree in co-relation 752. Up to 160 conditions per place. [2025-02-06 04:45:17,675 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 29 selfloop transitions, 15 changer transitions 0/45 dead transitions. [2025-02-06 04:45:17,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 365 flow [2025-02-06 04:45:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:45:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:45:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-02-06 04:45:17,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47 [2025-02-06 04:45:17,676 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 203 flow. Second operand 5 states and 47 transitions. [2025-02-06 04:45:17,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 365 flow [2025-02-06 04:45:17,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 352 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-06 04:45:17,683 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 296 flow [2025-02-06 04:45:17,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-02-06 04:45:17,684 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2025-02-06 04:45:17,684 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 296 flow [2025-02-06 04:45:17,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:45:17,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:17,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:17,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:45:17,685 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:45:17,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash 908798424, now seen corresponding path program 5 times [2025-02-06 04:45:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:17,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113835857] [2025-02-06 04:45:17,685 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:45:17,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:17,699 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-06 04:45:17,714 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 04:45:17,715 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:45:17,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:17,865 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:45:17,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:17,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113835857] [2025-02-06 04:45:17,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113835857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:17,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:17,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:45:17,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632693049] [2025-02-06 04:45:17,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:17,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:45:17,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:17,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:45:17,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:45:17,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-02-06 04:45:17,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:45:17,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:17,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-02-06 04:45:17,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:20,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 04:45:20,495 INFO L124 PetriNetUnfolderBase]: 107/204 cut-off events. [2025-02-06 04:45:20,495 INFO L125 PetriNetUnfolderBase]: For 588/588 co-relation queries the response was YES. [2025-02-06 04:45:20,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 204 events. 107/204 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 658 event pairs, 34 based on Foata normal form. 2/181 useless extension candidates. Maximal degree in co-relation 852. Up to 113 conditions per place. [2025-02-06 04:45:20,499 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 35 selfloop transitions, 14 changer transitions 0/50 dead transitions. [2025-02-06 04:45:20,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 432 flow [2025-02-06 04:45:20,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:45:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:45:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2025-02-06 04:45:20,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51 [2025-02-06 04:45:20,500 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 296 flow. Second operand 5 states and 51 transitions. [2025-02-06 04:45:20,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 432 flow [2025-02-06 04:45:20,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 378 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-02-06 04:45:20,508 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 282 flow [2025-02-06 04:45:20,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2025-02-06 04:45:20,511 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2025-02-06 04:45:20,511 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 282 flow [2025-02-06 04:45:20,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:45:20,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:20,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:20,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:45:20,512 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:45:20,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:20,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2091362626, now seen corresponding path program 6 times [2025-02-06 04:45:20,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:20,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908744898] [2025-02-06 04:45:20,513 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:45:20,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:20,524 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-02-06 04:45:20,550 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-02-06 04:45:20,551 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:45:20,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:20,659 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:45:20,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:20,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908744898] [2025-02-06 04:45:20,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908744898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:20,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:20,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:45:20,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646033005] [2025-02-06 04:45:20,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:20,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:45:20,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:20,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:45:20,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:45:20,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-02-06 04:45:20,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:45:20,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:20,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-02-06 04:45:20,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:20,844 INFO L124 PetriNetUnfolderBase]: 106/197 cut-off events. [2025-02-06 04:45:20,845 INFO L125 PetriNetUnfolderBase]: For 597/597 co-relation queries the response was YES. [2025-02-06 04:45:20,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 197 events. 106/197 cut-off events. For 597/597 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 616 event pairs, 45 based on Foata normal form. 2/174 useless extension candidates. Maximal degree in co-relation 798. Up to 154 conditions per place. [2025-02-06 04:45:20,847 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 31 selfloop transitions, 15 changer transitions 0/47 dead transitions. [2025-02-06 04:45:20,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 404 flow [2025-02-06 04:45:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:45:20,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:45:20,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-02-06 04:45:20,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47 [2025-02-06 04:45:20,848 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 282 flow. Second operand 5 states and 47 transitions. [2025-02-06 04:45:20,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 404 flow [2025-02-06 04:45:20,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 370 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-06 04:45:20,852 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 294 flow [2025-02-06 04:45:20,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-02-06 04:45:20,853 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 27 predicate places. [2025-02-06 04:45:20,853 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 294 flow [2025-02-06 04:45:20,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:45:20,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:20,854 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:45:20,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:45:20,854 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:45:20,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:20,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1113778678, now seen corresponding path program 1 times [2025-02-06 04:45:20,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:20,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019922530] [2025-02-06 04:45:20,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:20,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:20,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 04:45:20,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 04:45:20,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:20,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:45:21,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:21,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019922530] [2025-02-06 04:45:21,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019922530] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:45:21,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349378621] [2025-02-06 04:45:21,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:21,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:21,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:45:21,101 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:45:21,103 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:45:21,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 04:45:21,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 04:45:21,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:21,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:21,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 04:45:21,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:45:21,340 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:45:21,738 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 217 treesize of output 197 [2025-02-06 04:45:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:55,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:46:35,262 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 26 DAG size of output: 24 (called from [L 188] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne)