./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue.i -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 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:24:25,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:24:25,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:24:25,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:24:25,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:24:25,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:24:25,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:24:25,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:24:25,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:24:25,645 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:24:25,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:24:25,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:24:25,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:24:25,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:24:25,646 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:24:25,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:24:25,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:24:25,646 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:24:25,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:24:25,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:24:25,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:24:25,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:24:25,647 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:24:25,647 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:24:25,647 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:24:25,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:24:25,647 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:24:25,647 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:24:25,647 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:24:25,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:24:25,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:24:25,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:24:25,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:24:25,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:24:25,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:24:25,648 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:24:25,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:24:25,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:24:25,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:24:25,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:24:25,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:24:25,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:24:25,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:24:25,648 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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2025-03-13 21:24:25,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:24:25,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:24:25,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:24:25,861 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:24:25,862 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:24:25,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue.i [2025-03-13 21:24:26,945 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189887102/5cca76de4c3c4beba5d5c607c6860a69/FLAG78ea0bf96 [2025-03-13 21:24:27,203 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:24:27,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2025-03-13 21:24:27,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189887102/5cca76de4c3c4beba5d5c607c6860a69/FLAG78ea0bf96 [2025-03-13 21:24:27,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189887102/5cca76de4c3c4beba5d5c607c6860a69 [2025-03-13 21:24:27,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:24:27,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:24:27,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:24:27,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:24:27,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:24:27,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:24:27" (1/1) ... [2025-03-13 21:24:27,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79656206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:27, skipping insertion in model container [2025-03-13 21:24:27,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:24:27" (1/1) ... [2025-03-13 21:24:27,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:24:27,932 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/pthread/queue.i[43284,43297] [2025-03-13 21:24:27,937 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/pthread/queue.i[43491,43504] [2025-03-13 21:24:27,939 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/pthread/queue.i[43772,43785] [2025-03-13 21:24:27,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:24:27,962 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:24:28,010 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/pthread/queue.i[43284,43297] [2025-03-13 21:24:28,015 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/pthread/queue.i[43491,43504] [2025-03-13 21:24:28,017 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/pthread/queue.i[43772,43785] [2025-03-13 21:24:28,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:24:28,063 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:24:28,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:28 WrapperNode [2025-03-13 21:24:28,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:24:28,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:24:28,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:24:28,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:24:28,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:28" (1/1) ... [2025-03-13 21:24:28,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:28" (1/1) ... [2025-03-13 21:24:28,106 INFO L138 Inliner]: procedures = 274, calls = 104, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 283 [2025-03-13 21:24:28,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:24:28,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:24:28,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:24:28,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:24:28,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:28" (1/1) ... [2025-03-13 21:24:28,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:28" (1/1) ... [2025-03-13 21:24:28,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:28" (1/1) ... [2025-03-13 21:24:28,139 INFO L175 MemorySlicer]: Split 92 memory accesses to 5 slices as follows [2, 8, 5, 23, 54]. 59 percent of accesses are in the largest equivalence class. The 58 initializations are split as follows [2, 8, 5, 20, 23]. The 16 writes are split as follows [0, 0, 0, 2, 14]. [2025-03-13 21:24:28,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:28" (1/1) ... [2025-03-13 21:24:28,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:28" (1/1) ... [2025-03-13 21:24:28,148 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:28" (1/1) ... [2025-03-13 21:24:28,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:28" (1/1) ... [2025-03-13 21:24:28,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:28" (1/1) ... [2025-03-13 21:24:28,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:28" (1/1) ... [2025-03-13 21:24:28,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:24:28,157 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:24:28,157 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:24:28,157 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:24:28,158 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:28" (1/1) ... [2025-03-13 21:24:28,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:24:28,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:24:28,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:24:28,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:24:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-13 21:24:28,207 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-13 21:24:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-13 21:24:28,207 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-13 21:24:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:24:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:24:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:24:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-13 21:24:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-13 21:24:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-13 21:24:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:24:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:24:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-13 21:24:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-13 21:24:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-13 21:24:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:24:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:24:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:24:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:24:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-13 21:24:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-13 21:24:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-13 21:24:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:24:28,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:24:28,209 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:24:28,345 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:24:28,346 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:24:28,698 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:24:28,698 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:24:28,698 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:24:29,149 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:24:29,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:24:29 BoogieIcfgContainer [2025-03-13 21:24:29,150 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:24:29,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:24:29,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:24:29,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:24:29,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:24:27" (1/3) ... [2025-03-13 21:24:29,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697bb03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:24:29, skipping insertion in model container [2025-03-13 21:24:29,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:24:28" (2/3) ... [2025-03-13 21:24:29,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697bb03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:24:29, skipping insertion in model container [2025-03-13 21:24:29,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:24:29" (3/3) ... [2025-03-13 21:24:29,158 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-03-13 21:24:29,170 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:24:29,172 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 40 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-13 21:24:29,172 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:24:29,228 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:24:29,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 46 transitions, 106 flow [2025-03-13 21:24:29,284 INFO L124 PetriNetUnfolderBase]: 7/44 cut-off events. [2025-03-13 21:24:29,286 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:24:29,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 44 events. 7/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-13 21:24:29,291 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 46 transitions, 106 flow [2025-03-13 21:24:29,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 42 transitions, 93 flow [2025-03-13 21:24:29,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:24:29,311 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;@3e2f3550, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:24:29,312 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-13 21:24:29,316 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:24:29,316 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-13 21:24:29,316 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:24:29,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:24:29,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-13 21:24:29,317 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 4 more)] === [2025-03-13 21:24:29,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:24:29,322 INFO L85 PathProgramCache]: Analyzing trace with hash 658785, now seen corresponding path program 1 times [2025-03-13 21:24:29,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:24:29,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623254568] [2025-03-13 21:24:29,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:24:29,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:24:29,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-13 21:24:29,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-13 21:24:29,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:24:29,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:24:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:24:29,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:24:29,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623254568] [2025-03-13 21:24:29,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623254568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:24:29,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:24:29,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:24:29,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534493728] [2025-03-13 21:24:29,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:24:29,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:24:29,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:24:29,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:24:29,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:24:29,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-13 21:24:29,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 93 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:29,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:24:29,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-13 21:24:29,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:24:29,704 INFO L124 PetriNetUnfolderBase]: 428/771 cut-off events. [2025-03-13 21:24:29,704 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-13 21:24:29,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1508 conditions, 771 events. 428/771 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3491 event pairs, 334 based on Foata normal form. 47/731 useless extension candidates. Maximal degree in co-relation 1449. Up to 697 conditions per place. [2025-03-13 21:24:29,710 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 30 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2025-03-13 21:24:29,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 143 flow [2025-03-13 21:24:29,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:24:29,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:24:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2025-03-13 21:24:29,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2025-03-13 21:24:29,720 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 93 flow. Second operand 2 states and 53 transitions. [2025-03-13 21:24:29,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 143 flow [2025-03-13 21:24:29,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:24:29,726 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 78 flow [2025-03-13 21:24:29,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2025-03-13 21:24:29,730 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2025-03-13 21:24:29,730 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 78 flow [2025-03-13 21:24:29,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:29,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:24:29,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:24:29,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:24:29,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:24:29,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:24:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash 361006736, now seen corresponding path program 1 times [2025-03-13 21:24:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:24:29,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092882091] [2025-03-13 21:24:29,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:24:29,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:24:29,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:24:29,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:24:29,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:24:29,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:24:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:24:29,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:24:29,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092882091] [2025-03-13 21:24:29,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092882091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:24:29,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:24:29,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:24:29,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609565813] [2025-03-13 21:24:29,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:24:29,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:24:29,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:24:29,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:24:29,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:24:29,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-13 21:24:29,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:29,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:24:29,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-13 21:24:29,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:24:30,054 INFO L124 PetriNetUnfolderBase]: 408/749 cut-off events. [2025-03-13 21:24:30,055 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-13 21:24:30,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 749 events. 408/749 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3493 event pairs, 307 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 1452. Up to 627 conditions per place. [2025-03-13 21:24:30,064 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 39 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2025-03-13 21:24:30,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 184 flow [2025-03-13 21:24:30,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:24:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:24:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-13 21:24:30,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2025-03-13 21:24:30,067 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 78 flow. Second operand 3 states and 72 transitions. [2025-03-13 21:24:30,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 184 flow [2025-03-13 21:24:30,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:24:30,088 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 80 flow [2025-03-13 21:24:30,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-03-13 21:24:30,089 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2025-03-13 21:24:30,089 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 80 flow [2025-03-13 21:24:30,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:30,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:24:30,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:24:30,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:24:30,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:24:30,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:24:30,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1693691389, now seen corresponding path program 1 times [2025-03-13 21:24:30,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:24:30,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578170621] [2025-03-13 21:24:30,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:24:30,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:24:30,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:24:30,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:24:30,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:24:30,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:24:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:24:30,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:24:30,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578170621] [2025-03-13 21:24:30,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578170621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:24:30,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:24:30,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:24:30,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566061875] [2025-03-13 21:24:30,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:24:30,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:24:30,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:24:30,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:24:30,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:24:30,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-13 21:24:30,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:30,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:24:30,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-13 21:24:30,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:24:30,896 INFO L124 PetriNetUnfolderBase]: 674/1238 cut-off events. [2025-03-13 21:24:30,896 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-13 21:24:30,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2423 conditions, 1238 events. 674/1238 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6160 event pairs, 74 based on Foata normal form. 0/1177 useless extension candidates. Maximal degree in co-relation 2419. Up to 658 conditions per place. [2025-03-13 21:24:30,907 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 70 selfloop transitions, 10 changer transitions 3/90 dead transitions. [2025-03-13 21:24:30,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 90 transitions, 367 flow [2025-03-13 21:24:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:24:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:24:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-03-13 21:24:30,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5253623188405797 [2025-03-13 21:24:30,910 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 80 flow. Second operand 6 states and 145 transitions. [2025-03-13 21:24:30,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 90 transitions, 367 flow [2025-03-13 21:24:30,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 90 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:24:30,914 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 144 flow [2025-03-13 21:24:30,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2025-03-13 21:24:30,915 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2025-03-13 21:24:30,915 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 144 flow [2025-03-13 21:24:30,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:30,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:24:30,915 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:24:30,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:24:30,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:24:30,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:24:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1046080674, now seen corresponding path program 1 times [2025-03-13 21:24:30,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:24:30,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183640928] [2025-03-13 21:24:30,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:24:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:24:30,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-13 21:24:30,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:24:30,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:24:30,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:24:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:24:31,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:24:31,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183640928] [2025-03-13 21:24:31,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183640928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:24:31,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:24:31,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:24:31,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740407255] [2025-03-13 21:24:31,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:24:31,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:24:31,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:24:31,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:24:31,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:24:31,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-13 21:24:31,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:31,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:24:31,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-13 21:24:31,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:24:31,160 INFO L124 PetriNetUnfolderBase]: 419/804 cut-off events. [2025-03-13 21:24:31,161 INFO L125 PetriNetUnfolderBase]: For 111/114 co-relation queries the response was YES. [2025-03-13 21:24:31,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1669 conditions, 804 events. 419/804 cut-off events. For 111/114 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3496 event pairs, 215 based on Foata normal form. 29/811 useless extension candidates. Maximal degree in co-relation 1662. Up to 416 conditions per place. [2025-03-13 21:24:31,164 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 36 selfloop transitions, 4 changer transitions 3/49 dead transitions. [2025-03-13 21:24:31,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 213 flow [2025-03-13 21:24:31,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:24:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:24:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-13 21:24:31,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5289855072463768 [2025-03-13 21:24:31,166 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 144 flow. Second operand 3 states and 73 transitions. [2025-03-13 21:24:31,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 213 flow [2025-03-13 21:24:31,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 207 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:24:31,169 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 106 flow [2025-03-13 21:24:31,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2025-03-13 21:24:31,170 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2025-03-13 21:24:31,170 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 106 flow [2025-03-13 21:24:31,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:31,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:24:31,170 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] [2025-03-13 21:24:31,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:24:31,170 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:24:31,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:24:31,171 INFO L85 PathProgramCache]: Analyzing trace with hash 189939549, now seen corresponding path program 1 times [2025-03-13 21:24:31,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:24:31,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635058652] [2025-03-13 21:24:31,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:24:31,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:24:31,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:24:31,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:24:31,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:24:31,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:24:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:24:31,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:24:31,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635058652] [2025-03-13 21:24:31,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635058652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:24:31,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:24:31,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:24:31,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123701907] [2025-03-13 21:24:31,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:24:31,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:24:31,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:24:31,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:24:31,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:24:31,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-13 21:24:31,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:31,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:24:31,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-13 21:24:31,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:24:31,390 INFO L124 PetriNetUnfolderBase]: 249/543 cut-off events. [2025-03-13 21:24:31,390 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-03-13 21:24:31,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 543 events. 249/543 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2142 event pairs, 85 based on Foata normal form. 32/565 useless extension candidates. Maximal degree in co-relation 1121. Up to 252 conditions per place. [2025-03-13 21:24:31,393 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 33 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2025-03-13 21:24:31,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 207 flow [2025-03-13 21:24:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:24:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:24:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-13 21:24:31,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2025-03-13 21:24:31,394 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 106 flow. Second operand 3 states and 70 transitions. [2025-03-13 21:24:31,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 207 flow [2025-03-13 21:24:31,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 197 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-13 21:24:31,396 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 108 flow [2025-03-13 21:24:31,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-03-13 21:24:31,397 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2025-03-13 21:24:31,397 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 108 flow [2025-03-13 21:24:31,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:31,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:24:31,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:24:31,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:24:31,397 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:24:31,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:24:31,398 INFO L85 PathProgramCache]: Analyzing trace with hash -2027864628, now seen corresponding path program 1 times [2025-03-13 21:24:31,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:24:31,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456062303] [2025-03-13 21:24:31,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:24:31,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:24:31,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:24:31,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:24:31,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:24:31,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:24:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:24:32,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:24:32,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456062303] [2025-03-13 21:24:32,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456062303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:24:32,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:24:32,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:24:32,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786520385] [2025-03-13 21:24:32,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:24:32,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:24:32,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:24:32,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:24:32,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:24:32,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-13 21:24:32,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 108 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:32,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:24:32,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-13 21:24:32,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:24:33,157 INFO L124 PetriNetUnfolderBase]: 370/811 cut-off events. [2025-03-13 21:24:33,158 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2025-03-13 21:24:33,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1774 conditions, 811 events. 370/811 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3828 event pairs, 69 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 1767. Up to 260 conditions per place. [2025-03-13 21:24:33,162 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 63 selfloop transitions, 16 changer transitions 8/93 dead transitions. [2025-03-13 21:24:33,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 93 transitions, 459 flow [2025-03-13 21:24:33,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:24:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:24:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2025-03-13 21:24:33,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4251207729468599 [2025-03-13 21:24:33,164 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 108 flow. Second operand 9 states and 176 transitions. [2025-03-13 21:24:33,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 93 transitions, 459 flow [2025-03-13 21:24:33,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 93 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:24:33,168 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 214 flow [2025-03-13 21:24:33,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=214, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2025-03-13 21:24:33,169 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2025-03-13 21:24:33,169 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 214 flow [2025-03-13 21:24:33,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:33,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:24:33,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:24:33,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:24:33,169 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:24:33,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:24:33,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1632111414, now seen corresponding path program 2 times [2025-03-13 21:24:33,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:24:33,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394174971] [2025-03-13 21:24:33,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:24:33,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:24:33,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:24:33,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:24:33,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:24:33,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:24:34,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:24:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:24:34,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394174971] [2025-03-13 21:24:34,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394174971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:24:34,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:24:34,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:24:34,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391260390] [2025-03-13 21:24:34,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:24:34,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:24:34,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:24:34,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:24:34,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:24:34,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-13 21:24:34,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 214 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:34,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:24:34,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-13 21:24:34,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:24:34,717 INFO L124 PetriNetUnfolderBase]: 479/1065 cut-off events. [2025-03-13 21:24:34,718 INFO L125 PetriNetUnfolderBase]: For 859/860 co-relation queries the response was YES. [2025-03-13 21:24:34,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2794 conditions, 1065 events. 479/1065 cut-off events. For 859/860 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5871 event pairs, 131 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 2781. Up to 636 conditions per place. [2025-03-13 21:24:34,722 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 69 selfloop transitions, 15 changer transitions 4/94 dead transitions. [2025-03-13 21:24:34,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 94 transitions, 580 flow [2025-03-13 21:24:34,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:24:34,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:24:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2025-03-13 21:24:34,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40096618357487923 [2025-03-13 21:24:34,724 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 214 flow. Second operand 9 states and 166 transitions. [2025-03-13 21:24:34,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 94 transitions, 580 flow [2025-03-13 21:24:34,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 94 transitions, 562 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-13 21:24:34,727 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 359 flow [2025-03-13 21:24:34,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2025-03-13 21:24:34,728 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2025-03-13 21:24:34,728 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 359 flow [2025-03-13 21:24:34,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:34,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:24:34,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:24:34,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:24:34,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:24:34,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:24:34,729 INFO L85 PathProgramCache]: Analyzing trace with hash 876178102, now seen corresponding path program 3 times [2025-03-13 21:24:34,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:24:34,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512110918] [2025-03-13 21:24:34,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:24:34,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:24:34,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:24:34,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:24:34,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:24:34,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:24:36,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:24:36,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:24:36,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512110918] [2025-03-13 21:24:36,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512110918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:24:36,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:24:36,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:24:36,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414200227] [2025-03-13 21:24:36,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:24:36,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:24:36,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:24:36,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:24:36,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:24:36,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-13 21:24:36,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 359 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:36,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:24:36,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-13 21:24:36,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:24:36,727 INFO L124 PetriNetUnfolderBase]: 599/1317 cut-off events. [2025-03-13 21:24:36,727 INFO L125 PetriNetUnfolderBase]: For 1670/1672 co-relation queries the response was YES. [2025-03-13 21:24:36,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3714 conditions, 1317 events. 599/1317 cut-off events. For 1670/1672 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7482 event pairs, 55 based on Foata normal form. 0/1306 useless extension candidates. Maximal degree in co-relation 3695. Up to 322 conditions per place. [2025-03-13 21:24:36,737 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 90 selfloop transitions, 32 changer transitions 6/134 dead transitions. [2025-03-13 21:24:36,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 134 transitions, 900 flow [2025-03-13 21:24:36,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:24:36,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:24:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 230 transitions. [2025-03-13 21:24:36,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-13 21:24:36,739 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 359 flow. Second operand 12 states and 230 transitions. [2025-03-13 21:24:36,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 134 transitions, 900 flow [2025-03-13 21:24:36,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 134 transitions, 854 flow, removed 23 selfloop flow, removed 0 redundant places. [2025-03-13 21:24:36,751 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 483 flow [2025-03-13 21:24:36,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=483, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2025-03-13 21:24:36,751 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2025-03-13 21:24:36,752 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 483 flow [2025-03-13 21:24:36,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:36,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:24:36,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:24:36,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:24:36,752 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:24:36,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:24:36,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1756026570, now seen corresponding path program 4 times [2025-03-13 21:24:36,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:24:36,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910832684] [2025-03-13 21:24:36,753 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:24:36,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:24:36,773 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-13 21:24:36,796 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:24:36,796 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:24:36,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:24:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:24:37,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:24:37,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910832684] [2025-03-13 21:24:37,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910832684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:24:37,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:24:37,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:24:37,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437809037] [2025-03-13 21:24:37,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:24:37,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:24:37,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:24:37,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:24:37,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:24:37,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-13 21:24:37,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 483 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:37,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:24:37,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-13 21:24:37,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:24:37,913 INFO L124 PetriNetUnfolderBase]: 685/1522 cut-off events. [2025-03-13 21:24:37,914 INFO L125 PetriNetUnfolderBase]: For 2905/2905 co-relation queries the response was YES. [2025-03-13 21:24:37,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4592 conditions, 1522 events. 685/1522 cut-off events. For 2905/2905 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8913 event pairs, 141 based on Foata normal form. 0/1511 useless extension candidates. Maximal degree in co-relation 4569. Up to 648 conditions per place. [2025-03-13 21:24:37,921 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 86 selfloop transitions, 25 changer transitions 8/125 dead transitions. [2025-03-13 21:24:37,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 968 flow [2025-03-13 21:24:37,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:24:37,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:24:37,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2025-03-13 21:24:37,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4323671497584541 [2025-03-13 21:24:37,922 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 483 flow. Second operand 9 states and 179 transitions. [2025-03-13 21:24:37,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 968 flow [2025-03-13 21:24:37,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 125 transitions, 892 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-03-13 21:24:37,932 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 627 flow [2025-03-13 21:24:37,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=627, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2025-03-13 21:24:37,933 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2025-03-13 21:24:37,934 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 627 flow [2025-03-13 21:24:37,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:37,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:24:37,934 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:24:37,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:24:37,934 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:24:37,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:24:37,934 INFO L85 PathProgramCache]: Analyzing trace with hash -379463315, now seen corresponding path program 1 times [2025-03-13 21:24:37,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:24:37,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214277575] [2025-03-13 21:24:37,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:24:37,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:24:37,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:24:37,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:24:37,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:24:37,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:24:39,030 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-13 21:24:39,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:24:39,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214277575] [2025-03-13 21:24:39,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214277575] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:24:39,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358393602] [2025-03-13 21:24:39,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:24:39,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:24:39,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:24:39,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:24:39,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:24:39,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:24:39,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:24:39,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:24:39,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:24:39,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-13 21:24:39,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:24:39,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-03-13 21:24:39,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:24:39,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2025-03-13 21:24:39,354 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 11 treesize of output 7 [2025-03-13 21:24:39,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-13 21:24:39,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2025-03-13 21:24:40,466 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-03-13 21:24:40,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 62 [2025-03-13 21:24:40,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:24:40,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 42 [2025-03-13 21:24:40,489 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-13 21:24:40,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:24:40,734 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:24:40,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-03-13 21:24:40,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:24:40,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:24:41,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:24:41,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:24:41,567 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:24:41,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-03-13 21:24:42,202 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 20 treesize of output 18 [2025-03-13 21:24:42,206 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 52 treesize of output 46 [2025-03-13 21:24:42,239 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 13 [2025-03-13 21:24:42,242 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 24 treesize of output 18 [2025-03-13 21:24:42,250 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 13 [2025-03-13 21:24:42,252 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 24 treesize of output 18 [2025-03-13 21:24:42,259 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 20 treesize of output 18 [2025-03-13 21:24:42,263 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 52 treesize of output 46 [2025-03-13 21:24:42,283 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 20 treesize of output 18 [2025-03-13 21:24:42,287 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 52 treesize of output 46 [2025-03-13 21:24:42,307 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 20 treesize of output 18 [2025-03-13 21:24:42,311 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 52 treesize of output 46 [2025-03-13 21:24:42,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:24:42,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 1514 treesize of output 1029 [2025-03-13 21:24:44,572 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-13 21:24:44,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358393602] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:24:44,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:24:44,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-03-13 21:24:44,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805930262] [2025-03-13 21:24:44,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:24:44,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-13 21:24:44,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:24:44,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-13 21:24:44,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2025-03-13 21:24:44,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-13 21:24:44,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 627 flow. Second operand has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:44,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:24:44,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-13 21:24:44,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:24:46,649 INFO L124 PetriNetUnfolderBase]: 916/1908 cut-off events. [2025-03-13 21:24:46,649 INFO L125 PetriNetUnfolderBase]: For 4344/4346 co-relation queries the response was YES. [2025-03-13 21:24:46,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5960 conditions, 1908 events. 916/1908 cut-off events. For 4344/4346 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 11195 event pairs, 224 based on Foata normal form. 18/1919 useless extension candidates. Maximal degree in co-relation 5931. Up to 1187 conditions per place. [2025-03-13 21:24:46,660 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 131 selfloop transitions, 38 changer transitions 2/176 dead transitions. [2025-03-13 21:24:46,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 176 transitions, 1356 flow [2025-03-13 21:24:46,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-13 21:24:46,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-13 21:24:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 281 transitions. [2025-03-13 21:24:46,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38179347826086957 [2025-03-13 21:24:46,662 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 627 flow. Second operand 16 states and 281 transitions. [2025-03-13 21:24:46,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 176 transitions, 1356 flow [2025-03-13 21:24:46,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 176 transitions, 1274 flow, removed 38 selfloop flow, removed 2 redundant places. [2025-03-13 21:24:46,674 INFO L231 Difference]: Finished difference. Result has 107 places, 108 transitions, 861 flow [2025-03-13 21:24:46,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=861, PETRI_PLACES=107, PETRI_TRANSITIONS=108} [2025-03-13 21:24:46,674 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2025-03-13 21:24:46,675 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 108 transitions, 861 flow [2025-03-13 21:24:46,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:24:46,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:24:46,675 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:24:46,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:24:46,879 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,SelfDestructingSolverStorable9 [2025-03-13 21:24:46,879 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:24:46,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:24:46,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1827577383, now seen corresponding path program 2 times [2025-03-13 21:24:46,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:24:46,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591668931] [2025-03-13 21:24:46,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:24:46,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:24:46,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:24:46,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:24:46,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:24:46,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:24:47,906 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-13 21:24:47,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:24:47,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591668931] [2025-03-13 21:24:47,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591668931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:24:47,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870019035] [2025-03-13 21:24:47,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:24:47,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:24:47,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:24:47,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:24:47,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:24:48,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:24:48,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:24:48,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:24:48,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:24:48,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-13 21:24:48,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:24:48,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-03-13 21:24:48,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:24:48,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2025-03-13 21:24:48,253 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 11 treesize of output 7 [2025-03-13 21:24:48,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:24:48,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2025-03-13 21:24:48,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:24:48,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 52 [2025-03-13 21:24:49,186 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-03-13 21:24:49,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 115 treesize of output 69 [2025-03-13 21:24:49,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:24:49,194 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 65 treesize of output 55 [2025-03-13 21:24:49,217 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-13 21:24:49,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:24:49,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:24:49,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:24:49,411 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:24:49,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-03-13 21:24:57,648 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-13 21:24:57,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870019035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:24:57,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:24:57,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 28 [2025-03-13 21:24:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334997567] [2025-03-13 21:24:57,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:24:57,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-13 21:24:57,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:24:57,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-13 21:24:57,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=666, Unknown=1, NotChecked=0, Total=812 [2025-03-13 21:24:58,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:25:03,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:25:03,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 46 [2025-03-13 21:25:03,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 108 transitions, 861 flow. Second operand has 29 states, 29 states have (on average 9.655172413793103) internal successors, (280), 29 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:25:03,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:25:03,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 46 [2025-03-13 21:25:03,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:25:06,279 INFO L124 PetriNetUnfolderBase]: 2025/3744 cut-off events. [2025-03-13 21:25:06,279 INFO L125 PetriNetUnfolderBase]: For 11246/11246 co-relation queries the response was YES. [2025-03-13 21:25:06,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13116 conditions, 3744 events. 2025/3744 cut-off events. For 11246/11246 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 21579 event pairs, 314 based on Foata normal form. 0/3726 useless extension candidates. Maximal degree in co-relation 13080. Up to 1580 conditions per place. [2025-03-13 21:25:06,299 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 190 selfloop transitions, 42 changer transitions 7/242 dead transitions. [2025-03-13 21:25:06,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 242 transitions, 2033 flow [2025-03-13 21:25:06,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 21:25:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 21:25:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 273 transitions. [2025-03-13 21:25:06,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39565217391304347 [2025-03-13 21:25:06,302 INFO L175 Difference]: Start difference. First operand has 107 places, 108 transitions, 861 flow. Second operand 15 states and 273 transitions. [2025-03-13 21:25:06,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 242 transitions, 2033 flow [2025-03-13 21:25:06,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 242 transitions, 1951 flow, removed 33 selfloop flow, removed 5 redundant places. [2025-03-13 21:25:06,326 INFO L231 Difference]: Finished difference. Result has 124 places, 130 transitions, 1137 flow [2025-03-13 21:25:06,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1137, PETRI_PLACES=124, PETRI_TRANSITIONS=130} [2025-03-13 21:25:06,326 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places. [2025-03-13 21:25:06,326 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 130 transitions, 1137 flow [2025-03-13 21:25:06,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.655172413793103) internal successors, (280), 29 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:25:06,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:06,327 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:06,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:25:06,527 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,SelfDestructingSolverStorable10 [2025-03-13 21:25:06,527 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:06,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:06,528 INFO L85 PathProgramCache]: Analyzing trace with hash 885217211, now seen corresponding path program 3 times [2025-03-13 21:25:06,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:06,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609759565] [2025-03-13 21:25:06,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:25:06,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:06,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:25:06,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:25:06,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:25:06,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:07,548 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-13 21:25:07,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:25:07,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609759565] [2025-03-13 21:25:07,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609759565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:25:07,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962583304] [2025-03-13 21:25:07,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:25:07,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:25:07,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:25:07,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:25:07,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:25:07,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:25:07,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:25:07,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:25:07,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:07,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-13 21:25:07,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:25:07,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-03-13 21:25:07,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:07,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2025-03-13 21:25:08,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-13 21:25:08,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-13 21:25:08,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2025-03-13 21:25:08,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:08,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 52 [2025-03-13 21:25:09,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 153 [2025-03-13 21:25:09,124 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-03-13 21:25:09,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 113 [2025-03-13 21:25:09,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:09,140 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 81 treesize of output 55 [2025-03-13 21:25:09,163 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-13 21:25:09,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:25:09,334 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:25:09,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-03-13 21:25:09,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:09,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:25:10,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:10,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:25:10,291 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:25:10,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-03-13 21:25:11,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:11,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 12613 treesize of output 7104 [2025-03-13 21:25:13,730 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-13 21:25:13,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962583304] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:25:13,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:25:13,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-03-13 21:25:13,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588853077] [2025-03-13 21:25:13,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:25:13,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-13 21:25:13,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:25:13,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-13 21:25:13,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2025-03-13 21:25:14,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-13 21:25:14,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 130 transitions, 1137 flow. Second operand has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:25:14,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:25:14,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-13 21:25:14,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:25:18,748 INFO L124 PetriNetUnfolderBase]: 1754/3596 cut-off events. [2025-03-13 21:25:18,748 INFO L125 PetriNetUnfolderBase]: For 18262/18262 co-relation queries the response was YES. [2025-03-13 21:25:18,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14670 conditions, 3596 events. 1754/3596 cut-off events. For 18262/18262 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 23836 event pairs, 171 based on Foata normal form. 0/3575 useless extension candidates. Maximal degree in co-relation 14625. Up to 728 conditions per place. [2025-03-13 21:25:18,789 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 189 selfloop transitions, 99 changer transitions 9/302 dead transitions. [2025-03-13 21:25:18,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 302 transitions, 2902 flow [2025-03-13 21:25:18,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 21:25:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 21:25:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 386 transitions. [2025-03-13 21:25:18,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3995859213250518 [2025-03-13 21:25:18,794 INFO L175 Difference]: Start difference. First operand has 124 places, 130 transitions, 1137 flow. Second operand 21 states and 386 transitions. [2025-03-13 21:25:18,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 302 transitions, 2902 flow [2025-03-13 21:25:18,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 302 transitions, 2814 flow, removed 30 selfloop flow, removed 5 redundant places. [2025-03-13 21:25:18,846 INFO L231 Difference]: Finished difference. Result has 150 places, 171 transitions, 1861 flow [2025-03-13 21:25:18,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1861, PETRI_PLACES=150, PETRI_TRANSITIONS=171} [2025-03-13 21:25:18,847 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 108 predicate places. [2025-03-13 21:25:18,847 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 171 transitions, 1861 flow [2025-03-13 21:25:18,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:25:18,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:18,847 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:18,855 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-13 21:25:19,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:25:19,048 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:19,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:19,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1105879109, now seen corresponding path program 4 times [2025-03-13 21:25:19,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:19,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020738759] [2025-03-13 21:25:19,050 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:25:19,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:19,091 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:25:19,275 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:25:19,276 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:25:19,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:21,434 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-13 21:25:21,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:25:21,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020738759] [2025-03-13 21:25:21,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020738759] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:25:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547806901] [2025-03-13 21:25:21,435 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:25:21,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:25:21,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:25:21,438 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-13 21:25:21,439 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-13 21:25:21,548 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:25:21,595 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:25:21,595 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:25:21,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:21,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-13 21:25:21,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:25:21,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-03-13 21:25:21,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:21,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2025-03-13 21:25:21,739 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 11 treesize of output 7 [2025-03-13 21:25:21,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-13 21:25:21,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:21,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 52 [2025-03-13 21:25:22,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:22,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2025-03-13 21:25:22,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:22,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 52 treesize of output 24 [2025-03-13 21:25:22,503 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-13 21:25:22,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:25:22,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:22,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:25:22,952 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:25:22,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-03-13 21:25:24,160 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:25:24,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-03-13 21:25:24,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:24,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:25:25,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2025-03-13 21:25:25,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:25,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 35 [2025-03-13 21:25:25,526 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-13 21:25:26,460 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-13 21:25:26,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547806901] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:25:26,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:25:26,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2025-03-13 21:25:26,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483684993] [2025-03-13 21:25:26,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:25:26,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-13 21:25:26,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:25:26,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-13 21:25:26,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2025-03-13 21:25:26,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-13 21:25:26,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 171 transitions, 1861 flow. Second operand has 30 states, 30 states have (on average 11.266666666666667) internal successors, (338), 30 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:25:26,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:25:26,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-13 21:25:26,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:25:29,700 INFO L124 PetriNetUnfolderBase]: 1277/2769 cut-off events. [2025-03-13 21:25:29,701 INFO L125 PetriNetUnfolderBase]: For 26101/26101 co-relation queries the response was YES. [2025-03-13 21:25:29,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12770 conditions, 2769 events. 1277/2769 cut-off events. For 26101/26101 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 17795 event pairs, 55 based on Foata normal form. 216/2971 useless extension candidates. Maximal degree in co-relation 12713. Up to 483 conditions per place. [2025-03-13 21:25:29,716 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 208 selfloop transitions, 130 changer transitions 14/357 dead transitions. [2025-03-13 21:25:29,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 357 transitions, 4067 flow [2025-03-13 21:25:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-13 21:25:29,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-13 21:25:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 553 transitions. [2025-03-13 21:25:29,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375679347826087 [2025-03-13 21:25:29,720 INFO L175 Difference]: Start difference. First operand has 150 places, 171 transitions, 1861 flow. Second operand 32 states and 553 transitions. [2025-03-13 21:25:29,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 357 transitions, 4067 flow [2025-03-13 21:25:29,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 357 transitions, 3618 flow, removed 200 selfloop flow, removed 16 redundant places. [2025-03-13 21:25:29,766 INFO L231 Difference]: Finished difference. Result has 170 places, 196 transitions, 2468 flow [2025-03-13 21:25:29,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2468, PETRI_PLACES=170, PETRI_TRANSITIONS=196} [2025-03-13 21:25:29,767 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 128 predicate places. [2025-03-13 21:25:29,767 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 196 transitions, 2468 flow [2025-03-13 21:25:29,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.266666666666667) internal successors, (338), 30 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:25:29,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:29,767 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:29,773 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-13 21:25:29,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:25:29,972 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:29,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:29,973 INFO L85 PathProgramCache]: Analyzing trace with hash 611586829, now seen corresponding path program 5 times [2025-03-13 21:25:29,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:29,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710473221] [2025-03-13 21:25:29,973 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:25:29,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:30,001 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:25:30,054 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:25:30,055 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:25:30,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:31,008 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-13 21:25:31,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:25:31,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710473221] [2025-03-13 21:25:31,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710473221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:25:31,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874091477] [2025-03-13 21:25:31,009 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:25:31,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:25:31,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:25:31,011 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-13 21:25:31,013 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-13 21:25:31,110 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:25:31,150 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:25:31,150 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:25:31,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:25:31,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-13 21:25:31,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:25:31,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-03-13 21:25:31,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:31,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2025-03-13 21:25:31,320 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 11 treesize of output 7 [2025-03-13 21:25:31,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-13 21:25:31,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2025-03-13 21:25:32,260 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-03-13 21:25:32,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 62 [2025-03-13 21:25:32,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:32,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 42 [2025-03-13 21:25:32,282 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-13 21:25:32,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:25:32,475 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:25:32,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-03-13 21:25:32,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:32,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:25:33,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:25:33,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-13 21:25:33,318 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-13 21:25:33,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-03-13 21:25:34,009 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 20 treesize of output 18 [2025-03-13 21:25:34,013 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 114 treesize of output 102 [2025-03-13 21:25:34,045 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 20 treesize of output 18 [2025-03-13 21:25:34,048 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 52 treesize of output 46 [2025-03-13 21:25:34,078 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 13 [2025-03-13 21:25:34,081 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 24 treesize of output 18 [2025-03-13 21:25:34,098 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 13 [2025-03-13 21:25:34,101 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 24 treesize of output 18 [2025-03-13 21:25:34,113 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 20 treesize of output 18 [2025-03-13 21:25:34,123 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 114 treesize of output 102 [2025-03-13 21:25:34,168 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 20 treesize of output 18 [2025-03-13 21:25:34,174 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 52 treesize of output 46 [2025-03-13 21:25:34,626 INFO L349 Elim1Store]: treesize reduction 5, result has 92.5 percent of original size [2025-03-13 21:25:34,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 714 treesize of output 491 [2025-03-13 21:25:35,026 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-13 21:25:35,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874091477] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:25:35,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:25:35,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-03-13 21:25:35,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299459739] [2025-03-13 21:25:35,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:25:35,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-13 21:25:35,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:25:35,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-13 21:25:35,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2025-03-13 21:25:35,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-13 21:25:35,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 196 transitions, 2468 flow. Second operand has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:25:35,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:25:35,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-13 21:25:35,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:25:37,009 INFO L124 PetriNetUnfolderBase]: 1364/2960 cut-off events. [2025-03-13 21:25:37,009 INFO L125 PetriNetUnfolderBase]: For 33752/33752 co-relation queries the response was YES. [2025-03-13 21:25:37,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15246 conditions, 2960 events. 1364/2960 cut-off events. For 33752/33752 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 19233 event pairs, 232 based on Foata normal form. 0/2945 useless extension candidates. Maximal degree in co-relation 15180. Up to 1859 conditions per place. [2025-03-13 21:25:37,028 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 204 selfloop transitions, 36 changer transitions 2/247 dead transitions. [2025-03-13 21:25:37,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 247 transitions, 3355 flow [2025-03-13 21:25:37,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:25:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:25:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2025-03-13 21:25:37,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-13 21:25:37,030 INFO L175 Difference]: Start difference. First operand has 170 places, 196 transitions, 2468 flow. Second operand 10 states and 184 transitions. [2025-03-13 21:25:37,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 247 transitions, 3355 flow [2025-03-13 21:25:37,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 247 transitions, 2939 flow, removed 150 selfloop flow, removed 15 redundant places. [2025-03-13 21:25:37,132 INFO L231 Difference]: Finished difference. Result has 167 places, 203 transitions, 2297 flow [2025-03-13 21:25:37,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2097, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2297, PETRI_PLACES=167, PETRI_TRANSITIONS=203} [2025-03-13 21:25:37,136 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 125 predicate places. [2025-03-13 21:25:37,136 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 203 transitions, 2297 flow [2025-03-13 21:25:37,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:25:37,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:25:37,137 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:37,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-13 21:25:37,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-13 21:25:37,337 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:25:37,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:25:37,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1025786986, now seen corresponding path program 1 times [2025-03-13 21:25:37,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:25:37,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398962098] [2025-03-13 21:25:37,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:25:37,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:25:37,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:25:37,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:25:37,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:25:37,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:25:37,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:25:37,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:25:37,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:25:37,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:25:37,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:25:37,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:25:37,444 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:25:37,445 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-03-13 21:25:37,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-13 21:25:37,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-13 21:25:37,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-13 21:25:37,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-03-13 21:25:37,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-03-13 21:25:37,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-13 21:25:37,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:25:37,454 INFO L422 BasicCegarLoop]: Path program histogram: [5, 4, 1, 1, 1, 1, 1, 1] [2025-03-13 21:25:37,538 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:25:37,538 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:25:37,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:25:37 BasicIcfg [2025-03-13 21:25:37,549 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:25:37,550 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:25:37,550 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:25:37,550 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:25:37,555 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:24:29" (3/4) ... [2025-03-13 21:25:37,556 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 21:25:37,668 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 28. [2025-03-13 21:25:37,740 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:25:37,741 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:25:37,741 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:25:37,741 INFO L158 Benchmark]: Toolchain (without parser) took 70221.83ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 104.0MB in the beginning and 487.1MB in the end (delta: -383.1MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2025-03-13 21:25:37,742 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:25:37,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.77ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 73.5MB in the end (delta: 30.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-13 21:25:37,742 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.64ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 70.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:25:37,743 INFO L158 Benchmark]: Boogie Preprocessor took 49.86ms. Allocated memory is still 142.6MB. Free memory was 70.4MB in the beginning and 67.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:25:37,743 INFO L158 Benchmark]: IcfgBuilder took 993.14ms. Allocated memory is still 142.6MB. Free memory was 67.5MB in the beginning and 86.9MB in the end (delta: -19.4MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2025-03-13 21:25:37,743 INFO L158 Benchmark]: TraceAbstraction took 68397.26ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 85.7MB in the beginning and 503.9MB in the end (delta: -418.2MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2025-03-13 21:25:37,744 INFO L158 Benchmark]: Witness Printer took 190.75ms. Allocated memory is still 587.2MB. Free memory was 503.9MB in the beginning and 487.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:25:37,745 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 542.77ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 73.5MB in the end (delta: 30.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.64ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 70.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.86ms. Allocated memory is still 142.6MB. Free memory was 70.4MB in the beginning and 67.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 993.14ms. Allocated memory is still 142.6MB. Free memory was 67.5MB in the beginning and 86.9MB in the end (delta: -19.4MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. * TraceAbstraction took 68397.26ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 85.7MB in the beginning and 503.9MB in the end (delta: -418.2MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Witness Printer took 190.75ms. Allocated memory is still 587.2MB. Free memory was 503.9MB in the beginning and 487.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1063] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1064] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, id2=-1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; [L1037] 2 i=0 VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] COND TRUE 2 i<(20) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i++ VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1009] 1 value = __VERIFIER_nondet_int() [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) [L1018] 1 i=0 VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1018] COND TRUE 1 i<((20)-1) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value [L1026] 1 enqueue_flag=(0) [L1027] 1 dequeue_flag=(1) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=1] [L1037] COND TRUE 2 i<(20) VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (20)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1002] 2 q->head++ [L1003] 2 return x; [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] - UnprovableResult [Line: 1059]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 68.2s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 24.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1774 SdHoareTripleChecker+Valid, 18.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1728 mSDsluCounter, 1270 SdHoareTripleChecker+Invalid, 17.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1236 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8335 IncrementalHoareTripleChecker+Invalid, 8476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 34 mSDtfsCounter, 8335 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 436 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1974 ImplicationChecksByTransitivity, 16.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2468occurred in iteration=13, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 40.8s InterpolantComputationTime, 455 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 542 ConstructedInterpolants, 116 QuantifiedInterpolants, 82878 SizeOfPredicates, 207 NumberOfNonLiveVariables, 1770 ConjunctsInSsa, 212 ConjunctsInUnsatCore, 24 InterpolantComputations, 9 PerfectInterpolantSequences, 0/63 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-13 21:25:37,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE