./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-more-multiply-verify.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 d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:36:06,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:36:06,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:36:06,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:36:06,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:36:06,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:36:06,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:36:06,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:36:06,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:36:06,440 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:36:06,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:36:06,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:36:06,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:36:06,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:36:06,441 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:36:06,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:36:06,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:36:06,442 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:36:06,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:36:06,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:36:06,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:36:06,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:36:06,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:36:06,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:36:06,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:36:06,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:36:06,442 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:36:06,442 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:36:06,442 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:36:06,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:36:06,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:36:06,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:36:06,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:36:06,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:36:06,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:36:06,443 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:36:06,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:36:06,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:36:06,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:36:06,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:36:06,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:36:06,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:36:06,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:36:06,443 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 -> d79cb5dae664e13779624ff0ffbc531b419f89e2c7510a92e890992a52ee7c98 [2025-03-08 17:36:06,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:36:06,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:36:06,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:36:06,664 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:36:06,665 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:36:06,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2025-03-08 17:36:07,817 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b89e2c576/da616d4faa204ad4a0140a062c97b4d4/FLAGfe5d2dfb7 [2025-03-08 17:36:08,075 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:36:08,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2025-03-08 17:36:08,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b89e2c576/da616d4faa204ad4a0140a062c97b4d4/FLAGfe5d2dfb7 [2025-03-08 17:36:08,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b89e2c576/da616d4faa204ad4a0140a062c97b4d4 [2025-03-08 17:36:08,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:36:08,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:36:08,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:36:08,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:36:08,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:36:08,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:36:08" (1/1) ... [2025-03-08 17:36:08,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ef7baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:08, skipping insertion in model container [2025-03-08 17:36:08,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:36:08" (1/1) ... [2025-03-08 17:36:08,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:36:08,556 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-more-multiply-verify.wvr.c[3081,3094] [2025-03-08 17:36:08,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:36:08,574 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:36:08,588 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-more-multiply-verify.wvr.c[3081,3094] [2025-03-08 17:36:08,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:36:08,600 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:36:08,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:08 WrapperNode [2025-03-08 17:36:08,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:36:08,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:36:08,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:36:08,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:36:08,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:08" (1/1) ... [2025-03-08 17:36:08,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:08" (1/1) ... [2025-03-08 17:36:08,631 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 162 [2025-03-08 17:36:08,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:36:08,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:36:08,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:36:08,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:36:08,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:08" (1/1) ... [2025-03-08 17:36:08,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:08" (1/1) ... [2025-03-08 17:36:08,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:08" (1/1) ... [2025-03-08 17:36:08,660 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-08 17:36:08,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:08" (1/1) ... [2025-03-08 17:36:08,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:08" (1/1) ... [2025-03-08 17:36:08,672 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:08" (1/1) ... [2025-03-08 17:36:08,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:08" (1/1) ... [2025-03-08 17:36:08,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:08" (1/1) ... [2025-03-08 17:36:08,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:08" (1/1) ... [2025-03-08 17:36:08,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:36:08,679 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:36:08,682 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:36:08,682 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:36:08,683 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:08" (1/1) ... [2025-03-08 17:36:08,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:36:08,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:36:08,706 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-08 17:36:08,708 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-08 17:36:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:36:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:36:08,726 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:36:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:36:08,726 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:36:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:36:08,726 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:36:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:36:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:36:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:36:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:36:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 17:36:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 17:36:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 17:36:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:36:08,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:36:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:36:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:36:08,728 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:36:08,810 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:36:08,811 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:36:09,017 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:36:09,018 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:36:09,183 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:36:09,183 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:36:09,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:36:09 BoogieIcfgContainer [2025-03-08 17:36:09,184 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:36:09,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:36:09,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:36:09,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:36:09,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:36:08" (1/3) ... [2025-03-08 17:36:09,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43257182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:36:09, skipping insertion in model container [2025-03-08 17:36:09,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:08" (2/3) ... [2025-03-08 17:36:09,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43257182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:36:09, skipping insertion in model container [2025-03-08 17:36:09,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:36:09" (3/3) ... [2025-03-08 17:36:09,192 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2025-03-08 17:36:09,203 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:36:09,204 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-multiply-verify.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 17:36:09,204 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:36:09,247 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:36:09,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 91 flow [2025-03-08 17:36:09,321 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-03-08 17:36:09,323 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:36:09,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 3/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-03-08 17:36:09,327 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 35 transitions, 91 flow [2025-03-08 17:36:09,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 31 transitions, 80 flow [2025-03-08 17:36:09,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:36:09,349 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;@4214a904, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:36:09,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:36:09,362 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:36:09,363 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-03-08 17:36:09,363 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:36:09,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:09,364 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-08 17:36:09,364 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:09,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:09,368 INFO L85 PathProgramCache]: Analyzing trace with hash -994515794, now seen corresponding path program 1 times [2025-03-08 17:36:09,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:09,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201400886] [2025-03-08 17:36:09,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:36:09,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:09,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:36:09,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:36:09,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:36:09,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:09,636 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-08 17:36:09,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:09,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201400886] [2025-03-08 17:36:09,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201400886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:36:09,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:36:09,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:36:09,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935167891] [2025-03-08 17:36:09,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:36:09,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:36:09,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:09,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:36:09,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:36:09,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:36:09,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:36:09,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:09,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:36:09,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:09,838 INFO L124 PetriNetUnfolderBase]: 466/750 cut-off events. [2025-03-08 17:36:09,838 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-03-08 17:36:09,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 750 events. 466/750 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3019 event pairs, 171 based on Foata normal form. 28/772 useless extension candidates. Maximal degree in co-relation 1442. Up to 532 conditions per place. [2025-03-08 17:36:09,849 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 39 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2025-03-08 17:36:09,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 200 flow [2025-03-08 17:36:09,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:36:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:36:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-08 17:36:09,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2025-03-08 17:36:09,861 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 80 flow. Second operand 3 states and 64 transitions. [2025-03-08 17:36:09,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 200 flow [2025-03-08 17:36:09,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 17:36:09,870 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 87 flow [2025-03-08 17:36:09,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2025-03-08 17:36:09,874 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2025-03-08 17:36:09,876 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 87 flow [2025-03-08 17:36:09,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:36:09,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:09,876 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-08 17:36:09,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:36:09,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:09,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:09,878 INFO L85 PathProgramCache]: Analyzing trace with hash 386452688, now seen corresponding path program 2 times [2025-03-08 17:36:09,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:09,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960351854] [2025-03-08 17:36:09,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:36:09,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:09,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:36:09,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:36:09,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:36:09,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:10,085 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-08 17:36:10,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:10,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960351854] [2025-03-08 17:36:10,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960351854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:36:10,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:36:10,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:36:10,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732572902] [2025-03-08 17:36:10,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:36:10,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:36:10,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:10,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:36:10,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:36:10,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:36:10,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-08 17:36:10,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:10,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:36:10,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:10,232 INFO L124 PetriNetUnfolderBase]: 587/970 cut-off events. [2025-03-08 17:36:10,232 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2025-03-08 17:36:10,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 970 events. 587/970 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4302 event pairs, 467 based on Foata normal form. 34/991 useless extension candidates. Maximal degree in co-relation 866. Up to 728 conditions per place. [2025-03-08 17:36:10,238 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 28 selfloop transitions, 2 changer transitions 15/49 dead transitions. [2025-03-08 17:36:10,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 212 flow [2025-03-08 17:36:10,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:36:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:36:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-03-08 17:36:10,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2025-03-08 17:36:10,240 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 87 flow. Second operand 4 states and 73 transitions. [2025-03-08 17:36:10,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 212 flow [2025-03-08 17:36:10,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 209 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:36:10,242 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 100 flow [2025-03-08 17:36:10,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-03-08 17:36:10,243 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2025-03-08 17:36:10,243 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 100 flow [2025-03-08 17:36:10,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-08 17:36:10,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:10,244 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-08 17:36:10,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:36:10,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:10,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1575825723, now seen corresponding path program 1 times [2025-03-08 17:36:10,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:10,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778996558] [2025-03-08 17:36:10,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:36:10,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:10,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:36:10,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:36:10,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:36:10,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:10,321 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-08 17:36:10,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:10,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778996558] [2025-03-08 17:36:10,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778996558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:36:10,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:36:10,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:36:10,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749484303] [2025-03-08 17:36:10,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:36:10,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:36:10,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:10,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:36:10,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:36:10,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:36:10,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-08 17:36:10,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:10,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:36:10,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:10,430 INFO L124 PetriNetUnfolderBase]: 304/517 cut-off events. [2025-03-08 17:36:10,430 INFO L125 PetriNetUnfolderBase]: For 118/122 co-relation queries the response was YES. [2025-03-08 17:36:10,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 517 events. 304/517 cut-off events. For 118/122 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1996 event pairs, 99 based on Foata normal form. 39/550 useless extension candidates. Maximal degree in co-relation 1148. Up to 197 conditions per place. [2025-03-08 17:36:10,433 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 44 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-03-08 17:36:10,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 240 flow [2025-03-08 17:36:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:36:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:36:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-03-08 17:36:10,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-08 17:36:10,434 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 100 flow. Second operand 4 states and 77 transitions. [2025-03-08 17:36:10,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 240 flow [2025-03-08 17:36:10,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 232 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-08 17:36:10,436 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 108 flow [2025-03-08 17:36:10,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2025-03-08 17:36:10,436 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2025-03-08 17:36:10,436 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 108 flow [2025-03-08 17:36:10,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-08 17:36:10,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:10,436 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-08 17:36:10,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:36:10,437 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:10,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:10,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1011553143, now seen corresponding path program 2 times [2025-03-08 17:36:10,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:10,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291530874] [2025-03-08 17:36:10,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:36:10,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:10,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 17:36:10,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-03-08 17:36:10,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:36:10,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:11,004 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-08 17:36:11,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:11,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291530874] [2025-03-08 17:36:11,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291530874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:36:11,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:36:11,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:36:11,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142546678] [2025-03-08 17:36:11,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:36:11,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:36:11,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:11,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:36:11,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:36:11,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:36:11,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 108 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:36:11,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:11,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:36:11,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:11,339 INFO L124 PetriNetUnfolderBase]: 548/921 cut-off events. [2025-03-08 17:36:11,339 INFO L125 PetriNetUnfolderBase]: For 427/427 co-relation queries the response was YES. [2025-03-08 17:36:11,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 921 events. 548/921 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4138 event pairs, 123 based on Foata normal form. 1/919 useless extension candidates. Maximal degree in co-relation 2156. Up to 341 conditions per place. [2025-03-08 17:36:11,344 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 62 selfloop transitions, 14 changer transitions 17/97 dead transitions. [2025-03-08 17:36:11,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 97 transitions, 467 flow [2025-03-08 17:36:11,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:36:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:36:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2025-03-08 17:36:11,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2025-03-08 17:36:11,345 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 108 flow. Second operand 8 states and 149 transitions. [2025-03-08 17:36:11,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 97 transitions, 467 flow [2025-03-08 17:36:11,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 97 transitions, 447 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-08 17:36:11,348 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 207 flow [2025-03-08 17:36:11,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=207, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2025-03-08 17:36:11,348 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2025-03-08 17:36:11,349 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 207 flow [2025-03-08 17:36:11,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:36:11,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:11,349 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-08 17:36:11,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:36:11,349 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:11,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:11,350 INFO L85 PathProgramCache]: Analyzing trace with hash -810646377, now seen corresponding path program 3 times [2025-03-08 17:36:11,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:11,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337841555] [2025-03-08 17:36:11,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:36:11,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:11,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-08 17:36:11,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-03-08 17:36:11,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:36:11,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:11,764 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-08 17:36:11,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:11,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337841555] [2025-03-08 17:36:11,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337841555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:36:11,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:36:11,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:36:11,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046994548] [2025-03-08 17:36:11,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:36:11,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:36:11,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:11,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:36:11,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:36:11,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:36:11,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 207 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:36:11,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:11,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:36:11,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:12,073 INFO L124 PetriNetUnfolderBase]: 742/1250 cut-off events. [2025-03-08 17:36:12,073 INFO L125 PetriNetUnfolderBase]: For 1221/1226 co-relation queries the response was YES. [2025-03-08 17:36:12,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3594 conditions, 1250 events. 742/1250 cut-off events. For 1221/1226 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6072 event pairs, 185 based on Foata normal form. 6/1254 useless extension candidates. Maximal degree in co-relation 3578. Up to 405 conditions per place. [2025-03-08 17:36:12,083 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 64 selfloop transitions, 21 changer transitions 17/106 dead transitions. [2025-03-08 17:36:12,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 106 transitions, 627 flow [2025-03-08 17:36:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:36:12,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:36:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2025-03-08 17:36:12,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2025-03-08 17:36:12,086 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 207 flow. Second operand 8 states and 148 transitions. [2025-03-08 17:36:12,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 106 transitions, 627 flow [2025-03-08 17:36:12,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 106 transitions, 599 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-08 17:36:12,095 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 355 flow [2025-03-08 17:36:12,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=355, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2025-03-08 17:36:12,095 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2025-03-08 17:36:12,096 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 355 flow [2025-03-08 17:36:12,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:36:12,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:12,097 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-08 17:36:12,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:36:12,097 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:12,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:12,097 INFO L85 PathProgramCache]: Analyzing trace with hash 239200147, now seen corresponding path program 4 times [2025-03-08 17:36:12,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:12,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801648721] [2025-03-08 17:36:12,098 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:36:12,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:12,106 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-08 17:36:12,112 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:36:12,112 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:36:12,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:12,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:12,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801648721] [2025-03-08 17:36:12,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801648721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:36:12,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819545786] [2025-03-08 17:36:12,213 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:36:12,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:12,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:36:12,215 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-08 17:36:12,217 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-08 17:36:12,265 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-08 17:36:12,285 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:36:12,285 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:36:12,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:12,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 17:36:12,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:36:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:12,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:36:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:12,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819545786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:36:12,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:36:12,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-08 17:36:12,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358719490] [2025-03-08 17:36:12,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:36:12,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:36:12,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:12,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:36:12,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:36:12,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:36:12,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 355 flow. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-08 17:36:12,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:12,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:36:12,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:12,627 INFO L124 PetriNetUnfolderBase]: 1343/2239 cut-off events. [2025-03-08 17:36:12,627 INFO L125 PetriNetUnfolderBase]: For 4167/4167 co-relation queries the response was YES. [2025-03-08 17:36:12,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7330 conditions, 2239 events. 1343/2239 cut-off events. For 4167/4167 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 12468 event pairs, 846 based on Foata normal form. 11/2243 useless extension candidates. Maximal degree in co-relation 7310. Up to 1070 conditions per place. [2025-03-08 17:36:12,639 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 51 selfloop transitions, 3 changer transitions 46/104 dead transitions. [2025-03-08 17:36:12,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 104 transitions, 873 flow [2025-03-08 17:36:12,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:36:12,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:36:12,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2025-03-08 17:36:12,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2025-03-08 17:36:12,640 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 355 flow. Second operand 5 states and 86 transitions. [2025-03-08 17:36:12,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 104 transitions, 873 flow [2025-03-08 17:36:12,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 104 transitions, 853 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-03-08 17:36:12,653 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 361 flow [2025-03-08 17:36:12,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=361, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2025-03-08 17:36:12,653 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2025-03-08 17:36:12,653 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 361 flow [2025-03-08 17:36:12,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-08 17:36:12,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:12,654 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:36:12,661 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-08 17:36:12,854 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-08 17:36:12,855 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:12,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash -581322612, now seen corresponding path program 5 times [2025-03-08 17:36:12,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:12,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695887815] [2025-03-08 17:36:12,856 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:36:12,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:12,865 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:36:12,892 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:36:12,893 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:36:12,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:14,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:14,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695887815] [2025-03-08 17:36:14,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695887815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:36:14,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701358696] [2025-03-08 17:36:14,157 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:36:14,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:14,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:36:14,159 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-08 17:36:14,161 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-08 17:36:14,205 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:36:14,224 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:36:14,224 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:36:14,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:14,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 17:36:14,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:36:14,296 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-08 17:36:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:14,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:36:15,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2025-03-08 17:36:15,233 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-03-08 17:36:15,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 145 treesize of output 129 [2025-03-08 17:36:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:15,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701358696] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:36:15,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:36:15,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2025-03-08 17:36:15,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636822851] [2025-03-08 17:36:15,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:36:15,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 17:36:15,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:15,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 17:36:15,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2025-03-08 17:36:15,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:36:15,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 361 flow. Second operand has 29 states, 29 states have (on average 9.482758620689655) internal successors, (275), 29 states have internal predecessors, (275), 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-08 17:36:15,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:15,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:36:15,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:18,494 INFO L124 PetriNetUnfolderBase]: 2750/4624 cut-off events. [2025-03-08 17:36:18,494 INFO L125 PetriNetUnfolderBase]: For 7559/7559 co-relation queries the response was YES. [2025-03-08 17:36:18,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14799 conditions, 4624 events. 2750/4624 cut-off events. For 7559/7559 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 29020 event pairs, 785 based on Foata normal form. 2/4619 useless extension candidates. Maximal degree in co-relation 14768. Up to 1276 conditions per place. [2025-03-08 17:36:18,522 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 221 selfloop transitions, 73 changer transitions 34/332 dead transitions. [2025-03-08 17:36:18,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 332 transitions, 2329 flow [2025-03-08 17:36:18,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 17:36:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-08 17:36:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 449 transitions. [2025-03-08 17:36:18,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47513227513227513 [2025-03-08 17:36:18,526 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 361 flow. Second operand 27 states and 449 transitions. [2025-03-08 17:36:18,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 332 transitions, 2329 flow [2025-03-08 17:36:18,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 332 transitions, 2309 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-08 17:36:18,552 INFO L231 Difference]: Finished difference. Result has 92 places, 129 transitions, 1233 flow [2025-03-08 17:36:18,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1233, PETRI_PLACES=92, PETRI_TRANSITIONS=129} [2025-03-08 17:36:18,553 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2025-03-08 17:36:18,553 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 129 transitions, 1233 flow [2025-03-08 17:36:18,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.482758620689655) internal successors, (275), 29 states have internal predecessors, (275), 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-08 17:36:18,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:18,553 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:36:18,563 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-08 17:36:18,758 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,SelfDestructingSolverStorable6 [2025-03-08 17:36:18,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:18,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:18,758 INFO L85 PathProgramCache]: Analyzing trace with hash -8273144, now seen corresponding path program 6 times [2025-03-08 17:36:18,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:18,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377759329] [2025-03-08 17:36:18,759 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:36:18,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:18,765 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:36:18,779 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-08 17:36:18,780 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 17:36:18,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:19,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:36:19,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:19,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377759329] [2025-03-08 17:36:19,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377759329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:36:19,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:36:19,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:36:19,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048165524] [2025-03-08 17:36:19,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:36:19,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:36:19,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:19,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:36:19,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:36:19,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:36:19,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 129 transitions, 1233 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:36:19,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:19,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:36:19,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:19,549 INFO L124 PetriNetUnfolderBase]: 2815/4756 cut-off events. [2025-03-08 17:36:19,549 INFO L125 PetriNetUnfolderBase]: For 13143/13143 co-relation queries the response was YES. [2025-03-08 17:36:19,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16791 conditions, 4756 events. 2815/4756 cut-off events. For 13143/13143 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 30331 event pairs, 703 based on Foata normal form. 2/4746 useless extension candidates. Maximal degree in co-relation 16745. Up to 1538 conditions per place. [2025-03-08 17:36:19,578 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 95 selfloop transitions, 68 changer transitions 18/185 dead transitions. [2025-03-08 17:36:19,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 185 transitions, 1791 flow [2025-03-08 17:36:19,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:36:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:36:19,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2025-03-08 17:36:19,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-03-08 17:36:19,581 INFO L175 Difference]: Start difference. First operand has 92 places, 129 transitions, 1233 flow. Second operand 8 states and 152 transitions. [2025-03-08 17:36:19,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 185 transitions, 1791 flow [2025-03-08 17:36:19,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 185 transitions, 1685 flow, removed 49 selfloop flow, removed 8 redundant places. [2025-03-08 17:36:19,626 INFO L231 Difference]: Finished difference. Result has 90 places, 131 transitions, 1317 flow [2025-03-08 17:36:19,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1317, PETRI_PLACES=90, PETRI_TRANSITIONS=131} [2025-03-08 17:36:19,627 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 52 predicate places. [2025-03-08 17:36:19,628 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 131 transitions, 1317 flow [2025-03-08 17:36:19,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:36:19,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:19,629 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:36:19,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:36:19,630 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:19,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:19,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1709147508, now seen corresponding path program 7 times [2025-03-08 17:36:19,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:19,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790373488] [2025-03-08 17:36:19,630 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:36:19,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:19,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 17:36:19,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:36:19,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:36:19,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:20,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:20,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790373488] [2025-03-08 17:36:20,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790373488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:36:20,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524486752] [2025-03-08 17:36:20,911 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:36:20,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:20,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:36:20,913 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-08 17:36:20,915 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-08 17:36:20,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 17:36:20,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:36:20,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:36:20,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:20,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 17:36:20,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:36:21,027 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-08 17:36:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:21,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:36:21,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2025-03-08 17:36:21,821 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-03-08 17:36:21,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 145 treesize of output 129 [2025-03-08 17:36:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:22,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524486752] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:36:22,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:36:22,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-03-08 17:36:22,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761368148] [2025-03-08 17:36:22,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:36:22,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 17:36:22,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:22,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 17:36:22,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-03-08 17:36:22,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:36:22,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 131 transitions, 1317 flow. Second operand has 30 states, 30 states have (on average 9.4) internal successors, (282), 30 states have internal predecessors, (282), 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-08 17:36:22,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:22,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:36:22,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:26,143 INFO L124 PetriNetUnfolderBase]: 3414/5893 cut-off events. [2025-03-08 17:36:26,144 INFO L125 PetriNetUnfolderBase]: For 20684/20718 co-relation queries the response was YES. [2025-03-08 17:36:26,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20817 conditions, 5893 events. 3414/5893 cut-off events. For 20684/20718 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 39920 event pairs, 911 based on Foata normal form. 36/5926 useless extension candidates. Maximal degree in co-relation 20765. Up to 1946 conditions per place. [2025-03-08 17:36:26,175 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 235 selfloop transitions, 98 changer transitions 34/371 dead transitions. [2025-03-08 17:36:26,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 371 transitions, 3027 flow [2025-03-08 17:36:26,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 17:36:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-08 17:36:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 518 transitions. [2025-03-08 17:36:26,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4625 [2025-03-08 17:36:26,179 INFO L175 Difference]: Start difference. First operand has 90 places, 131 transitions, 1317 flow. Second operand 32 states and 518 transitions. [2025-03-08 17:36:26,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 371 transitions, 3027 flow [2025-03-08 17:36:26,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 371 transitions, 2877 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-08 17:36:26,243 INFO L231 Difference]: Finished difference. Result has 123 places, 170 transitions, 1833 flow [2025-03-08 17:36:26,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1833, PETRI_PLACES=123, PETRI_TRANSITIONS=170} [2025-03-08 17:36:26,245 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 85 predicate places. [2025-03-08 17:36:26,245 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 170 transitions, 1833 flow [2025-03-08 17:36:26,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.4) internal successors, (282), 30 states have internal predecessors, (282), 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-08 17:36:26,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:26,246 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:36:26,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 17:36:26,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:26,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:26,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash -272771400, now seen corresponding path program 8 times [2025-03-08 17:36:26,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:26,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909061826] [2025-03-08 17:36:26,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:36:26,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:26,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 17:36:26,479 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-08 17:36:26,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:36:26,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:36:26,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:26,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909061826] [2025-03-08 17:36:26,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909061826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:36:26,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:36:26,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:36:26,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835449766] [2025-03-08 17:36:26,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:36:26,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:36:26,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:26,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:36:26,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:36:26,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:36:26,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 170 transitions, 1833 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:36:26,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:26,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:36:26,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:27,290 INFO L124 PetriNetUnfolderBase]: 3454/5970 cut-off events. [2025-03-08 17:36:27,290 INFO L125 PetriNetUnfolderBase]: For 26186/26215 co-relation queries the response was YES. [2025-03-08 17:36:27,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22504 conditions, 5970 events. 3454/5970 cut-off events. For 26186/26215 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 40217 event pairs, 1026 based on Foata normal form. 31/5998 useless extension candidates. Maximal degree in co-relation 22437. Up to 2549 conditions per place. [2025-03-08 17:36:27,330 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 125 selfloop transitions, 73 changer transitions 19/221 dead transitions. [2025-03-08 17:36:27,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 221 transitions, 2495 flow [2025-03-08 17:36:27,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:36:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:36:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2025-03-08 17:36:27,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5035714285714286 [2025-03-08 17:36:27,336 INFO L175 Difference]: Start difference. First operand has 123 places, 170 transitions, 1833 flow. Second operand 8 states and 141 transitions. [2025-03-08 17:36:27,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 221 transitions, 2495 flow [2025-03-08 17:36:27,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 221 transitions, 2394 flow, removed 44 selfloop flow, removed 9 redundant places. [2025-03-08 17:36:27,516 INFO L231 Difference]: Finished difference. Result has 121 places, 173 transitions, 1945 flow [2025-03-08 17:36:27,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1945, PETRI_PLACES=121, PETRI_TRANSITIONS=173} [2025-03-08 17:36:27,517 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 83 predicate places. [2025-03-08 17:36:27,517 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 173 transitions, 1945 flow [2025-03-08 17:36:27,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:36:27,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:27,517 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:36:27,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:36:27,517 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:27,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:27,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2141977109, now seen corresponding path program 1 times [2025-03-08 17:36:27,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:27,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214752432] [2025-03-08 17:36:27,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:36:27,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:27,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:36:27,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:36:27,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:36:27,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:27,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:36:27,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:27,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214752432] [2025-03-08 17:36:27,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214752432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:36:27,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:36:27,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:36:27,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447309975] [2025-03-08 17:36:27,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:36:27,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:36:27,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:27,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:36:27,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:36:27,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-03-08 17:36:27,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 173 transitions, 1945 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-08 17:36:27,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:27,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-03-08 17:36:27,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:28,269 INFO L124 PetriNetUnfolderBase]: 5763/9234 cut-off events. [2025-03-08 17:36:28,270 INFO L125 PetriNetUnfolderBase]: For 43213/43213 co-relation queries the response was YES. [2025-03-08 17:36:28,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34742 conditions, 9234 events. 5763/9234 cut-off events. For 43213/43213 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 59790 event pairs, 825 based on Foata normal form. 0/8303 useless extension candidates. Maximal degree in co-relation 34681. Up to 4969 conditions per place. [2025-03-08 17:36:28,314 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 286 selfloop transitions, 43 changer transitions 7/338 dead transitions. [2025-03-08 17:36:28,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 338 transitions, 4480 flow [2025-03-08 17:36:28,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:36:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:36:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2025-03-08 17:36:28,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-03-08 17:36:28,316 INFO L175 Difference]: Start difference. First operand has 121 places, 173 transitions, 1945 flow. Second operand 7 states and 134 transitions. [2025-03-08 17:36:28,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 338 transitions, 4480 flow [2025-03-08 17:36:28,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 338 transitions, 4179 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-08 17:36:28,531 INFO L231 Difference]: Finished difference. Result has 124 places, 198 transitions, 2245 flow [2025-03-08 17:36:28,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1782, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2245, PETRI_PLACES=124, PETRI_TRANSITIONS=198} [2025-03-08 17:36:28,532 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 86 predicate places. [2025-03-08 17:36:28,532 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 198 transitions, 2245 flow [2025-03-08 17:36:28,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-08 17:36:28,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:28,532 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:36:28,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:36:28,532 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:28,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:28,533 INFO L85 PathProgramCache]: Analyzing trace with hash -718200215, now seen corresponding path program 2 times [2025-03-08 17:36:28,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:28,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496875555] [2025-03-08 17:36:28,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:36:28,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:28,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:36:28,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-03-08 17:36:28,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:36:28,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:36:28,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:28,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496875555] [2025-03-08 17:36:28,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496875555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:36:28,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:36:28,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:36:28,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296846497] [2025-03-08 17:36:28,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:36:28,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:36:28,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:28,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:36:28,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:36:28,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-03-08 17:36:28,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 198 transitions, 2245 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-08 17:36:28,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:28,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-03-08 17:36:28,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:29,408 INFO L124 PetriNetUnfolderBase]: 5937/9541 cut-off events. [2025-03-08 17:36:29,408 INFO L125 PetriNetUnfolderBase]: For 44617/44617 co-relation queries the response was YES. [2025-03-08 17:36:29,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40924 conditions, 9541 events. 5937/9541 cut-off events. For 44617/44617 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 62043 event pairs, 2945 based on Foata normal form. 40/9580 useless extension candidates. Maximal degree in co-relation 40042. Up to 7040 conditions per place. [2025-03-08 17:36:29,458 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 228 selfloop transitions, 41 changer transitions 8/279 dead transitions. [2025-03-08 17:36:29,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 279 transitions, 3637 flow [2025-03-08 17:36:29,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:36:29,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:36:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2025-03-08 17:36:29,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-03-08 17:36:29,462 INFO L175 Difference]: Start difference. First operand has 124 places, 198 transitions, 2245 flow. Second operand 5 states and 90 transitions. [2025-03-08 17:36:29,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 279 transitions, 3637 flow [2025-03-08 17:36:29,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 279 transitions, 3637 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:36:29,725 INFO L231 Difference]: Finished difference. Result has 131 places, 207 transitions, 2484 flow [2025-03-08 17:36:29,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2245, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2484, PETRI_PLACES=131, PETRI_TRANSITIONS=207} [2025-03-08 17:36:29,726 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 93 predicate places. [2025-03-08 17:36:29,726 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 207 transitions, 2484 flow [2025-03-08 17:36:29,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-08 17:36:29,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:29,726 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:36:29,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 17:36:29,726 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:29,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash -847355128, now seen corresponding path program 1 times [2025-03-08 17:36:29,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:29,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158669683] [2025-03-08 17:36:29,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:36:29,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:29,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:36:29,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:36:29,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:36:29,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:36:29,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:29,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158669683] [2025-03-08 17:36:29,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158669683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:36:29,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:36:29,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:36:29,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213630725] [2025-03-08 17:36:29,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:36:29,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:36:29,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:29,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:36:29,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:36:29,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-03-08 17:36:29,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 207 transitions, 2484 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-08 17:36:29,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:29,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-03-08 17:36:29,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:30,646 INFO L124 PetriNetUnfolderBase]: 5119/8250 cut-off events. [2025-03-08 17:36:30,646 INFO L125 PetriNetUnfolderBase]: For 45746/45746 co-relation queries the response was YES. [2025-03-08 17:36:30,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37975 conditions, 8250 events. 5119/8250 cut-off events. For 45746/45746 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 52655 event pairs, 1930 based on Foata normal form. 165/8414 useless extension candidates. Maximal degree in co-relation 37536. Up to 4689 conditions per place. [2025-03-08 17:36:30,711 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 193 selfloop transitions, 27 changer transitions 31/253 dead transitions. [2025-03-08 17:36:30,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 253 transitions, 3420 flow [2025-03-08 17:36:30,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:36:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:36:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-03-08 17:36:30,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5485714285714286 [2025-03-08 17:36:30,712 INFO L175 Difference]: Start difference. First operand has 131 places, 207 transitions, 2484 flow. Second operand 5 states and 96 transitions. [2025-03-08 17:36:30,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 253 transitions, 3420 flow [2025-03-08 17:36:30,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 253 transitions, 3326 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-08 17:36:31,002 INFO L231 Difference]: Finished difference. Result has 130 places, 177 transitions, 2076 flow [2025-03-08 17:36:31,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2285, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2076, PETRI_PLACES=130, PETRI_TRANSITIONS=177} [2025-03-08 17:36:31,002 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 92 predicate places. [2025-03-08 17:36:31,002 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 177 transitions, 2076 flow [2025-03-08 17:36:31,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-08 17:36:31,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:31,002 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:36:31,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 17:36:31,003 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:31,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:31,003 INFO L85 PathProgramCache]: Analyzing trace with hash 882399051, now seen corresponding path program 3 times [2025-03-08 17:36:31,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:31,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417529769] [2025-03-08 17:36:31,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:36:31,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:31,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:36:31,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:36:31,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:36:31,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:36:31,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:31,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417529769] [2025-03-08 17:36:31,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417529769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:36:31,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:36:31,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:36:31,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374989806] [2025-03-08 17:36:31,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:36:31,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:36:31,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:31,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:36:31,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:36:31,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-03-08 17:36:31,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 177 transitions, 2076 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-08 17:36:31,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:31,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-03-08 17:36:31,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:31,749 INFO L124 PetriNetUnfolderBase]: 4809/7715 cut-off events. [2025-03-08 17:36:31,750 INFO L125 PetriNetUnfolderBase]: For 43531/43531 co-relation queries the response was YES. [2025-03-08 17:36:31,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35307 conditions, 7715 events. 4809/7715 cut-off events. For 43531/43531 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 47631 event pairs, 2119 based on Foata normal form. 146/7860 useless extension candidates. Maximal degree in co-relation 34851. Up to 4874 conditions per place. [2025-03-08 17:36:31,794 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 189 selfloop transitions, 35 changer transitions 5/231 dead transitions. [2025-03-08 17:36:31,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 231 transitions, 3087 flow [2025-03-08 17:36:31,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:36:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:36:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-03-08 17:36:31,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-08 17:36:31,795 INFO L175 Difference]: Start difference. First operand has 130 places, 177 transitions, 2076 flow. Second operand 4 states and 77 transitions. [2025-03-08 17:36:31,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 231 transitions, 3087 flow [2025-03-08 17:36:31,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 231 transitions, 2912 flow, removed 24 selfloop flow, removed 6 redundant places. [2025-03-08 17:36:31,960 INFO L231 Difference]: Finished difference. Result has 126 places, 171 transitions, 1936 flow [2025-03-08 17:36:31,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1864, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1936, PETRI_PLACES=126, PETRI_TRANSITIONS=171} [2025-03-08 17:36:31,960 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 88 predicate places. [2025-03-08 17:36:31,960 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 171 transitions, 1936 flow [2025-03-08 17:36:31,961 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-08 17:36:31,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:31,961 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:36:31,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 17:36:31,961 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:31,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:31,961 INFO L85 PathProgramCache]: Analyzing trace with hash -336980145, now seen corresponding path program 4 times [2025-03-08 17:36:31,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:31,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382851980] [2025-03-08 17:36:31,961 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:36:31,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:31,965 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:36:31,970 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:36:31,970 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:36:31,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:36:32,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:32,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382851980] [2025-03-08 17:36:32,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382851980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:36:32,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:36:32,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:36:32,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342189606] [2025-03-08 17:36:32,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:36:32,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:36:32,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:32,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:36:32,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:36:32,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-03-08 17:36:32,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 171 transitions, 1936 flow. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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-08 17:36:32,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:32,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-03-08 17:36:32,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:32,803 INFO L124 PetriNetUnfolderBase]: 5037/8050 cut-off events. [2025-03-08 17:36:32,803 INFO L125 PetriNetUnfolderBase]: For 43002/43002 co-relation queries the response was YES. [2025-03-08 17:36:32,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38097 conditions, 8050 events. 5037/8050 cut-off events. For 43002/43002 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 50044 event pairs, 1198 based on Foata normal form. 40/8089 useless extension candidates. Maximal degree in co-relation 37701. Up to 2978 conditions per place. [2025-03-08 17:36:32,842 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 218 selfloop transitions, 68 changer transitions 3/291 dead transitions. [2025-03-08 17:36:32,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 291 transitions, 3745 flow [2025-03-08 17:36:32,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:36:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:36:32,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2025-03-08 17:36:32,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2025-03-08 17:36:32,843 INFO L175 Difference]: Start difference. First operand has 126 places, 171 transitions, 1936 flow. Second operand 8 states and 128 transitions. [2025-03-08 17:36:32,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 291 transitions, 3745 flow [2025-03-08 17:36:32,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 291 transitions, 3662 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-08 17:36:32,985 INFO L231 Difference]: Finished difference. Result has 130 places, 199 transitions, 2419 flow [2025-03-08 17:36:32,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2419, PETRI_PLACES=130, PETRI_TRANSITIONS=199} [2025-03-08 17:36:32,986 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 92 predicate places. [2025-03-08 17:36:32,986 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 199 transitions, 2419 flow [2025-03-08 17:36:32,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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-08 17:36:32,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:32,986 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:36:32,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 17:36:32,986 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:32,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:32,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1026019527, now seen corresponding path program 5 times [2025-03-08 17:36:32,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:32,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812696057] [2025-03-08 17:36:32,987 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:36:32,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:32,993 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:36:32,997 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:36:32,997 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:36:32,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:33,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:36:33,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:33,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812696057] [2025-03-08 17:36:33,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812696057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:36:33,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:36:33,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:36:33,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187877349] [2025-03-08 17:36:33,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:36:33,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:36:33,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:33,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:36:33,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:36:33,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2025-03-08 17:36:33,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 199 transitions, 2419 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-08 17:36:33,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:33,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2025-03-08 17:36:33,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:33,543 INFO L124 PetriNetUnfolderBase]: 4449/7124 cut-off events. [2025-03-08 17:36:33,543 INFO L125 PetriNetUnfolderBase]: For 41451/41451 co-relation queries the response was YES. [2025-03-08 17:36:33,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35355 conditions, 7124 events. 4449/7124 cut-off events. For 41451/41451 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 42350 event pairs, 1587 based on Foata normal form. 64/7187 useless extension candidates. Maximal degree in co-relation 34873. Up to 3609 conditions per place. [2025-03-08 17:36:33,584 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 166 selfloop transitions, 40 changer transitions 12/220 dead transitions. [2025-03-08 17:36:33,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 220 transitions, 2955 flow [2025-03-08 17:36:33,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:36:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:36:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-08 17:36:33,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-08 17:36:33,585 INFO L175 Difference]: Start difference. First operand has 130 places, 199 transitions, 2419 flow. Second operand 4 states and 80 transitions. [2025-03-08 17:36:33,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 220 transitions, 2955 flow [2025-03-08 17:36:33,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 220 transitions, 2897 flow, removed 21 selfloop flow, removed 3 redundant places. [2025-03-08 17:36:33,749 INFO L231 Difference]: Finished difference. Result has 131 places, 178 transitions, 2156 flow [2025-03-08 17:36:33,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2268, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2156, PETRI_PLACES=131, PETRI_TRANSITIONS=178} [2025-03-08 17:36:33,750 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 93 predicate places. [2025-03-08 17:36:33,750 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 178 transitions, 2156 flow [2025-03-08 17:36:33,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-08 17:36:33,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:33,750 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 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-08 17:36:33,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 17:36:33,750 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:33,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:33,750 INFO L85 PathProgramCache]: Analyzing trace with hash -357089526, now seen corresponding path program 9 times [2025-03-08 17:36:33,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:33,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637486216] [2025-03-08 17:36:33,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:36:33,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:33,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-08 17:36:33,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-03-08 17:36:33,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:36:33,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 17:36:33,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:33,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637486216] [2025-03-08 17:36:33,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637486216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:36:33,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:36:33,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:36:33,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286770894] [2025-03-08 17:36:33,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:36:33,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:36:33,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:33,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:36:33,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:36:33,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:36:33,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 178 transitions, 2156 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:36:33,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:33,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:36:33,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:34,632 INFO L124 PetriNetUnfolderBase]: 3377/5827 cut-off events. [2025-03-08 17:36:34,632 INFO L125 PetriNetUnfolderBase]: For 35822/35983 co-relation queries the response was YES. [2025-03-08 17:36:34,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28548 conditions, 5827 events. 3377/5827 cut-off events. For 35822/35983 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 38418 event pairs, 1078 based on Foata normal form. 5/5737 useless extension candidates. Maximal degree in co-relation 28232. Up to 2379 conditions per place. [2025-03-08 17:36:34,680 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 134 selfloop transitions, 51 changer transitions 31/232 dead transitions. [2025-03-08 17:36:34,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 232 transitions, 2872 flow [2025-03-08 17:36:34,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:36:34,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:36:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2025-03-08 17:36:34,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2025-03-08 17:36:34,681 INFO L175 Difference]: Start difference. First operand has 131 places, 178 transitions, 2156 flow. Second operand 8 states and 142 transitions. [2025-03-08 17:36:34,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 232 transitions, 2872 flow [2025-03-08 17:36:34,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 232 transitions, 2751 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-08 17:36:34,783 INFO L231 Difference]: Finished difference. Result has 131 places, 174 transitions, 2104 flow [2025-03-08 17:36:34,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2104, PETRI_PLACES=131, PETRI_TRANSITIONS=174} [2025-03-08 17:36:34,783 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 93 predicate places. [2025-03-08 17:36:34,784 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 174 transitions, 2104 flow [2025-03-08 17:36:34,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:36:34,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:34,784 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 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-08 17:36:34,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 17:36:34,784 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:34,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:34,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1784183806, now seen corresponding path program 10 times [2025-03-08 17:36:34,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:34,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643880518] [2025-03-08 17:36:34,785 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:36:34,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:34,791 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-08 17:36:34,819 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 17:36:34,819 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:36:34,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:39,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:39,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643880518] [2025-03-08 17:36:39,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643880518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:36:39,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544334349] [2025-03-08 17:36:39,384 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:36:39,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:39,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:36:39,386 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:36:39,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 17:36:39,429 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-08 17:36:39,446 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 17:36:39,447 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:36:39,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:39,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 17:36:39,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:36:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:36:39,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:36:39,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:36:39,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 60 [2025-03-08 17:36:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 17:36:40,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544334349] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:36:40,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:36:40,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15, 12] total 31 [2025-03-08 17:36:40,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351223195] [2025-03-08 17:36:40,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:36:40,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:36:40,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:40,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:36:40,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2025-03-08 17:36:40,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:36:40,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 174 transitions, 2104 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:36:40,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:40,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:36:40,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:40,658 INFO L124 PetriNetUnfolderBase]: 3296/5680 cut-off events. [2025-03-08 17:36:40,658 INFO L125 PetriNetUnfolderBase]: For 34575/34726 co-relation queries the response was YES. [2025-03-08 17:36:40,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27825 conditions, 5680 events. 3296/5680 cut-off events. For 34575/34726 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 37172 event pairs, 1015 based on Foata normal form. 29/5643 useless extension candidates. Maximal degree in co-relation 27776. Up to 2342 conditions per place. [2025-03-08 17:36:40,691 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 112 selfloop transitions, 68 changer transitions 28/224 dead transitions. [2025-03-08 17:36:40,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 224 transitions, 2784 flow [2025-03-08 17:36:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:36:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:36:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2025-03-08 17:36:40,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-08 17:36:40,692 INFO L175 Difference]: Start difference. First operand has 131 places, 174 transitions, 2104 flow. Second operand 8 states and 140 transitions. [2025-03-08 17:36:40,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 224 transitions, 2784 flow [2025-03-08 17:36:40,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 224 transitions, 2668 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-03-08 17:36:40,758 INFO L231 Difference]: Finished difference. Result has 127 places, 166 transitions, 2036 flow [2025-03-08 17:36:40,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1992, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2036, PETRI_PLACES=127, PETRI_TRANSITIONS=166} [2025-03-08 17:36:40,758 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 89 predicate places. [2025-03-08 17:36:40,758 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 166 transitions, 2036 flow [2025-03-08 17:36:40,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-08 17:36:40,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:40,758 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:36:40,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 17:36:40,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 17:36:40,959 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:40,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:40,959 INFO L85 PathProgramCache]: Analyzing trace with hash 144310257, now seen corresponding path program 1 times [2025-03-08 17:36:40,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:40,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520741015] [2025-03-08 17:36:40,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:36:40,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:40,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 17:36:40,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 17:36:40,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:36:40,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:41,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:41,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520741015] [2025-03-08 17:36:41,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520741015] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:36:41,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562699767] [2025-03-08 17:36:41,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:36:41,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:41,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:36:41,965 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:36:41,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 17:36:42,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 17:36:42,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 17:36:42,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:36:42,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:42,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 17:36:42,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:36:42,097 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-08 17:36:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:42,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:36:43,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2025-03-08 17:36:43,314 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-03-08 17:36:43,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 144 [2025-03-08 17:36:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:43,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562699767] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:36:43,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:36:43,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2025-03-08 17:36:43,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65943504] [2025-03-08 17:36:43,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:36:43,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 17:36:43,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:43,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 17:36:43,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1199, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 17:36:43,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:36:43,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 166 transitions, 2036 flow. Second operand has 38 states, 38 states have (on average 9.210526315789474) internal successors, (350), 38 states have internal predecessors, (350), 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-08 17:36:43,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:43,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:36:43,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:48,830 INFO L124 PetriNetUnfolderBase]: 4404/7546 cut-off events. [2025-03-08 17:36:48,830 INFO L125 PetriNetUnfolderBase]: For 45726/45990 co-relation queries the response was YES. [2025-03-08 17:36:48,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36313 conditions, 7546 events. 4404/7546 cut-off events. For 45726/45990 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 51308 event pairs, 1185 based on Foata normal form. 32/7471 useless extension candidates. Maximal degree in co-relation 36262. Up to 1348 conditions per place. [2025-03-08 17:36:48,883 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 360 selfloop transitions, 106 changer transitions 54/536 dead transitions. [2025-03-08 17:36:48,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 536 transitions, 5512 flow [2025-03-08 17:36:48,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-08 17:36:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-03-08 17:36:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 652 transitions. [2025-03-08 17:36:48,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4543554006968641 [2025-03-08 17:36:48,885 INFO L175 Difference]: Start difference. First operand has 127 places, 166 transitions, 2036 flow. Second operand 41 states and 652 transitions. [2025-03-08 17:36:48,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 536 transitions, 5512 flow [2025-03-08 17:36:48,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 536 transitions, 5332 flow, removed 14 selfloop flow, removed 9 redundant places. [2025-03-08 17:36:48,976 INFO L231 Difference]: Finished difference. Result has 167 places, 214 transitions, 2676 flow [2025-03-08 17:36:48,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=2676, PETRI_PLACES=167, PETRI_TRANSITIONS=214} [2025-03-08 17:36:48,977 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 129 predicate places. [2025-03-08 17:36:48,977 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 214 transitions, 2676 flow [2025-03-08 17:36:48,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 9.210526315789474) internal successors, (350), 38 states have internal predecessors, (350), 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-08 17:36:48,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:48,977 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:36:48,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 17:36:49,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:49,177 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:49,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:49,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1958595935, now seen corresponding path program 2 times [2025-03-08 17:36:49,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:49,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254258041] [2025-03-08 17:36:49,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:36:49,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:49,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-08 17:36:49,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 17:36:49,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:36:49,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:49,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:49,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254258041] [2025-03-08 17:36:49,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254258041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:36:49,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124727548] [2025-03-08 17:36:49,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:36:49,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:49,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:36:49,773 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:36:49,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 17:36:49,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-08 17:36:49,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 17:36:49,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:36:49,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:49,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 17:36:49,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:36:49,873 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-08 17:36:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:50,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:36:50,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2025-03-08 17:36:50,847 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-03-08 17:36:50,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 134 [2025-03-08 17:36:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:51,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124727548] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:36:51,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:36:51,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2025-03-08 17:36:51,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48306939] [2025-03-08 17:36:51,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:36:51,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 17:36:51,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:36:51,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 17:36:51,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 17:36:51,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:36:51,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 214 transitions, 2676 flow. Second operand has 35 states, 35 states have (on average 9.371428571428572) internal successors, (328), 35 states have internal predecessors, (328), 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-08 17:36:51,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:36:51,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:36:51,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:36:57,620 INFO L124 PetriNetUnfolderBase]: 6208/10522 cut-off events. [2025-03-08 17:36:57,620 INFO L125 PetriNetUnfolderBase]: For 79678/80070 co-relation queries the response was YES. [2025-03-08 17:36:57,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54550 conditions, 10522 events. 6208/10522 cut-off events. For 79678/80070 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 74179 event pairs, 1383 based on Foata normal form. 41/10395 useless extension candidates. Maximal degree in co-relation 54480. Up to 2015 conditions per place. [2025-03-08 17:36:57,707 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 442 selfloop transitions, 159 changer transitions 51/668 dead transitions. [2025-03-08 17:36:57,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 668 transitions, 7381 flow [2025-03-08 17:36:57,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-08 17:36:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-03-08 17:36:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 768 transitions. [2025-03-08 17:36:57,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4668693009118541 [2025-03-08 17:36:57,709 INFO L175 Difference]: Start difference. First operand has 167 places, 214 transitions, 2676 flow. Second operand 47 states and 768 transitions. [2025-03-08 17:36:57,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 668 transitions, 7381 flow [2025-03-08 17:36:57,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 668 transitions, 7019 flow, removed 129 selfloop flow, removed 21 redundant places. [2025-03-08 17:36:57,982 INFO L231 Difference]: Finished difference. Result has 203 places, 281 transitions, 3898 flow [2025-03-08 17:36:57,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2426, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=3898, PETRI_PLACES=203, PETRI_TRANSITIONS=281} [2025-03-08 17:36:57,982 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 165 predicate places. [2025-03-08 17:36:57,982 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 281 transitions, 3898 flow [2025-03-08 17:36:57,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.371428571428572) internal successors, (328), 35 states have internal predecessors, (328), 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-08 17:36:57,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:36:57,983 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:36:57,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 17:36:58,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:58,183 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:36:58,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:36:58,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1836147287, now seen corresponding path program 3 times [2025-03-08 17:36:58,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:36:58,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035747691] [2025-03-08 17:36:58,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:36:58,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:36:58,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-03-08 17:36:58,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 17:36:58,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:36:58,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:58,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:36:58,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035747691] [2025-03-08 17:36:58,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035747691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:36:58,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104837607] [2025-03-08 17:36:58,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:36:58,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:36:58,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:36:58,790 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:36:58,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 17:36:58,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-03-08 17:36:58,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 17:36:58,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:36:58,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:36:58,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 17:36:58,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:36:58,907 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-08 17:36:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:36:59,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:37:00,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2025-03-08 17:37:00,386 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-03-08 17:37:00,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 147 [2025-03-08 17:37:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:01,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104837607] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:37:01,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:37:01,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2025-03-08 17:37:01,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523876805] [2025-03-08 17:37:01,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:37:01,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 17:37:01,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:01,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 17:37:01,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 17:37:01,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:37:01,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 281 transitions, 3898 flow. Second operand has 38 states, 38 states have (on average 9.210526315789474) internal successors, (350), 38 states have internal predecessors, (350), 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-08 17:37:01,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:01,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:37:01,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:04,258 INFO L124 PetriNetUnfolderBase]: 6487/11040 cut-off events. [2025-03-08 17:37:04,259 INFO L125 PetriNetUnfolderBase]: For 90845/91291 co-relation queries the response was YES. [2025-03-08 17:37:04,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58625 conditions, 11040 events. 6487/11040 cut-off events. For 90845/91291 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 79233 event pairs, 2583 based on Foata normal form. 66/10939 useless extension candidates. Maximal degree in co-relation 58528. Up to 5069 conditions per place. [2025-03-08 17:37:04,339 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 339 selfloop transitions, 57 changer transitions 17/429 dead transitions. [2025-03-08 17:37:04,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 429 transitions, 5592 flow [2025-03-08 17:37:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 17:37:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-08 17:37:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 295 transitions. [2025-03-08 17:37:04,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2025-03-08 17:37:04,341 INFO L175 Difference]: Start difference. First operand has 203 places, 281 transitions, 3898 flow. Second operand 18 states and 295 transitions. [2025-03-08 17:37:04,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 429 transitions, 5592 flow [2025-03-08 17:37:04,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 429 transitions, 5075 flow, removed 207 selfloop flow, removed 20 redundant places. [2025-03-08 17:37:04,688 INFO L231 Difference]: Finished difference. Result has 199 places, 289 transitions, 3667 flow [2025-03-08 17:37:04,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3431, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3667, PETRI_PLACES=199, PETRI_TRANSITIONS=289} [2025-03-08 17:37:04,688 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 161 predicate places. [2025-03-08 17:37:04,688 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 289 transitions, 3667 flow [2025-03-08 17:37:04,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 9.210526315789474) internal successors, (350), 38 states have internal predecessors, (350), 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-08 17:37:04,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:04,688 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:37:04,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 17:37:04,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:37:04,889 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:37:04,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:04,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2068442959, now seen corresponding path program 4 times [2025-03-08 17:37:04,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:04,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403862311] [2025-03-08 17:37:04,890 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:37:04,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:04,896 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-08 17:37:04,909 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 17:37:04,912 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:37:04,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:05,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403862311] [2025-03-08 17:37:05,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403862311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:37:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048698523] [2025-03-08 17:37:05,950 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:37:05,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:37:05,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:37:05,952 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:37:05,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 17:37:05,994 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-08 17:37:06,019 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 17:37:06,020 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:37:06,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:06,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 17:37:06,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:37:06,064 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-08 17:37:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:06,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:37:06,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2025-03-08 17:37:06,942 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-03-08 17:37:06,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 138 [2025-03-08 17:37:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:07,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048698523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:37:07,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:37:07,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-03-08 17:37:07,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583915027] [2025-03-08 17:37:07,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:37:07,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 17:37:07,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:07,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 17:37:07,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 17:37:07,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:37:07,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 289 transitions, 3667 flow. Second operand has 37 states, 37 states have (on average 9.27027027027027) internal successors, (343), 37 states have internal predecessors, (343), 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-08 17:37:07,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:07,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:37:07,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:10,974 INFO L124 PetriNetUnfolderBase]: 7273/12485 cut-off events. [2025-03-08 17:37:10,974 INFO L125 PetriNetUnfolderBase]: For 75316/75790 co-relation queries the response was YES. [2025-03-08 17:37:11,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60860 conditions, 12485 events. 7273/12485 cut-off events. For 75316/75790 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 90117 event pairs, 1660 based on Foata normal form. 49/12350 useless extension candidates. Maximal degree in co-relation 60766. Up to 2230 conditions per place. [2025-03-08 17:37:11,056 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 436 selfloop transitions, 172 changer transitions 66/690 dead transitions. [2025-03-08 17:37:11,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 690 transitions, 7580 flow [2025-03-08 17:37:11,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-08 17:37:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-08 17:37:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 744 transitions. [2025-03-08 17:37:11,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.462111801242236 [2025-03-08 17:37:11,058 INFO L175 Difference]: Start difference. First operand has 199 places, 289 transitions, 3667 flow. Second operand 46 states and 744 transitions. [2025-03-08 17:37:11,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 690 transitions, 7580 flow [2025-03-08 17:37:11,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 690 transitions, 7487 flow, removed 7 selfloop flow, removed 10 redundant places. [2025-03-08 17:37:11,362 INFO L231 Difference]: Finished difference. Result has 245 places, 314 transitions, 4297 flow [2025-03-08 17:37:11,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3592, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=4297, PETRI_PLACES=245, PETRI_TRANSITIONS=314} [2025-03-08 17:37:11,363 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 207 predicate places. [2025-03-08 17:37:11,363 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 314 transitions, 4297 flow [2025-03-08 17:37:11,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 9.27027027027027) internal successors, (343), 37 states have internal predecessors, (343), 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-08 17:37:11,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:11,363 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:37:11,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 17:37:11,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 17:37:11,564 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:37:11,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:11,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1065766943, now seen corresponding path program 5 times [2025-03-08 17:37:11,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:11,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248203616] [2025-03-08 17:37:11,565 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:37:11,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:11,570 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-08 17:37:11,580 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 17:37:11,580 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:37:11,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:12,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:12,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248203616] [2025-03-08 17:37:12,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248203616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:37:12,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034816751] [2025-03-08 17:37:12,645 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:37:12,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:37:12,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:37:12,647 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:37:12,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 17:37:12,699 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-08 17:37:12,720 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 17:37:12,720 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:37:12,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:12,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 17:37:12,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:37:12,786 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-08 17:37:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:13,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:37:13,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2025-03-08 17:37:14,020 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-03-08 17:37:14,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 138 [2025-03-08 17:37:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:14,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034816751] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:37:14,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:37:14,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2025-03-08 17:37:14,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357717683] [2025-03-08 17:37:14,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:37:14,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 17:37:14,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:14,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 17:37:14,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 17:37:14,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:37:14,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 314 transitions, 4297 flow. Second operand has 36 states, 36 states have (on average 9.333333333333334) internal successors, (336), 36 states have internal predecessors, (336), 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-08 17:37:14,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:14,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:37:14,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:22,732 INFO L124 PetriNetUnfolderBase]: 7410/12739 cut-off events. [2025-03-08 17:37:22,732 INFO L125 PetriNetUnfolderBase]: For 89138/89630 co-relation queries the response was YES. [2025-03-08 17:37:22,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64698 conditions, 12739 events. 7410/12739 cut-off events. For 89138/89630 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 93228 event pairs, 1710 based on Foata normal form. 73/12626 useless extension candidates. Maximal degree in co-relation 64573. Up to 2252 conditions per place. [2025-03-08 17:37:22,823 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 390 selfloop transitions, 166 changer transitions 34/606 dead transitions. [2025-03-08 17:37:22,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 606 transitions, 7345 flow [2025-03-08 17:37:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 17:37:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-08 17:37:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 562 transitions. [2025-03-08 17:37:22,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4722689075630252 [2025-03-08 17:37:22,825 INFO L175 Difference]: Start difference. First operand has 245 places, 314 transitions, 4297 flow. Second operand 34 states and 562 transitions. [2025-03-08 17:37:22,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 606 transitions, 7345 flow [2025-03-08 17:37:23,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 606 transitions, 7046 flow, removed 51 selfloop flow, removed 32 redundant places. [2025-03-08 17:37:23,199 INFO L231 Difference]: Finished difference. Result has 246 places, 324 transitions, 4586 flow [2025-03-08 17:37:23,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4052, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=4586, PETRI_PLACES=246, PETRI_TRANSITIONS=324} [2025-03-08 17:37:23,199 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 208 predicate places. [2025-03-08 17:37:23,199 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 324 transitions, 4586 flow [2025-03-08 17:37:23,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 9.333333333333334) internal successors, (336), 36 states have internal predecessors, (336), 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-08 17:37:23,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:23,199 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:37:23,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 17:37:23,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:37:23,400 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:37:23,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:23,401 INFO L85 PathProgramCache]: Analyzing trace with hash -645207037, now seen corresponding path program 6 times [2025-03-08 17:37:23,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:23,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848935175] [2025-03-08 17:37:23,401 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:37:23,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:23,405 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-03-08 17:37:23,486 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 17:37:23,486 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-08 17:37:23,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:24,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:24,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848935175] [2025-03-08 17:37:24,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848935175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:37:24,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233633188] [2025-03-08 17:37:24,034 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:37:24,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:37:24,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:37:24,035 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:37:24,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 17:37:24,083 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-03-08 17:37:24,102 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 17:37:24,102 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-08 17:37:24,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:24,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 17:37:24,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:37:24,136 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-08 17:37:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:24,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:37:25,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2025-03-08 17:37:25,031 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-03-08 17:37:25,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 142 [2025-03-08 17:37:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:25,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233633188] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:37:25,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:37:25,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2025-03-08 17:37:25,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750813378] [2025-03-08 17:37:25,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:37:25,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 17:37:25,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:25,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 17:37:25,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 17:37:25,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-08 17:37:25,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 324 transitions, 4586 flow. Second operand has 35 states, 35 states have (on average 9.371428571428572) internal successors, (328), 35 states have internal predecessors, (328), 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-08 17:37:25,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:25,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-08 17:37:25,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:30,253 INFO L124 PetriNetUnfolderBase]: 7703/13273 cut-off events. [2025-03-08 17:37:30,253 INFO L125 PetriNetUnfolderBase]: For 98109/98618 co-relation queries the response was YES. [2025-03-08 17:37:30,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67562 conditions, 13273 events. 7703/13273 cut-off events. For 98109/98618 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 97576 event pairs, 2411 based on Foata normal form. 43/13113 useless extension candidates. Maximal degree in co-relation 67446. Up to 2339 conditions per place. [2025-03-08 17:37:30,360 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 441 selfloop transitions, 160 changer transitions 51/668 dead transitions. [2025-03-08 17:37:30,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 668 transitions, 7961 flow [2025-03-08 17:37:30,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-08 17:37:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-08 17:37:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 696 transitions. [2025-03-08 17:37:30,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45194805194805193 [2025-03-08 17:37:30,362 INFO L175 Difference]: Start difference. First operand has 246 places, 324 transitions, 4586 flow. Second operand 44 states and 696 transitions. [2025-03-08 17:37:30,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 668 transitions, 7961 flow [2025-03-08 17:37:30,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 668 transitions, 7743 flow, removed 23 selfloop flow, removed 21 redundant places. [2025-03-08 17:37:30,814 INFO L231 Difference]: Finished difference. Result has 271 places, 335 transitions, 4859 flow [2025-03-08 17:37:30,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4400, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=4859, PETRI_PLACES=271, PETRI_TRANSITIONS=335} [2025-03-08 17:37:30,814 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 233 predicate places. [2025-03-08 17:37:30,814 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 335 transitions, 4859 flow [2025-03-08 17:37:30,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.371428571428572) internal successors, (328), 35 states have internal predecessors, (328), 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-08 17:37:30,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:30,815 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:37:30,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 17:37:31,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-08 17:37:31,015 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:37:31,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2017783473, now seen corresponding path program 7 times [2025-03-08 17:37:31,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:31,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200462746] [2025-03-08 17:37:31,016 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:37:31,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:31,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 17:37:31,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 17:37:31,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:37:31,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:32,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:32,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:32,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200462746] [2025-03-08 17:37:32,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200462746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:37:32,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716242061] [2025-03-08 17:37:32,213 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:37:32,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:37:32,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:37:32,215 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:37:32,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 17:37:32,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 17:37:32,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 17:37:32,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:37:32,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:32,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 17:37:32,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:37:32,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:37:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:32,684 INFO L312 TraceCheckSpWp]: Computing backward predicates...