./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 735b3cc8 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-?-735b3cc-m [2025-03-14 00:43:03,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:43:03,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:43:03,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:43:03,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:43:03,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:43:03,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:43:03,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:43:03,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:43:03,638 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:43:03,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:43:03,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:43:03,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:43:03,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:43:03,639 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:43:03,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:43:03,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:43:03,639 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:43:03,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:43:03,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:43:03,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:43:03,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:43:03,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:43:03,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:43:03,640 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:43:03,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:43:03,640 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:43:03,640 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:43:03,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:43:03,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:43:03,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:43:03,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:43:03,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:43:03,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:43:03,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:43:03,641 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:43:03,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:43:03,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:43:03,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:43:03,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:43:03,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:43:03,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:43:03,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:43:03,641 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-14 00:43:03,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:43:03,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:43:03,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:43:03,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:43:03,873 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:43:03,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue.i [2025-03-14 00:43:04,996 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed5f3d058/6df2e5fcd0ba4d42b66b5ed19c392dcc/FLAG9b84eeab9 [2025-03-14 00:43:05,279 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:43:05,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2025-03-14 00:43:05,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed5f3d058/6df2e5fcd0ba4d42b66b5ed19c392dcc/FLAG9b84eeab9 [2025-03-14 00:43:05,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed5f3d058/6df2e5fcd0ba4d42b66b5ed19c392dcc [2025-03-14 00:43:05,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:43:05,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:43:05,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:43:05,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:43:05,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:43:05,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:43:05" (1/1) ... [2025-03-14 00:43:05,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537612f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:43:05, skipping insertion in model container [2025-03-14 00:43:05,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:43:05" (1/1) ... [2025-03-14 00:43:05,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:43:05,831 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-14 00:43:05,838 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-14 00:43:05,843 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-14 00:43:05,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:43:05,863 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:43:05,906 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-14 00:43:05,907 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-14 00:43:05,908 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-14 00:43:05,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:43:05,949 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:43:05,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:43:05 WrapperNode [2025-03-14 00:43:05,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:43:05,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:43:05,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:43:05,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:43:05,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:43:05" (1/1) ... [2025-03-14 00:43:05,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:43:05" (1/1) ... [2025-03-14 00:43:05,983 INFO L138 Inliner]: procedures = 274, calls = 104, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 283 [2025-03-14 00:43:05,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:43:05,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:43:05,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:43:05,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:43:05,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:43:05" (1/1) ... [2025-03-14 00:43:05,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:43:05" (1/1) ... [2025-03-14 00:43:05,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:43:05" (1/1) ... [2025-03-14 00:43:06,003 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-14 00:43:06,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:43:05" (1/1) ... [2025-03-14 00:43:06,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:43:05" (1/1) ... [2025-03-14 00:43:06,015 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:43:05" (1/1) ... [2025-03-14 00:43:06,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:43:05" (1/1) ... [2025-03-14 00:43:06,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:43:05" (1/1) ... [2025-03-14 00:43:06,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:43:05" (1/1) ... [2025-03-14 00:43:06,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:43:06,024 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:43:06,024 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:43:06,024 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:43:06,024 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:43:05" (1/1) ... [2025-03-14 00:43:06,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:43:06,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:43:06,046 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-14 00:43:06,047 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-14 00:43:06,062 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-14 00:43:06,062 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-14 00:43:06,062 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-14 00:43:06,062 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-14 00:43:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 00:43:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 00:43:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 00:43:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-14 00:43:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-14 00:43:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-14 00:43:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 00:43:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 00:43:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-14 00:43:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-14 00:43:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-14 00:43:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 00:43:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:43:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:43:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 00:43:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-14 00:43:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-14 00:43:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-14 00:43:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:43:06,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:43:06,066 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:43:06,176 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:43:06,179 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:43:06,538 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:43:06,539 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:43:06,539 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:43:07,067 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:43:07,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:43:07 BoogieIcfgContainer [2025-03-14 00:43:07,068 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:43:07,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:43:07,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:43:07,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:43:07,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:43:05" (1/3) ... [2025-03-14 00:43:07,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0fdc85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:43:07, skipping insertion in model container [2025-03-14 00:43:07,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:43:05" (2/3) ... [2025-03-14 00:43:07,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0fdc85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:43:07, skipping insertion in model container [2025-03-14 00:43:07,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:43:07" (3/3) ... [2025-03-14 00:43:07,077 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-03-14 00:43:07,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:43:07,095 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-14 00:43:07,095 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:43:07,165 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 00:43:07,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 46 transitions, 106 flow [2025-03-14 00:43:07,229 INFO L124 PetriNetUnfolderBase]: 7/44 cut-off events. [2025-03-14 00:43:07,233 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:43:07,238 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-14 00:43:07,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 46 transitions, 106 flow [2025-03-14 00:43:07,242 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 42 transitions, 93 flow [2025-03-14 00:43:07,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:43:07,263 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;@68319f91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:43:07,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-14 00:43:07,275 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:43:07,275 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-14 00:43:07,275 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:43:07,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:43:07,276 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-14 00:43:07,277 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-14 00:43:07,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:43:07,282 INFO L85 PathProgramCache]: Analyzing trace with hash 658785, now seen corresponding path program 1 times [2025-03-14 00:43:07,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:43:07,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179714700] [2025-03-14 00:43:07,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:43:07,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:43:07,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-14 00:43:07,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-14 00:43:07,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:43:07,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:43:07,487 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-14 00:43:07,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:43:07,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179714700] [2025-03-14 00:43:07,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179714700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:43:07,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:43:07,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:43:07,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071192822] [2025-03-14 00:43:07,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:43:07,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 00:43:07,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:43:07,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 00:43:07,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 00:43:07,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-14 00:43:07,521 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-14 00:43:07,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:43:07,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-14 00:43:07,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:43:07,752 INFO L124 PetriNetUnfolderBase]: 428/771 cut-off events. [2025-03-14 00:43:07,753 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-14 00:43:07,754 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-14 00:43:07,762 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 30 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2025-03-14 00:43:07,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 143 flow [2025-03-14 00:43:07,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 00:43:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 00:43:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2025-03-14 00:43:07,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2025-03-14 00:43:07,774 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 93 flow. Second operand 2 states and 53 transitions. [2025-03-14 00:43:07,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 143 flow [2025-03-14 00:43:07,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 00:43:07,781 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 78 flow [2025-03-14 00:43:07,783 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-14 00:43:07,787 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2025-03-14 00:43:07,787 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 78 flow [2025-03-14 00:43:07,787 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-14 00:43:07,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:43:07,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:43:07,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:43:07,788 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-14 00:43:07,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:43:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash 361006736, now seen corresponding path program 1 times [2025-03-14 00:43:07,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:43:07,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651811888] [2025-03-14 00:43:07,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:43:07,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:43:07,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 00:43:07,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 00:43:07,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:43:07,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:43:07,963 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-14 00:43:07,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:43:07,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651811888] [2025-03-14 00:43:07,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651811888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:43:07,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:43:07,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:43:07,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321273587] [2025-03-14 00:43:07,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:43:07,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:43:07,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:43:07,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:43:07,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:43:07,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-14 00:43:07,965 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-14 00:43:07,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:43:07,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-14 00:43:07,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:43:08,121 INFO L124 PetriNetUnfolderBase]: 408/749 cut-off events. [2025-03-14 00:43:08,122 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-14 00:43:08,124 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-14 00:43:08,127 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 39 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2025-03-14 00:43:08,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 184 flow [2025-03-14 00:43:08,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:43:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:43:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-14 00:43:08,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2025-03-14 00:43:08,130 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 78 flow. Second operand 3 states and 72 transitions. [2025-03-14 00:43:08,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 184 flow [2025-03-14 00:43:08,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 00:43:08,131 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 80 flow [2025-03-14 00:43:08,131 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-14 00:43:08,132 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2025-03-14 00:43:08,132 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 80 flow [2025-03-14 00:43:08,132 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-14 00:43:08,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:43:08,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:43:08,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:43:08,132 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-14 00:43:08,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:43:08,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1693691389, now seen corresponding path program 1 times [2025-03-14 00:43:08,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:43:08,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059266365] [2025-03-14 00:43:08,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:43:08,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:43:08,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 00:43:08,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 00:43:08,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:43:08,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:43:08,640 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-14 00:43:08,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:43:08,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059266365] [2025-03-14 00:43:08,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059266365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:43:08,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:43:08,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:43:08,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9348844] [2025-03-14 00:43:08,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:43:08,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:43:08,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:43:08,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:43:08,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:43:08,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-14 00:43:08,642 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-14 00:43:08,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:43:08,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-14 00:43:08,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:43:08,940 INFO L124 PetriNetUnfolderBase]: 674/1238 cut-off events. [2025-03-14 00:43:08,941 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-14 00:43:08,942 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-14 00:43:08,947 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 70 selfloop transitions, 10 changer transitions 3/90 dead transitions. [2025-03-14 00:43:08,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 90 transitions, 367 flow [2025-03-14 00:43:08,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:43:08,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:43:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-03-14 00:43:08,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5253623188405797 [2025-03-14 00:43:08,949 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 80 flow. Second operand 6 states and 145 transitions. [2025-03-14 00:43:08,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 90 transitions, 367 flow [2025-03-14 00:43:08,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 90 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:43:08,951 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 144 flow [2025-03-14 00:43:08,951 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-14 00:43:08,952 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2025-03-14 00:43:08,952 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 144 flow [2025-03-14 00:43:08,952 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-14 00:43:08,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:43:08,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:43:08,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:43:08,952 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-14 00:43:08,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:43:08,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1046080674, now seen corresponding path program 1 times [2025-03-14 00:43:08,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:43:08,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849908986] [2025-03-14 00:43:08,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:43:08,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:43:08,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-14 00:43:08,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-14 00:43:08,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:43:08,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:43:09,010 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-14 00:43:09,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:43:09,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849908986] [2025-03-14 00:43:09,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849908986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:43:09,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:43:09,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:43:09,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435199330] [2025-03-14 00:43:09,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:43:09,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:43:09,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:43:09,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:43:09,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:43:09,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-14 00:43:09,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-14 00:43:09,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:43:09,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-14 00:43:09,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:43:09,130 INFO L124 PetriNetUnfolderBase]: 419/804 cut-off events. [2025-03-14 00:43:09,130 INFO L125 PetriNetUnfolderBase]: For 111/114 co-relation queries the response was YES. [2025-03-14 00:43:09,131 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-14 00:43:09,133 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 36 selfloop transitions, 4 changer transitions 3/49 dead transitions. [2025-03-14 00:43:09,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 213 flow [2025-03-14 00:43:09,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:43:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:43:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-14 00:43:09,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5289855072463768 [2025-03-14 00:43:09,135 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 144 flow. Second operand 3 states and 73 transitions. [2025-03-14 00:43:09,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 213 flow [2025-03-14 00:43:09,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 207 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 00:43:09,136 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 106 flow [2025-03-14 00:43:09,136 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-14 00:43:09,137 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2025-03-14 00:43:09,137 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 106 flow [2025-03-14 00:43:09,137 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-14 00:43:09,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:43:09,137 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-14 00:43:09,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:43:09,137 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-14 00:43:09,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:43:09,139 INFO L85 PathProgramCache]: Analyzing trace with hash 189939549, now seen corresponding path program 1 times [2025-03-14 00:43:09,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:43:09,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729113759] [2025-03-14 00:43:09,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:43:09,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:43:09,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 00:43:09,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 00:43:09,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:43:09,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:43:09,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-14 00:43:09,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:43:09,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729113759] [2025-03-14 00:43:09,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729113759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:43:09,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:43:09,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:43:09,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761856521] [2025-03-14 00:43:09,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:43:09,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:43:09,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:43:09,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:43:09,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:43:09,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-14 00:43:09,295 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-14 00:43:09,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:43:09,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-14 00:43:09,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:43:09,391 INFO L124 PetriNetUnfolderBase]: 249/543 cut-off events. [2025-03-14 00:43:09,391 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-03-14 00:43:09,392 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-14 00:43:09,393 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 33 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2025-03-14 00:43:09,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 207 flow [2025-03-14 00:43:09,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:43:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:43:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-14 00:43:09,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2025-03-14 00:43:09,394 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 106 flow. Second operand 3 states and 70 transitions. [2025-03-14 00:43:09,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 207 flow [2025-03-14 00:43:09,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 197 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-14 00:43:09,396 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 108 flow [2025-03-14 00:43:09,397 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-14 00:43:09,398 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2025-03-14 00:43:09,398 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 108 flow [2025-03-14 00:43:09,398 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-14 00:43:09,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:43:09,398 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-14 00:43:09,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:43:09,398 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-14 00:43:09,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:43:09,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2027864628, now seen corresponding path program 1 times [2025-03-14 00:43:09,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:43:09,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619973288] [2025-03-14 00:43:09,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:43:09,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:43:09,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 00:43:09,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 00:43:09,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:43:09,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:43:10,846 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-14 00:43:10,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:43:10,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619973288] [2025-03-14 00:43:10,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619973288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:43:10,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:43:10,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:43:10,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326575418] [2025-03-14 00:43:10,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:43:10,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 00:43:10,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:43:10,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 00:43:10,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-14 00:43:10,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-14 00:43:10,876 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-14 00:43:10,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:43:10,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-14 00:43:10,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:43:11,313 INFO L124 PetriNetUnfolderBase]: 370/811 cut-off events. [2025-03-14 00:43:11,314 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2025-03-14 00:43:11,316 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-14 00:43:11,320 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 63 selfloop transitions, 16 changer transitions 8/93 dead transitions. [2025-03-14 00:43:11,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 93 transitions, 459 flow [2025-03-14 00:43:11,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 00:43:11,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 00:43:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2025-03-14 00:43:11,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4251207729468599 [2025-03-14 00:43:11,323 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 108 flow. Second operand 9 states and 176 transitions. [2025-03-14 00:43:11,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 93 transitions, 459 flow [2025-03-14 00:43:11,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 93 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:43:11,327 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 214 flow [2025-03-14 00:43:11,328 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-14 00:43:11,329 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2025-03-14 00:43:11,329 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 214 flow [2025-03-14 00:43:11,330 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-14 00:43:11,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:43:11,330 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-14 00:43:11,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:43:11,330 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-14 00:43:11,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:43:11,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1632111414, now seen corresponding path program 2 times [2025-03-14 00:43:11,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:43:11,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165930703] [2025-03-14 00:43:11,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:43:11,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:43:11,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-03-14 00:43:11,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 00:43:11,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:43:11,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:43:12,643 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-14 00:43:12,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:43:12,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165930703] [2025-03-14 00:43:12,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165930703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:43:12,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:43:12,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:43:12,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115651025] [2025-03-14 00:43:12,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:43:12,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 00:43:12,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:43:12,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 00:43:12,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-14 00:43:12,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-14 00:43:12,662 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-14 00:43:12,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:43:12,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-14 00:43:12,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:43:13,011 INFO L124 PetriNetUnfolderBase]: 479/1065 cut-off events. [2025-03-14 00:43:13,011 INFO L125 PetriNetUnfolderBase]: For 859/860 co-relation queries the response was YES. [2025-03-14 00:43:13,013 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-14 00:43:13,016 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 69 selfloop transitions, 15 changer transitions 4/94 dead transitions. [2025-03-14 00:43:13,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 94 transitions, 580 flow [2025-03-14 00:43:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 00:43:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 00:43:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2025-03-14 00:43:13,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40096618357487923 [2025-03-14 00:43:13,018 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 214 flow. Second operand 9 states and 166 transitions. [2025-03-14 00:43:13,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 94 transitions, 580 flow [2025-03-14 00:43:13,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 94 transitions, 562 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-14 00:43:13,022 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 359 flow [2025-03-14 00:43:13,023 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-14 00:43:13,023 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2025-03-14 00:43:13,023 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 359 flow [2025-03-14 00:43:13,023 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-14 00:43:13,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:43:13,023 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-14 00:43:13,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:43:13,024 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-14 00:43:13,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:43:13,024 INFO L85 PathProgramCache]: Analyzing trace with hash 876178102, now seen corresponding path program 3 times [2025-03-14 00:43:13,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:43:13,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469795184] [2025-03-14 00:43:13,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:43:13,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:43:13,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 1 equivalence classes. [2025-03-14 00:43:13,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 00:43:13,063 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 00:43:13,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:43:14,198 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-14 00:43:14,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:43:14,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469795184] [2025-03-14 00:43:14,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469795184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:43:14,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:43:14,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:43:14,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113003204] [2025-03-14 00:43:14,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:43:14,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 00:43:14,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:43:14,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 00:43:14,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-14 00:43:14,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-14 00:43:14,210 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-14 00:43:14,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:43:14,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-14 00:43:14,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:43:14,743 INFO L124 PetriNetUnfolderBase]: 599/1317 cut-off events. [2025-03-14 00:43:14,744 INFO L125 PetriNetUnfolderBase]: For 1670/1672 co-relation queries the response was YES. [2025-03-14 00:43:14,746 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-14 00:43:14,751 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 90 selfloop transitions, 32 changer transitions 6/134 dead transitions. [2025-03-14 00:43:14,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 134 transitions, 900 flow [2025-03-14 00:43:14,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 00:43:14,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 00:43:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 230 transitions. [2025-03-14 00:43:14,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-14 00:43:14,753 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 359 flow. Second operand 12 states and 230 transitions. [2025-03-14 00:43:14,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 134 transitions, 900 flow [2025-03-14 00:43:14,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 134 transitions, 854 flow, removed 23 selfloop flow, removed 0 redundant places. [2025-03-14 00:43:14,786 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 483 flow [2025-03-14 00:43:14,787 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-14 00:43:14,789 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2025-03-14 00:43:14,789 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 483 flow [2025-03-14 00:43:14,789 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-14 00:43:14,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:43:14,789 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-14 00:43:14,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:43:14,790 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-14 00:43:14,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:43:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1756026570, now seen corresponding path program 4 times [2025-03-14 00:43:14,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:43:14,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247195764] [2025-03-14 00:43:14,791 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:43:14,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:43:14,807 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-14 00:43:14,840 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 00:43:14,840 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:43:14,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:43:15,662 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-14 00:43:15,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:43:15,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247195764] [2025-03-14 00:43:15,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247195764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:43:15,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:43:15,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:43:15,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357170055] [2025-03-14 00:43:15,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:43:15,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 00:43:15,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:43:15,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 00:43:15,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-14 00:43:15,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-14 00:43:15,692 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-14 00:43:15,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:43:15,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-14 00:43:15,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:43:16,095 INFO L124 PetriNetUnfolderBase]: 685/1522 cut-off events. [2025-03-14 00:43:16,095 INFO L125 PetriNetUnfolderBase]: For 2905/2905 co-relation queries the response was YES. [2025-03-14 00:43:16,099 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-14 00:43:16,104 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 86 selfloop transitions, 25 changer transitions 8/125 dead transitions. [2025-03-14 00:43:16,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 968 flow [2025-03-14 00:43:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 00:43:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 00:43:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2025-03-14 00:43:16,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4323671497584541 [2025-03-14 00:43:16,106 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 483 flow. Second operand 9 states and 179 transitions. [2025-03-14 00:43:16,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 968 flow [2025-03-14 00:43:16,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 125 transitions, 892 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-03-14 00:43:16,117 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 627 flow [2025-03-14 00:43:16,117 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-14 00:43:16,118 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2025-03-14 00:43:16,118 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 627 flow [2025-03-14 00:43:16,119 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-14 00:43:16,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:43:16,119 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-14 00:43:16,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:43:16,119 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-14 00:43:16,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:43:16,119 INFO L85 PathProgramCache]: Analyzing trace with hash -379463315, now seen corresponding path program 1 times [2025-03-14 00:43:16,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:43:16,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860598199] [2025-03-14 00:43:16,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:43:16,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:43:16,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 00:43:16,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 00:43:16,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:43:16,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:43:17,277 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-14 00:43:17,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:43:17,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860598199] [2025-03-14 00:43:17,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860598199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:43:17,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720503414] [2025-03-14 00:43:17,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:43:17,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:43:17,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:43:17,282 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-14 00:43:17,291 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-14 00:43:17,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 00:43:17,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 00:43:17,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:43:17,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:43:17,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-14 00:43:17,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:43:17,470 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-14 00:43:17,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:43:17,614 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-14 00:43:17,659 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-14 00:43:17,952 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-14 00:43:18,007 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-14 00:43:18,887 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-03-14 00:43:18,887 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-14 00:43:18,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:43:18,894 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-14 00:43:18,909 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-14 00:43:18,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:43:19,188 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-14 00:43:19,188 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-14 00:43:19,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:43:19,202 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-14 00:43:20,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:43:20,088 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-14 00:43:20,100 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-14 00:43:20,101 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-14 00:43:20,761 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-14 00:43:20,768 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-14 00:43:20,812 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-14 00:43:20,815 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-14 00:43:20,825 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-14 00:43:20,829 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-14 00:43:20,836 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-14 00:43:20,841 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-14 00:43:20,863 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-14 00:43:20,870 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-14 00:43:20,890 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-14 00:43:20,895 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-14 00:43:21,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:43:21,241 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-14 00:43:23,395 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-14 00:43:23,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720503414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:43:23,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:43:23,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-03-14 00:43:23,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884563693] [2025-03-14 00:43:23,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:43:23,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-14 00:43:23,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:43:23,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-14 00:43:23,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2025-03-14 00:43:23,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-14 00:43:23,898 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-14 00:43:23,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:43:23,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-14 00:43:23,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:43:25,699 INFO L124 PetriNetUnfolderBase]: 916/1908 cut-off events. [2025-03-14 00:43:25,700 INFO L125 PetriNetUnfolderBase]: For 4344/4346 co-relation queries the response was YES. [2025-03-14 00:43:25,704 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-14 00:43:25,710 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 131 selfloop transitions, 38 changer transitions 2/176 dead transitions. [2025-03-14 00:43:25,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 176 transitions, 1356 flow [2025-03-14 00:43:25,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 00:43:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 00:43:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 281 transitions. [2025-03-14 00:43:25,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38179347826086957 [2025-03-14 00:43:25,712 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 627 flow. Second operand 16 states and 281 transitions. [2025-03-14 00:43:25,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 176 transitions, 1356 flow [2025-03-14 00:43:25,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 176 transitions, 1274 flow, removed 38 selfloop flow, removed 2 redundant places. [2025-03-14 00:43:25,726 INFO L231 Difference]: Finished difference. Result has 107 places, 108 transitions, 861 flow [2025-03-14 00:43:25,726 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-14 00:43:25,726 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2025-03-14 00:43:25,726 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 108 transitions, 861 flow [2025-03-14 00:43:25,727 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-14 00:43:25,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:43:25,727 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-14 00:43:25,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-14 00:43:25,927 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-14 00:43:25,927 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-14 00:43:25,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:43:25,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1827577383, now seen corresponding path program 2 times [2025-03-14 00:43:25,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:43:25,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577995330] [2025-03-14 00:43:25,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:43:25,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:43:25,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-14 00:43:25,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 00:43:25,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:43:25,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:43:26,989 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-14 00:43:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:43:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577995330] [2025-03-14 00:43:26,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577995330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:43:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837522123] [2025-03-14 00:43:26,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:43:26,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:43:26,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:43:26,995 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-14 00:43:26,996 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-14 00:43:27,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-14 00:43:27,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 00:43:27,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:43:27,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:43:27,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-14 00:43:27,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:43:27,281 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-14 00:43:27,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:43:27,378 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-14 00:43:27,402 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-14 00:43:27,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 00:43:27,672 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-14 00:43:27,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:43:27,702 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-14 00:43:28,312 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-03-14 00:43:28,312 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-14 00:43:28,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:43:28,320 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-14 00:43:28,340 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-14 00:43:28,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:43:28,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:43:28,514 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-14 00:43:28,523 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-14 00:43:28,523 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-14 00:43:41,045 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-14 00:43:41,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837522123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:43:41,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:43:41,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 28 [2025-03-14 00:43:41,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78631255] [2025-03-14 00:43:41,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:43:41,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-14 00:43:41,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:43:41,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-14 00:43:41,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=666, Unknown=2, NotChecked=0, Total=812 [2025-03-14 00:43:45,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 00:43:45,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 46 [2025-03-14 00:43:45,528 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-14 00:43:45,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:43:45,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 46 [2025-03-14 00:43:45,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:43:49,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 00:43:50,970 INFO L124 PetriNetUnfolderBase]: 2025/3744 cut-off events. [2025-03-14 00:43:50,970 INFO L125 PetriNetUnfolderBase]: For 11246/11246 co-relation queries the response was YES. [2025-03-14 00:43:50,979 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-14 00:43:50,989 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 190 selfloop transitions, 42 changer transitions 7/242 dead transitions. [2025-03-14 00:43:50,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 242 transitions, 2033 flow [2025-03-14 00:43:50,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 00:43:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 00:43:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 273 transitions. [2025-03-14 00:43:50,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39565217391304347 [2025-03-14 00:43:50,994 INFO L175 Difference]: Start difference. First operand has 107 places, 108 transitions, 861 flow. Second operand 15 states and 273 transitions. [2025-03-14 00:43:50,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 242 transitions, 2033 flow [2025-03-14 00:43:51,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 242 transitions, 1951 flow, removed 33 selfloop flow, removed 5 redundant places. [2025-03-14 00:43:51,018 INFO L231 Difference]: Finished difference. Result has 124 places, 130 transitions, 1137 flow [2025-03-14 00:43:51,018 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-14 00:43:51,019 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places. [2025-03-14 00:43:51,019 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 130 transitions, 1137 flow [2025-03-14 00:43:51,019 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-14 00:43:51,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:43:51,019 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-14 00:43:51,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 00:43:51,222 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-14 00:43:51,222 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-14 00:43:51,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:43:51,223 INFO L85 PathProgramCache]: Analyzing trace with hash 885217211, now seen corresponding path program 3 times [2025-03-14 00:43:51,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:43:51,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146958898] [2025-03-14 00:43:51,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:43:51,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:43:51,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-14 00:43:51,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 00:43:51,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 00:43:51,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:43:52,520 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-14 00:43:52,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:43:52,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146958898] [2025-03-14 00:43:52,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146958898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:43:52,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832756016] [2025-03-14 00:43:52,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:43:52,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:43:52,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:43:52,523 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-14 00:43:52,524 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-14 00:43:52,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-14 00:43:52,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 00:43:52,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 00:43:52,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:43:52,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-14 00:43:52,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:43:52,782 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-14 00:43:52,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:43:52,874 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-14 00:43:52,911 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-14 00:43:53,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 00:43:53,276 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-14 00:43:53,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:43:53,317 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-14 00:43:54,089 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-14 00:43:54,104 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-03-14 00:43:54,104 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-14 00:43:54,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:43:54,114 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-14 00:43:54,138 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-14 00:43:54,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:43:54,338 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-14 00:43:54,338 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-14 00:43:54,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:43:54,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-03-14 00:43:55,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:43:55,248 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-14 00:43:55,266 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-14 00:43:55,266 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-14 00:43:56,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:43:56,546 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-14 00:43:58,903 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-14 00:43:58,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832756016] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:43:58,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:43:58,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-03-14 00:43:58,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130720984] [2025-03-14 00:43:58,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:43:58,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-14 00:43:58,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:43:58,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-14 00:43:58,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2025-03-14 00:43:59,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-14 00:43:59,525 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-14 00:43:59,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:43:59,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-14 00:43:59,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:04,550 INFO L124 PetriNetUnfolderBase]: 1754/3596 cut-off events. [2025-03-14 00:44:04,550 INFO L125 PetriNetUnfolderBase]: For 18262/18262 co-relation queries the response was YES. [2025-03-14 00:44:04,564 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 23825 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-14 00:44:04,576 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 189 selfloop transitions, 99 changer transitions 9/302 dead transitions. [2025-03-14 00:44:04,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 302 transitions, 2902 flow [2025-03-14 00:44:04,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 00:44:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 00:44:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 386 transitions. [2025-03-14 00:44:04,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3995859213250518 [2025-03-14 00:44:04,588 INFO L175 Difference]: Start difference. First operand has 124 places, 130 transitions, 1137 flow. Second operand 21 states and 386 transitions. [2025-03-14 00:44:04,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 302 transitions, 2902 flow [2025-03-14 00:44:04,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 302 transitions, 2814 flow, removed 30 selfloop flow, removed 5 redundant places. [2025-03-14 00:44:04,641 INFO L231 Difference]: Finished difference. Result has 150 places, 171 transitions, 1861 flow [2025-03-14 00:44:04,643 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-14 00:44:04,644 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 108 predicate places. [2025-03-14 00:44:04,644 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 171 transitions, 1861 flow [2025-03-14 00:44:04,644 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-14 00:44:04,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:04,644 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-14 00:44:04,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 00:44:04,844 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-14 00:44:04,845 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-14 00:44:04,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:04,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1105879109, now seen corresponding path program 4 times [2025-03-14 00:44:04,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:04,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639332660] [2025-03-14 00:44:04,845 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:44:04,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:04,856 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-14 00:44:04,881 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 00:44:04,881 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:44:04,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:05,652 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-14 00:44:05,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:05,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639332660] [2025-03-14 00:44:05,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639332660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:44:05,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101754009] [2025-03-14 00:44:05,652 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:44:05,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:05,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:05,654 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-14 00:44:05,655 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-14 00:44:05,746 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-14 00:44:05,783 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 00:44:05,783 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:44:05,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:05,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-14 00:44:05,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:44:05,797 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-14 00:44:05,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:05,896 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-14 00:44:05,932 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-14 00:44:06,088 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-14 00:44:06,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:06,095 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-14 00:44:06,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:06,580 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-14 00:44:06,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:06,584 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-14 00:44:06,587 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-14 00:44:06,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:44:06,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:06,975 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-14 00:44:06,986 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-14 00:44:06,986 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-14 00:44:07,987 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-14 00:44:07,987 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-14 00:44:07,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:07,994 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-14 00:44:09,197 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-14 00:44:09,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:09,268 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-14 00:44:09,293 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-14 00:44:10,132 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-14 00:44:10,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101754009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:44:10,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:44:10,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2025-03-14 00:44:10,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329973166] [2025-03-14 00:44:10,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:44:10,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-14 00:44:10,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:10,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-14 00:44:10,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2025-03-14 00:44:10,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-14 00:44:10,416 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-14 00:44:10,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:10,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-14 00:44:10,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:13,722 INFO L124 PetriNetUnfolderBase]: 1277/2769 cut-off events. [2025-03-14 00:44:13,722 INFO L125 PetriNetUnfolderBase]: For 26101/26101 co-relation queries the response was YES. [2025-03-14 00:44:13,732 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 17808 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-14 00:44:13,739 INFO L140 encePairwiseOnDemand]: 30/46 looper letters, 208 selfloop transitions, 130 changer transitions 14/357 dead transitions. [2025-03-14 00:44:13,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 357 transitions, 4067 flow [2025-03-14 00:44:13,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-14 00:44:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-14 00:44:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 553 transitions. [2025-03-14 00:44:13,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375679347826087 [2025-03-14 00:44:13,741 INFO L175 Difference]: Start difference. First operand has 150 places, 171 transitions, 1861 flow. Second operand 32 states and 553 transitions. [2025-03-14 00:44:13,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 357 transitions, 4067 flow [2025-03-14 00:44:13,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 357 transitions, 3618 flow, removed 200 selfloop flow, removed 16 redundant places. [2025-03-14 00:44:13,788 INFO L231 Difference]: Finished difference. Result has 170 places, 196 transitions, 2468 flow [2025-03-14 00:44:13,788 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-14 00:44:13,789 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 128 predicate places. [2025-03-14 00:44:13,789 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 196 transitions, 2468 flow [2025-03-14 00:44:13,789 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-14 00:44:13,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:13,789 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-14 00:44:13,796 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-14 00:44:13,989 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-14 00:44:13,990 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-14 00:44:13,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:13,990 INFO L85 PathProgramCache]: Analyzing trace with hash 611586829, now seen corresponding path program 5 times [2025-03-14 00:44:13,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:13,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396157361] [2025-03-14 00:44:13,990 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:44:13,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:14,002 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-14 00:44:14,038 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 00:44:14,038 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:44:14,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:14,895 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-14 00:44:14,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:14,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396157361] [2025-03-14 00:44:14,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396157361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:44:14,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237031733] [2025-03-14 00:44:14,895 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:44:14,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:14,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:14,897 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-14 00:44:14,899 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-14 00:44:14,988 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-14 00:44:15,022 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 00:44:15,022 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:44:15,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:15,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-14 00:44:15,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:44:15,033 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-14 00:44:15,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:15,090 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-14 00:44:15,148 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-14 00:44:15,355 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-14 00:44:15,406 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-14 00:44:16,003 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-03-14 00:44:16,003 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-14 00:44:16,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:16,007 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-14 00:44:16,025 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-14 00:44:16,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:44:16,268 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-14 00:44:16,268 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-14 00:44:16,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:16,283 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-14 00:44:17,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:17,211 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-14 00:44:17,227 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-14 00:44:17,227 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-14 00:44:17,994 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-14 00:44:17,998 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-14 00:44:18,027 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-14 00:44:18,030 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-14 00:44:18,058 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-14 00:44:18,061 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-14 00:44:18,069 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-14 00:44:18,072 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-14 00:44:18,081 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-14 00:44:18,087 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-14 00:44:18,121 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-14 00:44:18,127 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-14 00:44:18,588 INFO L349 Elim1Store]: treesize reduction 5, result has 92.5 percent of original size [2025-03-14 00:44:18,589 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-14 00:44:19,003 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-14 00:44:19,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237031733] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:44:19,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:44:19,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-03-14 00:44:19,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056797399] [2025-03-14 00:44:19,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:44:19,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-14 00:44:19,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:19,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-14 00:44:19,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2025-03-14 00:44:19,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-14 00:44:19,407 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-14 00:44:19,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:19,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-14 00:44:19,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:21,310 INFO L124 PetriNetUnfolderBase]: 1364/2960 cut-off events. [2025-03-14 00:44:21,310 INFO L125 PetriNetUnfolderBase]: For 33752/33752 co-relation queries the response was YES. [2025-03-14 00:44:21,322 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 19209 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-14 00:44:21,329 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 204 selfloop transitions, 36 changer transitions 2/247 dead transitions. [2025-03-14 00:44:21,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 247 transitions, 3355 flow [2025-03-14 00:44:21,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:44:21,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:44:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2025-03-14 00:44:21,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-14 00:44:21,330 INFO L175 Difference]: Start difference. First operand has 170 places, 196 transitions, 2468 flow. Second operand 10 states and 184 transitions. [2025-03-14 00:44:21,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 247 transitions, 3355 flow [2025-03-14 00:44:21,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 247 transitions, 2939 flow, removed 150 selfloop flow, removed 15 redundant places. [2025-03-14 00:44:21,443 INFO L231 Difference]: Finished difference. Result has 167 places, 203 transitions, 2297 flow [2025-03-14 00:44:21,443 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-14 00:44:21,444 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 125 predicate places. [2025-03-14 00:44:21,444 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 203 transitions, 2297 flow [2025-03-14 00:44:21,444 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-14 00:44:21,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:21,444 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-14 00:44:21,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-14 00:44:21,645 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-14 00:44:21,645 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-14 00:44:21,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:21,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1025786986, now seen corresponding path program 1 times [2025-03-14 00:44:21,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:21,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195068615] [2025-03-14 00:44:21,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:21,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:21,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:44:21,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:44:21,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:21,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:44:21,670 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:44:21,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:44:21,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:44:21,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:21,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:44:21,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:44:21,724 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:44:21,724 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-03-14 00:44:21,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-14 00:44:21,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-14 00:44:21,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-14 00:44:21,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-03-14 00:44:21,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-03-14 00:44:21,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-14 00:44:21,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 00:44:21,727 INFO L422 BasicCegarLoop]: Path program histogram: [5, 4, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:21,772 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:44:21,772 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:44:21,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:44:21 BasicIcfg [2025-03-14 00:44:21,777 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:44:21,777 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:44:21,777 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:44:21,777 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:44:21,778 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:43:07" (3/4) ... [2025-03-14 00:44:21,779 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-14 00:44:21,827 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 28. [2025-03-14 00:44:21,877 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:44:21,878 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:44:21,878 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:44:21,878 INFO L158 Benchmark]: Toolchain (without parser) took 76313.69ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 110.0MB in the beginning and 431.3MB in the end (delta: -321.3MB). Peak memory consumption was 237.3MB. Max. memory is 16.1GB. [2025-03-14 00:44:21,879 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:44:21,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.65ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 79.3MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-14 00:44:21,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.56ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 76.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:44:21,879 INFO L158 Benchmark]: Boogie Preprocessor took 39.42ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 73.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:44:21,880 INFO L158 Benchmark]: IcfgBuilder took 1044.33ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 90.0MB in the end (delta: -16.8MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. [2025-03-14 00:44:21,880 INFO L158 Benchmark]: TraceAbstraction took 74706.52ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 90.0MB in the beginning and 443.9MB in the end (delta: -353.9MB). Peak memory consumption was 212.2MB. Max. memory is 16.1GB. [2025-03-14 00:44:21,880 INFO L158 Benchmark]: Witness Printer took 100.50ms. Allocated memory is still 704.6MB. Free memory was 443.9MB in the beginning and 431.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:44:21,881 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.15ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.65ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 79.3MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.56ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 76.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.42ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 73.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1044.33ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 90.0MB in the end (delta: -16.8MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. * TraceAbstraction took 74706.52ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 90.0MB in the beginning and 443.9MB in the end (delta: -353.9MB). Peak memory consumption was 212.2MB. Max. memory is 16.1GB. * Witness Printer took 100.50ms. Allocated memory is still 704.6MB. Free memory was 443.9MB in the beginning and 431.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. 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: 74.5s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 27.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1740 SdHoareTripleChecker+Valid, 20.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1696 mSDsluCounter, 1250 SdHoareTripleChecker+Invalid, 19.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1217 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8922 IncrementalHoareTripleChecker+Invalid, 9082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 33 mSDtfsCounter, 8922 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 21.3s 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.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 44.6s 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-14 00:44:21,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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