./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-bad-buffer-mult-alt.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 2e9e4bd6e9b16aa5f22ad2335ca34ba741869a12ab5a04a80108cf42ed170c0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:40:24,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:40:24,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:40:24,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:40:24,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:40:24,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:40:24,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:40:24,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:40:24,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:40:24,650 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:40:24,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:40:24,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:40:24,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:40:24,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:40:24,652 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:40:24,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:40:24,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:40:24,652 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:40:24,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:40:24,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:40:24,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:40:24,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:40:24,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:40:24,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:40:24,653 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:40:24,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:40:24,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:40:24,653 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:40:24,653 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:40:24,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:40:24,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:40:24,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:40:24,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:40:24,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:40:24,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:40:24,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:40:24,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:40:24,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:40:24,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:40:24,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:40:24,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:40:24,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:40:24,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:40:24,655 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 -> 2e9e4bd6e9b16aa5f22ad2335ca34ba741869a12ab5a04a80108cf42ed170c0f [2025-03-17 06:40:24,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:40:24,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:40:24,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:40:24,953 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:40:24,953 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:40:24,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-03-17 06:40:26,185 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7407f0290/367d20539cf64b46b562019ab888e88f/FLAG089e0146f [2025-03-17 06:40:26,415 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:40:26,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-03-17 06:40:26,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7407f0290/367d20539cf64b46b562019ab888e88f/FLAG089e0146f [2025-03-17 06:40:26,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7407f0290/367d20539cf64b46b562019ab888e88f [2025-03-17 06:40:26,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:40:26,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:40:26,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:40:26,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:40:26,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:40:26,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:40:26" (1/1) ... [2025-03-17 06:40:26,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a9752c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:26, skipping insertion in model container [2025-03-17 06:40:26,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:40:26" (1/1) ... [2025-03-17 06:40:26,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:40:26,651 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-bad-buffer-mult-alt.wvr.c[4345,4358] [2025-03-17 06:40:26,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:40:26,680 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:40:26,708 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-bad-buffer-mult-alt.wvr.c[4345,4358] [2025-03-17 06:40:26,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:40:26,729 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:40:26,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:26 WrapperNode [2025-03-17 06:40:26,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:40:26,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:40:26,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:40:26,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:40:26,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:26" (1/1) ... [2025-03-17 06:40:26,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:26" (1/1) ... [2025-03-17 06:40:26,779 INFO L138 Inliner]: procedures = 25, calls = 59, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 293 [2025-03-17 06:40:26,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:40:26,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:40:26,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:40:26,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:40:26,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:26" (1/1) ... [2025-03-17 06:40:26,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:26" (1/1) ... [2025-03-17 06:40:26,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:26" (1/1) ... [2025-03-17 06:40:26,824 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-17 06:40:26,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:26" (1/1) ... [2025-03-17 06:40:26,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:26" (1/1) ... [2025-03-17 06:40:26,839 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:26" (1/1) ... [2025-03-17 06:40:26,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:26" (1/1) ... [2025-03-17 06:40:26,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:26" (1/1) ... [2025-03-17 06:40:26,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:26" (1/1) ... [2025-03-17 06:40:26,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:40:26,849 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:40:26,849 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:40:26,849 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:40:26,853 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:26" (1/1) ... [2025-03-17 06:40:26,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:40:26,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:40:26,892 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-17 06:40:26,898 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-17 06:40:26,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:40:26,923 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 06:40:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 06:40:26,923 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 06:40:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 06:40:26,923 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 06:40:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 06:40:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 06:40:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 06:40:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:40:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:40:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:40:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:40:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 06:40:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 06:40:26,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 06:40:26,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:40:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:40:26,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:40:26,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:40:26,926 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:40:27,051 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:40:27,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:40:27,500 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:40:27,500 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:40:27,793 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:40:27,793 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:40:27,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:40:27 BoogieIcfgContainer [2025-03-17 06:40:27,793 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:40:27,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:40:27,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:40:27,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:40:27,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:40:26" (1/3) ... [2025-03-17 06:40:27,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637d611e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:40:27, skipping insertion in model container [2025-03-17 06:40:27,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:40:26" (2/3) ... [2025-03-17 06:40:27,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637d611e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:40:27, skipping insertion in model container [2025-03-17 06:40:27,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:40:27" (3/3) ... [2025-03-17 06:40:27,800 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2025-03-17 06:40:27,812 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:40:27,813 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt.wvr.c that has 5 procedures, 45 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-17 06:40:27,814 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:40:27,884 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 06:40:27,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 128 flow [2025-03-17 06:40:27,948 INFO L124 PetriNetUnfolderBase]: 6/46 cut-off events. [2025-03-17 06:40:27,949 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 06:40:27,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 46 events. 6/46 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-03-17 06:40:27,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 50 transitions, 128 flow [2025-03-17 06:40:27,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 45 transitions, 114 flow [2025-03-17 06:40:27,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:40:27,978 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;@1e9cd3a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:40:27,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-17 06:40:27,993 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:40:27,994 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2025-03-17 06:40:27,994 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 06:40:27,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:27,995 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, 1, 1, 1, 1] [2025-03-17 06:40:27,995 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 2 more)] === [2025-03-17 06:40:27,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:28,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1326787187, now seen corresponding path program 1 times [2025-03-17 06:40:28,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:28,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890582603] [2025-03-17 06:40:28,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:28,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:28,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 06:40:28,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 06:40:28,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:28,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:28,698 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-17 06:40:28,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:28,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890582603] [2025-03-17 06:40:28,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890582603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:28,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:28,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:40:28,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916508144] [2025-03-17 06:40:28,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:28,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:40:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:28,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:40:28,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:40:28,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-17 06:40:28,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-17 06:40:28,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:28,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-17 06:40:28,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:29,974 INFO L124 PetriNetUnfolderBase]: 6847/9607 cut-off events. [2025-03-17 06:40:29,975 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2025-03-17 06:40:30,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19212 conditions, 9607 events. 6847/9607 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 52599 event pairs, 453 based on Foata normal form. 448/10007 useless extension candidates. Maximal degree in co-relation 17454. Up to 5031 conditions per place. [2025-03-17 06:40:30,114 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 92 selfloop transitions, 7 changer transitions 0/108 dead transitions. [2025-03-17 06:40:30,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 108 transitions, 471 flow [2025-03-17 06:40:30,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:40:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:40:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2025-03-17 06:40:30,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5966666666666667 [2025-03-17 06:40:30,128 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 114 flow. Second operand 6 states and 179 transitions. [2025-03-17 06:40:30,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 108 transitions, 471 flow [2025-03-17 06:40:30,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 108 transitions, 433 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 06:40:30,143 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 145 flow [2025-03-17 06:40:30,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2025-03-17 06:40:30,149 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-03-17 06:40:30,149 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 145 flow [2025-03-17 06:40:30,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-17 06:40:30,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:30,149 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:30,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:40:30,150 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 2 more)] === [2025-03-17 06:40:30,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:30,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1390567324, now seen corresponding path program 1 times [2025-03-17 06:40:30,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:30,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972548153] [2025-03-17 06:40:30,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:30,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:30,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 06:40:30,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 06:40:30,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:30,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:40:30,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:30,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972548153] [2025-03-17 06:40:30,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972548153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:30,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:30,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:40:30,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316866606] [2025-03-17 06:40:30,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:30,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:40:30,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:30,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:40:30,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:40:30,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-17 06:40:30,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:40:30,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:30,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-17 06:40:30,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:31,102 INFO L124 PetriNetUnfolderBase]: 5993/8325 cut-off events. [2025-03-17 06:40:31,102 INFO L125 PetriNetUnfolderBase]: For 2869/2869 co-relation queries the response was YES. [2025-03-17 06:40:31,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19620 conditions, 8325 events. 5993/8325 cut-off events. For 2869/2869 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 43742 event pairs, 1181 based on Foata normal form. 159/8430 useless extension candidates. Maximal degree in co-relation 10019. Up to 6569 conditions per place. [2025-03-17 06:40:31,155 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 57 selfloop transitions, 2 changer transitions 3/71 dead transitions. [2025-03-17 06:40:31,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 320 flow [2025-03-17 06:40:31,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:40:31,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:40:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-17 06:40:31,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2025-03-17 06:40:31,157 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 145 flow. Second operand 3 states and 97 transitions. [2025-03-17 06:40:31,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 320 flow [2025-03-17 06:40:31,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:40:31,199 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 152 flow [2025-03-17 06:40:31,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2025-03-17 06:40:31,200 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2025-03-17 06:40:31,200 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 152 flow [2025-03-17 06:40:31,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:40:31,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:31,200 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:31,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:40:31,200 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 2 more)] === [2025-03-17 06:40:31,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:31,201 INFO L85 PathProgramCache]: Analyzing trace with hash 882839138, now seen corresponding path program 1 times [2025-03-17 06:40:31,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:31,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562367998] [2025-03-17 06:40:31,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:31,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:31,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 06:40:31,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 06:40:31,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:31,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:31,419 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-17 06:40:31,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:31,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562367998] [2025-03-17 06:40:31,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562367998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:40:31,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303730822] [2025-03-17 06:40:31,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:31,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:40:31,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:40:31,423 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-17 06:40:31,424 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-17 06:40:31,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 06:40:31,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 06:40:31,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:31,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:31,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 06:40:31,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:40:31,779 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-17 06:40:31,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:40:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:40:32,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303730822] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:40:32,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:40:32,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 15 [2025-03-17 06:40:32,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959157228] [2025-03-17 06:40:32,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:32,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:40:32,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:32,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:40:32,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:40:32,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-17 06:40:32,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 152 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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-17 06:40:32,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:32,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-17 06:40:32,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:33,624 INFO L124 PetriNetUnfolderBase]: 16701/21941 cut-off events. [2025-03-17 06:40:33,625 INFO L125 PetriNetUnfolderBase]: For 5751/5751 co-relation queries the response was YES. [2025-03-17 06:40:33,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51242 conditions, 21941 events. 16701/21941 cut-off events. For 5751/5751 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 114046 event pairs, 2256 based on Foata normal form. 274/21190 useless extension candidates. Maximal degree in co-relation 20432. Up to 8116 conditions per place. [2025-03-17 06:40:33,765 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 105 selfloop transitions, 13 changer transitions 0/125 dead transitions. [2025-03-17 06:40:33,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 125 transitions, 588 flow [2025-03-17 06:40:33,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:40:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:40:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2025-03-17 06:40:33,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2025-03-17 06:40:33,767 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 152 flow. Second operand 6 states and 176 transitions. [2025-03-17 06:40:33,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 125 transitions, 588 flow [2025-03-17 06:40:33,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 125 transitions, 585 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:40:33,789 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 251 flow [2025-03-17 06:40:33,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2025-03-17 06:40:33,790 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-03-17 06:40:33,790 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 251 flow [2025-03-17 06:40:33,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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-17 06:40:33,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:33,790 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:33,799 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-17 06:40:33,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:40:33,992 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 2 more)] === [2025-03-17 06:40:33,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:33,993 INFO L85 PathProgramCache]: Analyzing trace with hash -963309591, now seen corresponding path program 1 times [2025-03-17 06:40:33,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:33,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780349122] [2025-03-17 06:40:33,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:33,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:34,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 06:40:34,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 06:40:34,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:34,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:34,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:40:34,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:34,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780349122] [2025-03-17 06:40:34,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780349122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:34,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:34,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:40:34,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349337398] [2025-03-17 06:40:34,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:34,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:40:34,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:34,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:40:34,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:40:34,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-17 06:40:34,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 251 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-17 06:40:34,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:34,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-17 06:40:34,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:35,503 INFO L124 PetriNetUnfolderBase]: 12145/17134 cut-off events. [2025-03-17 06:40:35,503 INFO L125 PetriNetUnfolderBase]: For 20233/20481 co-relation queries the response was YES. [2025-03-17 06:40:35,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47125 conditions, 17134 events. 12145/17134 cut-off events. For 20233/20481 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 101094 event pairs, 8471 based on Foata normal form. 380/17376 useless extension candidates. Maximal degree in co-relation 18708. Up to 14718 conditions per place. [2025-03-17 06:40:35,622 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 48 selfloop transitions, 2 changer transitions 27/88 dead transitions. [2025-03-17 06:40:35,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 487 flow [2025-03-17 06:40:35,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:40:35,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:40:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-17 06:40:35,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-17 06:40:35,625 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 251 flow. Second operand 5 states and 130 transitions. [2025-03-17 06:40:35,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 487 flow [2025-03-17 06:40:35,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 88 transitions, 484 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:40:35,682 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 270 flow [2025-03-17 06:40:35,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-03-17 06:40:35,682 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2025-03-17 06:40:35,683 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 270 flow [2025-03-17 06:40:35,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-17 06:40:35,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:35,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:35,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:40:35,683 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 2 more)] === [2025-03-17 06:40:35,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:35,684 INFO L85 PathProgramCache]: Analyzing trace with hash -196353561, now seen corresponding path program 1 times [2025-03-17 06:40:35,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:35,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807414114] [2025-03-17 06:40:35,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:35,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:35,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 06:40:35,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 06:40:35,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:35,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:36,537 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-17 06:40:36,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:36,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807414114] [2025-03-17 06:40:36,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807414114] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:40:36,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177909430] [2025-03-17 06:40:36,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:36,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:40:36,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:40:36,542 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-17 06:40:36,544 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-17 06:40:36,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 06:40:36,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 06:40:36,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:36,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:36,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 06:40:36,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:40:36,718 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-17 06:40:37,099 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 15 treesize of output 7 [2025-03-17 06:40:37,110 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-17 06:40:37,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:40:37,588 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 39 treesize of output 35 [2025-03-17 06:40:37,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 35 [2025-03-17 06:40:37,644 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-17 06:40:37,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177909430] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:40:37,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:40:37,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-17 06:40:37,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206480630] [2025-03-17 06:40:37,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:40:37,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 06:40:37,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:37,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 06:40:37,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:40:37,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-17 06:40:37,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 270 flow. Second operand has 18 states, 18 states have (on average 17.22222222222222) internal successors, (310), 18 states have internal predecessors, (310), 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-17 06:40:37,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:37,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-17 06:40:37,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:42,592 INFO L124 PetriNetUnfolderBase]: 39552/55758 cut-off events. [2025-03-17 06:40:42,592 INFO L125 PetriNetUnfolderBase]: For 63902/65440 co-relation queries the response was YES. [2025-03-17 06:40:42,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153167 conditions, 55758 events. 39552/55758 cut-off events. For 63902/65440 co-relation queries the response was YES. Maximal size of possible extension queue 1821. Compared 371682 event pairs, 4592 based on Foata normal form. 1445/57027 useless extension candidates. Maximal degree in co-relation 153146. Up to 17228 conditions per place. [2025-03-17 06:40:42,966 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 294 selfloop transitions, 49 changer transitions 15/369 dead transitions. [2025-03-17 06:40:42,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 369 transitions, 2116 flow [2025-03-17 06:40:42,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 06:40:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 06:40:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 556 transitions. [2025-03-17 06:40:42,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6177777777777778 [2025-03-17 06:40:42,968 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 270 flow. Second operand 18 states and 556 transitions. [2025-03-17 06:40:42,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 369 transitions, 2116 flow [2025-03-17 06:40:43,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 369 transitions, 2072 flow, removed 21 selfloop flow, removed 3 redundant places. [2025-03-17 06:40:43,053 INFO L231 Difference]: Finished difference. Result has 85 places, 108 transitions, 691 flow [2025-03-17 06:40:43,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=691, PETRI_PLACES=85, PETRI_TRANSITIONS=108} [2025-03-17 06:40:43,054 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 33 predicate places. [2025-03-17 06:40:43,054 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 108 transitions, 691 flow [2025-03-17 06:40:43,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 17.22222222222222) internal successors, (310), 18 states have internal predecessors, (310), 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-17 06:40:43,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:43,055 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:43,066 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-17 06:40:43,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:40:43,257 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 2 more)] === [2025-03-17 06:40:43,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1410598398, now seen corresponding path program 1 times [2025-03-17 06:40:43,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:43,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708894255] [2025-03-17 06:40:43,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:43,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:43,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 06:40:43,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 06:40:43,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:43,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:40:43,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:43,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708894255] [2025-03-17 06:40:43,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708894255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:40:43,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398949096] [2025-03-17 06:40:43,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:43,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:40:43,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:40:43,916 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-17 06:40:43,917 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-17 06:40:43,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 06:40:44,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 06:40:44,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:44,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:44,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 06:40:44,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:40:44,333 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 25 treesize of output 7 [2025-03-17 06:40:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 06:40:44,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:40:44,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:40:44,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-03-17 06:40:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 06:40:44,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398949096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:40:44,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:40:44,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 14 [2025-03-17 06:40:44,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193611903] [2025-03-17 06:40:44,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:40:44,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 06:40:44,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:44,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 06:40:44,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:40:44,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-17 06:40:44,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 108 transitions, 691 flow. Second operand has 15 states, 15 states have (on average 18.2) internal successors, (273), 15 states have internal predecessors, (273), 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-17 06:40:44,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:44,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-17 06:40:44,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:40:52,353 INFO L124 PetriNetUnfolderBase]: 68522/96623 cut-off events. [2025-03-17 06:40:52,354 INFO L125 PetriNetUnfolderBase]: For 174733/177185 co-relation queries the response was YES. [2025-03-17 06:40:52,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287840 conditions, 96623 events. 68522/96623 cut-off events. For 174733/177185 co-relation queries the response was YES. Maximal size of possible extension queue 3115. Compared 686713 event pairs, 6621 based on Foata normal form. 981/97352 useless extension candidates. Maximal degree in co-relation 225828. Up to 28836 conditions per place. [2025-03-17 06:40:53,346 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 244 selfloop transitions, 88 changer transitions 11/354 dead transitions. [2025-03-17 06:40:53,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 354 transitions, 2381 flow [2025-03-17 06:40:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 06:40:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 06:40:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 496 transitions. [2025-03-17 06:40:53,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5511111111111111 [2025-03-17 06:40:53,348 INFO L175 Difference]: Start difference. First operand has 85 places, 108 transitions, 691 flow. Second operand 18 states and 496 transitions. [2025-03-17 06:40:53,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 354 transitions, 2381 flow [2025-03-17 06:40:54,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 354 transitions, 2349 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-03-17 06:40:54,362 INFO L231 Difference]: Finished difference. Result has 109 places, 154 transitions, 1332 flow [2025-03-17 06:40:54,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1332, PETRI_PLACES=109, PETRI_TRANSITIONS=154} [2025-03-17 06:40:54,363 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 57 predicate places. [2025-03-17 06:40:54,363 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 154 transitions, 1332 flow [2025-03-17 06:40:54,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.2) internal successors, (273), 15 states have internal predecessors, (273), 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-17 06:40:54,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:40:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:40:54,372 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-17 06:40:54,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:40:54,566 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 2 more)] === [2025-03-17 06:40:54,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:40:54,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2071262296, now seen corresponding path program 1 times [2025-03-17 06:40:54,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:40:54,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560502507] [2025-03-17 06:40:54,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:40:54,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:40:54,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 06:40:54,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 06:40:54,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:40:54,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:40:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:40:54,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:40:54,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560502507] [2025-03-17 06:40:54,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560502507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:40:54,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:40:54,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:40:54,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145219248] [2025-03-17 06:40:54,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:40:54,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:40:54,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:40:54,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:40:54,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:40:54,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-17 06:40:54,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 154 transitions, 1332 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-17 06:40:54,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:40:54,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-17 06:40:54,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:41:06,191 INFO L124 PetriNetUnfolderBase]: 93390/133210 cut-off events. [2025-03-17 06:41:06,191 INFO L125 PetriNetUnfolderBase]: For 504495/506652 co-relation queries the response was YES. [2025-03-17 06:41:07,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437034 conditions, 133210 events. 93390/133210 cut-off events. For 504495/506652 co-relation queries the response was YES. Maximal size of possible extension queue 4122. Compared 1005940 event pairs, 28968 based on Foata normal form. 3087/136166 useless extension candidates. Maximal degree in co-relation 429014. Up to 83060 conditions per place. [2025-03-17 06:41:07,540 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 206 selfloop transitions, 9 changer transitions 0/226 dead transitions. [2025-03-17 06:41:07,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 226 transitions, 2498 flow [2025-03-17 06:41:07,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:41:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:41:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-03-17 06:41:07,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66 [2025-03-17 06:41:07,541 INFO L175 Difference]: Start difference. First operand has 109 places, 154 transitions, 1332 flow. Second operand 3 states and 99 transitions. [2025-03-17 06:41:07,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 226 transitions, 2498 flow [2025-03-17 06:41:10,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 226 transitions, 2400 flow, removed 45 selfloop flow, removed 3 redundant places. [2025-03-17 06:41:10,809 INFO L231 Difference]: Finished difference. Result has 109 places, 155 transitions, 1349 flow [2025-03-17 06:41:10,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1349, PETRI_PLACES=109, PETRI_TRANSITIONS=155} [2025-03-17 06:41:10,810 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 57 predicate places. [2025-03-17 06:41:10,810 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 155 transitions, 1349 flow [2025-03-17 06:41:10,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-17 06:41:10,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:41:10,810 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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, 1, 1, 1] [2025-03-17 06:41:10,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:41:10,811 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 2 more)] === [2025-03-17 06:41:10,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:41:10,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1700670777, now seen corresponding path program 2 times [2025-03-17 06:41:10,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:41:10,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393694230] [2025-03-17 06:41:10,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:41:10,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:41:10,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-17 06:41:10,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 06:41:10,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:41:10,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:41:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 06:41:10,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:41:10,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393694230] [2025-03-17 06:41:10,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393694230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:41:10,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:41:10,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:41:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846785107] [2025-03-17 06:41:10,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:41:10,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:41:10,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:41:10,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:41:10,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:41:10,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-17 06:41:10,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 155 transitions, 1349 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-17 06:41:10,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:41:10,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-17 06:41:10,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand