./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:52:06,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:52:06,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:52:06,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:52:06,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:52:06,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:52:06,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:52:06,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:52:06,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:52:06,794 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:52:06,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:52:06,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:52:06,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:52:06,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:52:06,796 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:52:06,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:52:06,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:52:06,796 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:52:06,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:52:06,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:52:06,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:52:06,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:52:06,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:52:06,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:52:06,797 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:52:06,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:52:06,797 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:52:06,797 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:52:06,797 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:52:06,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:52:06,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:52:06,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:52:06,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:52:06,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:52:06,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:52:06,798 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:52:06,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:52:06,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:52:06,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:52:06,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:52:06,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:52:06,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:52:06,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:52:06,798 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/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 -> 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 [2025-03-13 21:52:07,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:52:07,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:52:07,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:52:07,033 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:52:07,034 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:52:07,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-03-13 21:52:08,108 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91819cf1c/f305123cd12b4845b549b0112eb08688/FLAGa296591c6 [2025-03-13 21:52:08,338 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:52:08,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-03-13 21:52:08,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91819cf1c/f305123cd12b4845b549b0112eb08688/FLAGa296591c6 [2025-03-13 21:52:08,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91819cf1c/f305123cd12b4845b549b0112eb08688 [2025-03-13 21:52:08,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:52:08,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:52:08,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:52:08,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:52:08,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:52:08,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:52:08" (1/1) ... [2025-03-13 21:52:08,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5031874c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:08, skipping insertion in model container [2025-03-13 21:52:08,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:52:08" (1/1) ... [2025-03-13 21:52:08,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:52:08,511 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c[3013,3026] [2025-03-13 21:52:08,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:52:08,528 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:52:08,546 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c[3013,3026] [2025-03-13 21:52:08,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:52:08,563 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:52:08,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:08 WrapperNode [2025-03-13 21:52:08,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:52:08,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:52:08,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:52:08,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:52:08,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:08" (1/1) ... [2025-03-13 21:52:08,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:08" (1/1) ... [2025-03-13 21:52:08,595 INFO L138 Inliner]: procedures = 23, calls = 33, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 186 [2025-03-13 21:52:08,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:52:08,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:52:08,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:52:08,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:52:08,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:08" (1/1) ... [2025-03-13 21:52:08,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:08" (1/1) ... [2025-03-13 21:52:08,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:08" (1/1) ... [2025-03-13 21:52:08,619 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-13 21:52:08,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:08" (1/1) ... [2025-03-13 21:52:08,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:08" (1/1) ... [2025-03-13 21:52:08,626 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:08" (1/1) ... [2025-03-13 21:52:08,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:08" (1/1) ... [2025-03-13 21:52:08,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:08" (1/1) ... [2025-03-13 21:52:08,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:08" (1/1) ... [2025-03-13 21:52:08,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:52:08,633 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:52:08,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:52:08,634 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:52:08,635 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:08" (1/1) ... [2025-03-13 21:52:08,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:52:08,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:08,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:52:08,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:52:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:52:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:52:08,673 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:52:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:52:08,673 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:52:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:52:08,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:52:08,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:52:08,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:52:08,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:52:08,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:52:08,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:52:08,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:52:08,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:52:08,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:52:08,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:52:08,675 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:52:08,748 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:52:08,750 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:52:09,015 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:52:09,016 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:52:09,016 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:52:09,340 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:52:09,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:52:09 BoogieIcfgContainer [2025-03-13 21:52:09,341 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:52:09,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:52:09,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:52:09,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:52:09,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:52:08" (1/3) ... [2025-03-13 21:52:09,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afb6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:52:09, skipping insertion in model container [2025-03-13 21:52:09,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:08" (2/3) ... [2025-03-13 21:52:09,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afb6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:52:09, skipping insertion in model container [2025-03-13 21:52:09,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:52:09" (3/3) ... [2025-03-13 21:52:09,348 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2025-03-13 21:52:09,359 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:52:09,360 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-two-queue.wvr.c that has 3 procedures, 25 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-13 21:52:09,361 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:52:09,399 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:52:09,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 70 flow [2025-03-13 21:52:09,449 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-03-13 21:52:09,452 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:52:09,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 4/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-03-13 21:52:09,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 28 transitions, 70 flow [2025-03-13 21:52:09,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 25 transitions, 62 flow [2025-03-13 21:52:09,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:52:09,477 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;@546e58f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:52:09,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:52:09,490 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:52:09,490 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-03-13 21:52:09,490 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:52:09,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:09,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:09,491 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-03-13 21:52:09,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash 768563539, now seen corresponding path program 1 times [2025-03-13 21:52:09,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:09,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676688026] [2025-03-13 21:52:09,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:09,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:09,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 21:52:09,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 21:52:09,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:09,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:09,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:09,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676688026] [2025-03-13 21:52:09,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676688026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:09,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:09,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:52:09,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187665105] [2025-03-13 21:52:09,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:09,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:52:09,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:09,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:52:09,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:52:09,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-13 21:52:09,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 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-03-13 21:52:09,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:09,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-13 21:52:09,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:09,963 INFO L124 PetriNetUnfolderBase]: 141/263 cut-off events. [2025-03-13 21:52:09,963 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-13 21:52:09,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 263 events. 141/263 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1060 event pairs, 26 based on Foata normal form. 1/253 useless extension candidates. Maximal degree in co-relation 458. Up to 181 conditions per place. [2025-03-13 21:52:09,966 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 27 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2025-03-13 21:52:09,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 155 flow [2025-03-13 21:52:09,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:52:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:52:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-03-13 21:52:09,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-03-13 21:52:09,975 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 62 flow. Second operand 3 states and 53 transitions. [2025-03-13 21:52:09,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 155 flow [2025-03-13 21:52:09,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 141 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:52:09,980 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 73 flow [2025-03-13 21:52:09,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2025-03-13 21:52:09,983 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -1 predicate places. [2025-03-13 21:52:09,983 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 73 flow [2025-03-13 21:52:09,984 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-03-13 21:52:09,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:09,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:09,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:52:09,984 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-03-13 21:52:09,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:09,985 INFO L85 PathProgramCache]: Analyzing trace with hash 23169152, now seen corresponding path program 1 times [2025-03-13 21:52:09,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:09,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998090783] [2025-03-13 21:52:09,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:09,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:10,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:52:10,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:52:10,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:10,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:10,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:10,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998090783] [2025-03-13 21:52:10,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998090783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:10,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:10,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:52:10,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053280121] [2025-03-13 21:52:10,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:10,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:52:10,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:10,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:52:10,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:52:10,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-13 21:52:10,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-03-13 21:52:10,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:10,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-13 21:52:10,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:10,166 INFO L124 PetriNetUnfolderBase]: 105/206 cut-off events. [2025-03-13 21:52:10,166 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-13 21:52:10,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 206 events. 105/206 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 732 event pairs, 22 based on Foata normal form. 6/202 useless extension candidates. Maximal degree in co-relation 120. Up to 143 conditions per place. [2025-03-13 21:52:10,170 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 25 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2025-03-13 21:52:10,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 147 flow [2025-03-13 21:52:10,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:52:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:52:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-03-13 21:52:10,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-13 21:52:10,171 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 73 flow. Second operand 3 states and 49 transitions. [2025-03-13 21:52:10,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 147 flow [2025-03-13 21:52:10,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 34 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:52:10,172 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 82 flow [2025-03-13 21:52:10,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2025-03-13 21:52:10,173 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2025-03-13 21:52:10,173 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 82 flow [2025-03-13 21:52:10,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-03-13 21:52:10,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:10,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:10,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:52:10,173 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-03-13 21:52:10,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:10,173 INFO L85 PathProgramCache]: Analyzing trace with hash 178142070, now seen corresponding path program 1 times [2025-03-13 21:52:10,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:10,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324890553] [2025-03-13 21:52:10,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:10,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:10,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:52:10,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:52:10,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:10,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:10,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:10,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324890553] [2025-03-13 21:52:10,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324890553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:10,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:10,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:52:10,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490703124] [2025-03-13 21:52:10,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:10,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:52:10,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:10,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:52:10,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:52:10,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-13 21:52:10,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-03-13 21:52:10,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:10,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-13 21:52:10,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:10,326 INFO L124 PetriNetUnfolderBase]: 80/166 cut-off events. [2025-03-13 21:52:10,327 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-13 21:52:10,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 166 events. 80/166 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 489 event pairs, 27 based on Foata normal form. 5/163 useless extension candidates. Maximal degree in co-relation 246. Up to 112 conditions per place. [2025-03-13 21:52:10,330 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 26 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2025-03-13 21:52:10,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 170 flow [2025-03-13 21:52:10,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:52:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:52:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-03-13 21:52:10,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-03-13 21:52:10,331 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 82 flow. Second operand 3 states and 51 transitions. [2025-03-13 21:52:10,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 170 flow [2025-03-13 21:52:10,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:52:10,332 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 92 flow [2025-03-13 21:52:10,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-03-13 21:52:10,333 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2025-03-13 21:52:10,333 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 92 flow [2025-03-13 21:52:10,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-03-13 21:52:10,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:10,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:10,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:52:10,333 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-03-13 21:52:10,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:10,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1380778259, now seen corresponding path program 1 times [2025-03-13 21:52:10,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:10,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967849233] [2025-03-13 21:52:10,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:10,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:10,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:52:10,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:52:10,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:10,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:10,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:10,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:10,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967849233] [2025-03-13 21:52:10,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967849233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:10,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:10,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:52:10,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426052431] [2025-03-13 21:52:10,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:10,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:52:10,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:10,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:52:10,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:52:10,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-13 21:52:10,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-03-13 21:52:10,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:10,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-13 21:52:10,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:10,562 INFO L124 PetriNetUnfolderBase]: 95/216 cut-off events. [2025-03-13 21:52:10,563 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-03-13 21:52:10,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 216 events. 95/216 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 821 event pairs, 67 based on Foata normal form. 3/207 useless extension candidates. Maximal degree in co-relation 266. Up to 150 conditions per place. [2025-03-13 21:52:10,564 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 23 selfloop transitions, 2 changer transitions 12/42 dead transitions. [2025-03-13 21:52:10,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 42 transitions, 199 flow [2025-03-13 21:52:10,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:52:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:52:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-03-13 21:52:10,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2025-03-13 21:52:10,567 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 92 flow. Second operand 4 states and 62 transitions. [2025-03-13 21:52:10,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 42 transitions, 199 flow [2025-03-13 21:52:10,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:52:10,569 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 104 flow [2025-03-13 21:52:10,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-03-13 21:52:10,571 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 7 predicate places. [2025-03-13 21:52:10,571 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 104 flow [2025-03-13 21:52:10,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-03-13 21:52:10,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:10,571 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:10,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:52:10,572 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-03-13 21:52:10,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash -225535420, now seen corresponding path program 1 times [2025-03-13 21:52:10,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:10,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520910054] [2025-03-13 21:52:10,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:10,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:10,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:52:10,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:52:10,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:10,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:10,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:10,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520910054] [2025-03-13 21:52:10,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520910054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:10,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:10,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:52:10,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471474125] [2025-03-13 21:52:10,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:10,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:52:10,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:10,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:52:10,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:52:10,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-13 21:52:10,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:52:10,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:10,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-13 21:52:10,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:10,744 INFO L124 PetriNetUnfolderBase]: 93/211 cut-off events. [2025-03-13 21:52:10,744 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-13 21:52:10,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 211 events. 93/211 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 772 event pairs, 66 based on Foata normal form. 7/206 useless extension candidates. Maximal degree in co-relation 476. Up to 151 conditions per place. [2025-03-13 21:52:10,745 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 24 selfloop transitions, 2 changer transitions 10/41 dead transitions. [2025-03-13 21:52:10,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 206 flow [2025-03-13 21:52:10,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:52:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:52:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-03-13 21:52:10,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-03-13 21:52:10,746 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 104 flow. Second operand 4 states and 60 transitions. [2025-03-13 21:52:10,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 206 flow [2025-03-13 21:52:10,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 198 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-13 21:52:10,749 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 112 flow [2025-03-13 21:52:10,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2025-03-13 21:52:10,750 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 9 predicate places. [2025-03-13 21:52:10,751 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 112 flow [2025-03-13 21:52:10,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:52:10,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:10,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:10,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:52:10,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-03-13 21:52:10,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:10,752 INFO L85 PathProgramCache]: Analyzing trace with hash -317948351, now seen corresponding path program 1 times [2025-03-13 21:52:10,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:10,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099336755] [2025-03-13 21:52:10,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:10,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:10,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:52:10,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:52:10,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:10,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:12,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:12,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099336755] [2025-03-13 21:52:12,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099336755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:12,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012699492] [2025-03-13 21:52:12,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:12,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:12,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:12,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:52:12,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:52:12,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:52:12,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:52:12,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:12,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:12,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-13 21:52:12,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:12,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-13 21:52:12,335 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 23 treesize of output 1 [2025-03-13 21:52:12,385 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 21:52:12,385 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 11 treesize of output 11 [2025-03-13 21:52:12,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-13 21:52:13,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2025-03-13 21:52:13,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:13,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:18,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:52:18,609 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 198 treesize of output 190 [2025-03-13 21:52:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:19,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012699492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:19,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:19,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 40 [2025-03-13 21:52:19,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697954781] [2025-03-13 21:52:19,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:19,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-13 21:52:19,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:19,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-13 21:52:19,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1467, Unknown=1, NotChecked=0, Total=1640 [2025-03-13 21:52:19,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:19,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 112 flow. Second operand has 41 states, 41 states have (on average 6.560975609756097) internal successors, (269), 41 states have internal predecessors, (269), 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-03-13 21:52:19,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:19,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:19,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:27,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:52:32,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:52:42,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:52:46,226 INFO L124 PetriNetUnfolderBase]: 982/1825 cut-off events. [2025-03-13 21:52:46,227 INFO L125 PetriNetUnfolderBase]: For 389/389 co-relation queries the response was YES. [2025-03-13 21:52:46,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4358 conditions, 1825 events. 982/1825 cut-off events. For 389/389 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 9589 event pairs, 44 based on Foata normal form. 4/1550 useless extension candidates. Maximal degree in co-relation 3677. Up to 328 conditions per place. [2025-03-13 21:52:46,233 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 257 selfloop transitions, 206 changer transitions 50/516 dead transitions. [2025-03-13 21:52:46,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 516 transitions, 2548 flow [2025-03-13 21:52:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-03-13 21:52:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2025-03-13 21:52:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 973 transitions. [2025-03-13 21:52:46,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38186813186813184 [2025-03-13 21:52:46,240 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 112 flow. Second operand 91 states and 973 transitions. [2025-03-13 21:52:46,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 516 transitions, 2548 flow [2025-03-13 21:52:46,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 516 transitions, 2516 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-13 21:52:46,250 INFO L231 Difference]: Finished difference. Result has 158 places, 245 transitions, 1593 flow [2025-03-13 21:52:46,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=91, PETRI_FLOW=1593, PETRI_PLACES=158, PETRI_TRANSITIONS=245} [2025-03-13 21:52:46,252 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 130 predicate places. [2025-03-13 21:52:46,252 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 245 transitions, 1593 flow [2025-03-13 21:52:46,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.560975609756097) internal successors, (269), 41 states have internal predecessors, (269), 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-03-13 21:52:46,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:46,253 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:46,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:52:46,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-13 21:52:46,457 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-03-13 21:52:46,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:46,458 INFO L85 PathProgramCache]: Analyzing trace with hash -96043553, now seen corresponding path program 2 times [2025-03-13 21:52:46,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:46,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730081245] [2025-03-13 21:52:46,458 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:52:46,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:46,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-13 21:52:46,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-03-13 21:52:46,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:52:46,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:52:46,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:46,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730081245] [2025-03-13 21:52:46,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730081245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:46,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:46,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 21:52:46,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188849440] [2025-03-13 21:52:46,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:46,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:52:46,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:46,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:52:46,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:52:46,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:46,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 245 transitions, 1593 flow. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 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-03-13 21:52:46,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:46,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:46,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:47,217 INFO L124 PetriNetUnfolderBase]: 1065/1931 cut-off events. [2025-03-13 21:52:47,217 INFO L125 PetriNetUnfolderBase]: For 20642/20642 co-relation queries the response was YES. [2025-03-13 21:52:47,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10008 conditions, 1931 events. 1065/1931 cut-off events. For 20642/20642 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10072 event pairs, 133 based on Foata normal form. 2/1910 useless extension candidates. Maximal degree in co-relation 9678. Up to 1436 conditions per place. [2025-03-13 21:52:47,231 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 243 selfloop transitions, 67 changer transitions 3/316 dead transitions. [2025-03-13 21:52:47,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 316 transitions, 2793 flow [2025-03-13 21:52:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:52:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:52:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2025-03-13 21:52:47,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42207792207792205 [2025-03-13 21:52:47,232 INFO L175 Difference]: Start difference. First operand has 158 places, 245 transitions, 1593 flow. Second operand 11 states and 130 transitions. [2025-03-13 21:52:47,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 316 transitions, 2793 flow [2025-03-13 21:52:47,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 316 transitions, 2507 flow, removed 141 selfloop flow, removed 2 redundant places. [2025-03-13 21:52:47,302 INFO L231 Difference]: Finished difference. Result has 168 places, 277 transitions, 1811 flow [2025-03-13 21:52:47,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1811, PETRI_PLACES=168, PETRI_TRANSITIONS=277} [2025-03-13 21:52:47,304 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 140 predicate places. [2025-03-13 21:52:47,305 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 277 transitions, 1811 flow [2025-03-13 21:52:47,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 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-03-13 21:52:47,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:47,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:47,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:52:47,305 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-03-13 21:52:47,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:47,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1042349825, now seen corresponding path program 3 times [2025-03-13 21:52:47,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:47,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860834898] [2025-03-13 21:52:47,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:52:47,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:47,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-13 21:52:47,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-03-13 21:52:47,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:52:47,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:52:47,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:47,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860834898] [2025-03-13 21:52:47,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860834898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:47,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:47,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 21:52:47,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968299013] [2025-03-13 21:52:47,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:47,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:52:47,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:47,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:52:47,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:52:47,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:52:47,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 277 transitions, 1811 flow. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 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-03-13 21:52:47,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:47,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:52:47,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:48,073 INFO L124 PetriNetUnfolderBase]: 1181/2129 cut-off events. [2025-03-13 21:52:48,073 INFO L125 PetriNetUnfolderBase]: For 23467/23467 co-relation queries the response was YES. [2025-03-13 21:52:48,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11256 conditions, 2129 events. 1181/2129 cut-off events. For 23467/23467 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11444 event pairs, 189 based on Foata normal form. 2/2108 useless extension candidates. Maximal degree in co-relation 10927. Up to 1669 conditions per place. [2025-03-13 21:52:48,089 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 268 selfloop transitions, 62 changer transitions 3/336 dead transitions. [2025-03-13 21:52:48,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 336 transitions, 3006 flow [2025-03-13 21:52:48,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:52:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:52:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2025-03-13 21:52:48,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-03-13 21:52:48,090 INFO L175 Difference]: Start difference. First operand has 168 places, 277 transitions, 1811 flow. Second operand 11 states and 133 transitions. [2025-03-13 21:52:48,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 336 transitions, 3006 flow [2025-03-13 21:52:48,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 336 transitions, 2934 flow, removed 32 selfloop flow, removed 1 redundant places. [2025-03-13 21:52:48,134 INFO L231 Difference]: Finished difference. Result has 182 places, 297 transitions, 2108 flow [2025-03-13 21:52:48,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2108, PETRI_PLACES=182, PETRI_TRANSITIONS=297} [2025-03-13 21:52:48,136 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 154 predicate places. [2025-03-13 21:52:48,136 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 297 transitions, 2108 flow [2025-03-13 21:52:48,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 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-03-13 21:52:48,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:48,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:48,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:52:48,137 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-03-13 21:52:48,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash 834777015, now seen corresponding path program 4 times [2025-03-13 21:52:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:48,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191989592] [2025-03-13 21:52:48,137 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:52:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:48,144 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-13 21:52:48,162 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:52:48,162 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:52:48,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:49,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:49,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191989592] [2025-03-13 21:52:49,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191989592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:49,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240600982] [2025-03-13 21:52:49,625 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:52:49,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:49,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:49,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:52:49,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:52:49,667 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-13 21:52:49,685 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:52:49,685 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:52:49,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:49,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-13 21:52:49,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:49,767 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 23 treesize of output 1 [2025-03-13 21:52:50,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:52:50,028 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 50 treesize of output 34 [2025-03-13 21:52:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:50,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:50,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:52:50,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 297 [2025-03-13 21:52:51,175 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-13 21:52:51,175 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 22 treesize of output 13 [2025-03-13 21:52:51,197 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:52:51,198 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 22 treesize of output 1 [2025-03-13 21:52:51,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:52:51,208 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-13 21:52:51,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:52:51,218 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-13 21:52:51,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:52:51,341 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-03-13 21:52:51,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:52:51,348 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-03-13 21:52:51,360 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:52:51,360 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 35 treesize of output 1 [2025-03-13 21:52:51,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:52:51,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 339 treesize of output 587 [2025-03-13 21:53:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:53:35,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240600982] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:35,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:35,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 39 [2025-03-13 21:53:35,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665674110] [2025-03-13 21:53:35,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:35,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-13 21:53:35,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:35,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-13 21:53:35,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1421, Unknown=0, NotChecked=0, Total=1560 [2025-03-13 21:53:35,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:53:35,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 297 transitions, 2108 flow. Second operand has 40 states, 40 states have (on average 6.575) internal successors, (263), 40 states have internal predecessors, (263), 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-03-13 21:53:35,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:35,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:53:35,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:38,728 INFO L124 PetriNetUnfolderBase]: 1572/2829 cut-off events. [2025-03-13 21:53:38,728 INFO L125 PetriNetUnfolderBase]: For 29501/29501 co-relation queries the response was YES. [2025-03-13 21:53:38,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15120 conditions, 2829 events. 1572/2829 cut-off events. For 29501/29501 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16345 event pairs, 79 based on Foata normal form. 3/2806 useless extension candidates. Maximal degree in co-relation 14759. Up to 936 conditions per place. [2025-03-13 21:53:38,750 INFO L140 encePairwiseOnDemand]: 13/28 looper letters, 240 selfloop transitions, 318 changer transitions 10/571 dead transitions. [2025-03-13 21:53:38,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 571 transitions, 5388 flow [2025-03-13 21:53:38,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-13 21:53:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-03-13 21:53:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 469 transitions. [2025-03-13 21:53:38,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.335 [2025-03-13 21:53:38,752 INFO L175 Difference]: Start difference. First operand has 182 places, 297 transitions, 2108 flow. Second operand 50 states and 469 transitions. [2025-03-13 21:53:38,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 571 transitions, 5388 flow [2025-03-13 21:53:38,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 571 transitions, 5292 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-03-13 21:53:38,825 INFO L231 Difference]: Finished difference. Result has 237 places, 442 transitions, 4566 flow [2025-03-13 21:53:38,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2043, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=4566, PETRI_PLACES=237, PETRI_TRANSITIONS=442} [2025-03-13 21:53:38,827 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 209 predicate places. [2025-03-13 21:53:38,827 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 442 transitions, 4566 flow [2025-03-13 21:53:38,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.575) internal successors, (263), 40 states have internal predecessors, (263), 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-03-13 21:53:38,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:38,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:38,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:53:39,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-13 21:53:39,028 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-03-13 21:53:39,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:39,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1879611393, now seen corresponding path program 5 times [2025-03-13 21:53:39,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:39,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450027613] [2025-03-13 21:53:39,029 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:53:39,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:39,034 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-13 21:53:39,047 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:53:39,048 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:53:39,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:53:40,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:40,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450027613] [2025-03-13 21:53:40,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450027613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:40,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396676726] [2025-03-13 21:53:40,048 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:53:40,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:40,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:40,050 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:53:40,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:53:40,093 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-13 21:53:40,108 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:53:40,108 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:53:40,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:40,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-13 21:53:40,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:40,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-13 21:53:40,168 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-03-13 21:53:40,210 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 21:53:40,210 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 11 treesize of output 11 [2025-03-13 21:53:40,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-03-13 21:53:40,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:53:40,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:41,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:53:41,762 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 228 treesize of output 212 [2025-03-13 21:53:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:53:42,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396676726] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:42,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:42,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 40 [2025-03-13 21:53:42,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771158981] [2025-03-13 21:53:42,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:42,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-13 21:53:42,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:42,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-13 21:53:42,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1428, Unknown=0, NotChecked=0, Total=1640 [2025-03-13 21:53:42,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-13 21:53:42,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 442 transitions, 4566 flow. Second operand has 41 states, 41 states have (on average 6.536585365853658) internal successors, (268), 41 states have internal predecessors, (268), 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-03-13 21:53:42,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:42,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-13 21:53:42,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand