./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-deagle/circular_buffer_ok.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 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:29:26,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:29:27,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:29:27,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:29:27,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:29:27,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:29:27,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:29:27,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:29:27,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:29:27,066 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:29:27,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:29:27,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:29:27,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:29:27,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:29:27,066 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:29:27,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:29:27,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:29:27,067 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:29:27,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:29:27,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:29:27,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:29:27,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:29:27,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:29:27,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:29:27,067 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:29:27,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:29:27,068 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:29:27,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:29:27,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:29:27,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:29:27,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:29:27,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:29:27,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:29:27,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:29:27,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:29:27,068 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:29:27,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:29:27,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:29:27,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:29:27,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:29:27,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:29:27,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:29:27,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:29:27,069 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 -> 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 [2025-03-04 02:29:27,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:29:27,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:29:27,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:29:27,293 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:29:27,293 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:29:27,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2025-03-04 02:29:28,439 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67c76983d/afc17c2464124e5f9cbdfe7e4f3de95d/FLAG173eacc3b [2025-03-04 02:29:28,699 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:29:28,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2025-03-04 02:29:28,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67c76983d/afc17c2464124e5f9cbdfe7e4f3de95d/FLAG173eacc3b [2025-03-04 02:29:28,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67c76983d/afc17c2464124e5f9cbdfe7e4f3de95d [2025-03-04 02:29:28,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:29:28,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:29:28,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:29:28,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:29:28,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:29:28,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:29:28" (1/1) ... [2025-03-04 02:29:28,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d4705a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:28, skipping insertion in model container [2025-03-04 02:29:28,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:29:28" (1/1) ... [2025-03-04 02:29:28,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:29:28,973 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-deagle/circular_buffer_ok.i[30451,30464] [2025-03-04 02:29:28,978 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-deagle/circular_buffer_ok.i[30681,30694] [2025-03-04 02:29:28,981 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-deagle/circular_buffer_ok.i[30979,30992] [2025-03-04 02:29:28,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:29:28,994 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:29:29,025 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-deagle/circular_buffer_ok.i[30451,30464] [2025-03-04 02:29:29,026 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-deagle/circular_buffer_ok.i[30681,30694] [2025-03-04 02:29:29,027 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-deagle/circular_buffer_ok.i[30979,30992] [2025-03-04 02:29:29,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:29:29,052 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:29:29,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:29 WrapperNode [2025-03-04 02:29:29,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:29:29,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:29:29,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:29:29,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:29:29,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:29" (1/1) ... [2025-03-04 02:29:29,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:29" (1/1) ... [2025-03-04 02:29:29,087 INFO L138 Inliner]: procedures = 168, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2025-03-04 02:29:29,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:29:29,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:29:29,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:29:29,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:29:29,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:29" (1/1) ... [2025-03-04 02:29:29,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:29" (1/1) ... [2025-03-04 02:29:29,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:29" (1/1) ... [2025-03-04 02:29:29,114 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2025-03-04 02:29:29,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:29" (1/1) ... [2025-03-04 02:29:29,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:29" (1/1) ... [2025-03-04 02:29:29,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:29" (1/1) ... [2025-03-04 02:29:29,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:29" (1/1) ... [2025-03-04 02:29:29,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:29" (1/1) ... [2025-03-04 02:29:29,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:29" (1/1) ... [2025-03-04 02:29:29,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:29:29,134 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:29:29,134 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:29:29,137 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:29:29,138 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:29" (1/1) ... [2025-03-04 02:29:29,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:29:29,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:29,162 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-04 02:29:29,166 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-04 02:29:29,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:29:29,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:29:29,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:29:29,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 02:29:29,183 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 02:29:29,183 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 02:29:29,183 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 02:29:29,183 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 02:29:29,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:29:29,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:29:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:29:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 02:29:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 02:29:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:29:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:29:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:29:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:29:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 02:29:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:29:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:29:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:29:29,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 02:29:29,186 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 02:29:29,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:29:29,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:29:29,187 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:29:29,294 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:29:29,296 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:29:29,506 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: havoc removeLogElement_#t~mem2#1; [2025-03-04 02:29:29,507 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:29:29,507 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:29:29,683 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:29:29,683 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:29:29,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:29:29 BoogieIcfgContainer [2025-03-04 02:29:29,684 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:29:29,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:29:29,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:29:29,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:29:29,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:29:28" (1/3) ... [2025-03-04 02:29:29,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ed60ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:29:29, skipping insertion in model container [2025-03-04 02:29:29,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:29" (2/3) ... [2025-03-04 02:29:29,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ed60ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:29:29, skipping insertion in model container [2025-03-04 02:29:29,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:29:29" (3/3) ... [2025-03-04 02:29:29,691 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2025-03-04 02:29:29,700 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:29:29,701 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_ok.i that has 3 procedures, 39 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-04 02:29:29,702 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:29:29,766 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:29:29,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 46 transitions, 106 flow [2025-03-04 02:29:29,818 INFO L124 PetriNetUnfolderBase]: 8/44 cut-off events. [2025-03-04 02:29:29,822 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:29:29,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 44 events. 8/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 113 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2025-03-04 02:29:29,827 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 46 transitions, 106 flow [2025-03-04 02:29:29,828 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 42 transitions, 93 flow [2025-03-04 02:29:29,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:29:29,847 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;@4b52d4b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:29:29,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 02:29:29,856 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:29:29,856 INFO L124 PetriNetUnfolderBase]: 5/33 cut-off events. [2025-03-04 02:29:29,856 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:29:29,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:29,857 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:29,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 02:29:29,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:29,861 INFO L85 PathProgramCache]: Analyzing trace with hash -165542558, now seen corresponding path program 1 times [2025-03-04 02:29:29,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:29,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352164108] [2025-03-04 02:29:29,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:29,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:29,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:29:29,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:29:29,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:29,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:30,240 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-04 02:29:30,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:30,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352164108] [2025-03-04 02:29:30,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352164108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:30,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:30,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:29:30,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451583631] [2025-03-04 02:29:30,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:30,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:29:30,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:30,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:29:30,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:29:30,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:29:30,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:30,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:30,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:29:30,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:30,434 INFO L124 PetriNetUnfolderBase]: 402/717 cut-off events. [2025-03-04 02:29:30,434 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 02:29:30,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 717 events. 402/717 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3445 event pairs, 299 based on Foata normal form. 65/688 useless extension candidates. Maximal degree in co-relation 1329. Up to 631 conditions per place. [2025-03-04 02:29:30,441 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 26 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2025-03-04 02:29:30,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 137 flow [2025-03-04 02:29:30,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:29:30,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:29:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-03-04 02:29:30,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:29:30,450 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 93 flow. Second operand 3 states and 69 transitions. [2025-03-04 02:29:30,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 137 flow [2025-03-04 02:29:30,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 132 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:29:30,456 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 80 flow [2025-03-04 02:29:30,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2025-03-04 02:29:30,461 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2025-03-04 02:29:30,462 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 80 flow [2025-03-04 02:29:30,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:30,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:30,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:30,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:29:30,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 02:29:30,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:30,464 INFO L85 PathProgramCache]: Analyzing trace with hash -836883431, now seen corresponding path program 1 times [2025-03-04 02:29:30,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:30,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924536559] [2025-03-04 02:29:30,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:30,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:30,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:29:30,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:29:30,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:30,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:30,609 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-04 02:29:30,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:30,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924536559] [2025-03-04 02:29:30,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924536559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:30,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:30,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:29:30,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190306099] [2025-03-04 02:29:30,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:30,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:29:30,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:30,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:29:30,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:29:30,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:29:30,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:30,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:30,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:29:30,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:30,772 INFO L124 PetriNetUnfolderBase]: 565/1028 cut-off events. [2025-03-04 02:29:30,772 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:29:30,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1945 conditions, 1028 events. 565/1028 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4954 event pairs, 149 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 1939. Up to 572 conditions per place. [2025-03-04 02:29:30,778 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 44 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2025-03-04 02:29:30,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 213 flow [2025-03-04 02:29:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:29:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:29:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-04 02:29:30,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2025-03-04 02:29:30,781 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 80 flow. Second operand 3 states and 86 transitions. [2025-03-04 02:29:30,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 213 flow [2025-03-04 02:29:30,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:29:30,784 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 91 flow [2025-03-04 02:29:30,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-03-04 02:29:30,786 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-03-04 02:29:30,786 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 91 flow [2025-03-04 02:29:30,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:30,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:30,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:30,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:29:30,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 02:29:30,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:30,788 INFO L85 PathProgramCache]: Analyzing trace with hash -468011740, now seen corresponding path program 1 times [2025-03-04 02:29:30,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:30,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615518638] [2025-03-04 02:29:30,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:30,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:30,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:29:30,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:29:30,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:30,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:30,880 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-04 02:29:30,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:30,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615518638] [2025-03-04 02:29:30,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615518638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:30,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:30,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:29:30,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960967326] [2025-03-04 02:29:30,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:30,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:29:30,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:30,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:29:30,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:29:30,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2025-03-04 02:29:30,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:30,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:30,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2025-03-04 02:29:30,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:31,056 INFO L124 PetriNetUnfolderBase]: 691/1293 cut-off events. [2025-03-04 02:29:31,056 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-04 02:29:31,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 1293 events. 691/1293 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6140 event pairs, 285 based on Foata normal form. 27/1214 useless extension candidates. Maximal degree in co-relation 2492. Up to 572 conditions per place. [2025-03-04 02:29:31,069 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 44 selfloop transitions, 3 changer transitions 1/58 dead transitions. [2025-03-04 02:29:31,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 234 flow [2025-03-04 02:29:31,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:29:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:29:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-04 02:29:31,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2025-03-04 02:29:31,070 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 91 flow. Second operand 3 states and 90 transitions. [2025-03-04 02:29:31,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 234 flow [2025-03-04 02:29:31,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:29:31,071 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 104 flow [2025-03-04 02:29:31,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-03-04 02:29:31,072 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2025-03-04 02:29:31,072 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 104 flow [2025-03-04 02:29:31,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:31,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:31,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:31,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:29:31,073 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 02:29:31,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:31,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1056508108, now seen corresponding path program 1 times [2025-03-04 02:29:31,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:31,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501858025] [2025-03-04 02:29:31,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:31,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:31,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:29:31,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:29:31,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:31,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:31,200 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-04 02:29:31,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:31,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501858025] [2025-03-04 02:29:31,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501858025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:31,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:31,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:29:31,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936300342] [2025-03-04 02:29:31,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:31,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:29:31,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:31,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:29:31,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:29:31,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:29:31,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 104 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-04 02:29:31,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:31,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:29:31,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:31,475 INFO L124 PetriNetUnfolderBase]: 939/1717 cut-off events. [2025-03-04 02:29:31,476 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-04 02:29:31,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3504 conditions, 1717 events. 939/1717 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 8944 event pairs, 407 based on Foata normal form. 12/1606 useless extension candidates. Maximal degree in co-relation 3494. Up to 1153 conditions per place. [2025-03-04 02:29:31,486 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 78 selfloop transitions, 7 changer transitions 0/94 dead transitions. [2025-03-04 02:29:31,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 94 transitions, 404 flow [2025-03-04 02:29:31,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:29:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:29:31,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2025-03-04 02:29:31,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546583850931677 [2025-03-04 02:29:31,490 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 104 flow. Second operand 7 states and 176 transitions. [2025-03-04 02:29:31,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 94 transitions, 404 flow [2025-03-04 02:29:31,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 94 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:29:31,492 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 150 flow [2025-03-04 02:29:31,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=150, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2025-03-04 02:29:31,492 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2025-03-04 02:29:31,492 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 150 flow [2025-03-04 02:29:31,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-04 02:29:31,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:31,492 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:31,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:29:31,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 02:29:31,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:31,493 INFO L85 PathProgramCache]: Analyzing trace with hash 536074362, now seen corresponding path program 1 times [2025-03-04 02:29:31,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:31,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318288370] [2025-03-04 02:29:31,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:31,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:31,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:29:31,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:29:31,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:31,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:31,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:31,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318288370] [2025-03-04 02:29:31,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318288370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:31,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:31,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:29:31,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596816077] [2025-03-04 02:29:31,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:31,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:29:31,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:31,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:29:31,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:29:31,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:29:31,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:31,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:31,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:29:31,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:31,703 INFO L124 PetriNetUnfolderBase]: 756/1446 cut-off events. [2025-03-04 02:29:31,703 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2025-03-04 02:29:31,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3137 conditions, 1446 events. 756/1446 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 7173 event pairs, 254 based on Foata normal form. 42/1440 useless extension candidates. Maximal degree in co-relation 3123. Up to 732 conditions per place. [2025-03-04 02:29:31,711 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 43 selfloop transitions, 3 changer transitions 3/59 dead transitions. [2025-03-04 02:29:31,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 283 flow [2025-03-04 02:29:31,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:29:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:29:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-03-04 02:29:31,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5942028985507246 [2025-03-04 02:29:31,713 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 150 flow. Second operand 3 states and 82 transitions. [2025-03-04 02:29:31,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 283 flow [2025-03-04 02:29:31,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:29:31,716 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 156 flow [2025-03-04 02:29:31,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2025-03-04 02:29:31,719 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2025-03-04 02:29:31,719 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 156 flow [2025-03-04 02:29:31,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:31,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:31,720 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-04 02:29:31,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:29:31,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 02:29:31,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:31,721 INFO L85 PathProgramCache]: Analyzing trace with hash -702499345, now seen corresponding path program 1 times [2025-03-04 02:29:31,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:31,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738902875] [2025-03-04 02:29:31,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:31,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:31,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:29:31,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:29:31,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:31,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:31,825 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-04 02:29:31,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738902875] [2025-03-04 02:29:31,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738902875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:31,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:31,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:29:31,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691313729] [2025-03-04 02:29:31,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:31,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:29:31,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:31,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:29:31,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:29:31,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2025-03-04 02:29:31,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-04 02:29:31,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:31,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2025-03-04 02:29:31,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:31,929 INFO L124 PetriNetUnfolderBase]: 412/903 cut-off events. [2025-03-04 02:29:31,930 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2025-03-04 02:29:31,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2017 conditions, 903 events. 412/903 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3991 event pairs, 128 based on Foata normal form. 46/923 useless extension candidates. Maximal degree in co-relation 2002. Up to 410 conditions per place. [2025-03-04 02:29:31,934 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 39 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2025-03-04 02:29:31,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 276 flow [2025-03-04 02:29:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:29:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:29:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-03-04 02:29:31,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2025-03-04 02:29:31,935 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 156 flow. Second operand 3 states and 81 transitions. [2025-03-04 02:29:31,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 276 flow [2025-03-04 02:29:31,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:29:31,937 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 158 flow [2025-03-04 02:29:31,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2025-03-04 02:29:31,938 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2025-03-04 02:29:31,938 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 158 flow [2025-03-04 02:29:31,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-04 02:29:31,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:31,938 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-04 02:29:31,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:29:31,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 02:29:31,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:31,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1760864508, now seen corresponding path program 1 times [2025-03-04 02:29:31,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:31,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942239671] [2025-03-04 02:29:31,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:31,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:31,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:29:32,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:29:32,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:32,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 02:29:32,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1902850277] [2025-03-04 02:29:32,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:32,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:32,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:32,011 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-04 02:29:32,011 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-04 02:29:32,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:29:32,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:29:32,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:32,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:32,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 02:29:32,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:32,276 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-04 02:29:32,512 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-04 02:29:32,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:29:32,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:32,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942239671] [2025-03-04 02:29:32,513 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 02:29:32,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902850277] [2025-03-04 02:29:32,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902850277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:32,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:32,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:29:32,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854347346] [2025-03-04 02:29:32,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:32,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:29:32,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:32,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:29:32,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:29:32,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:29:32,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 158 flow. Second operand has 8 states, 8 states have (on average 15.0) internal successors, (120), 8 states have internal predecessors, (120), 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-04 02:29:32,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:32,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:29:32,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:32,815 INFO L124 PetriNetUnfolderBase]: 476/1013 cut-off events. [2025-03-04 02:29:32,815 INFO L125 PetriNetUnfolderBase]: For 316/316 co-relation queries the response was YES. [2025-03-04 02:29:32,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2378 conditions, 1013 events. 476/1013 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4372 event pairs, 92 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 2363. Up to 422 conditions per place. [2025-03-04 02:29:32,819 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 71 selfloop transitions, 9 changer transitions 11/103 dead transitions. [2025-03-04 02:29:32,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 515 flow [2025-03-04 02:29:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:29:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:29:32,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2025-03-04 02:29:32,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:29:32,820 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 158 flow. Second operand 9 states and 207 transitions. [2025-03-04 02:29:32,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 515 flow [2025-03-04 02:29:32,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 498 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:29:32,823 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 209 flow [2025-03-04 02:29:32,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=209, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2025-03-04 02:29:32,823 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2025-03-04 02:29:32,823 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 209 flow [2025-03-04 02:29:32,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.0) internal successors, (120), 8 states have internal predecessors, (120), 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-04 02:29:32,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:32,824 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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-04 02:29:32,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:29:33,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:33,027 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 02:29:33,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:33,027 INFO L85 PathProgramCache]: Analyzing trace with hash 757741697, now seen corresponding path program 1 times [2025-03-04 02:29:33,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:33,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161533015] [2025-03-04 02:29:33,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:33,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:33,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 02:29:33,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:29:33,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:33,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:33,112 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-04 02:29:33,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:33,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161533015] [2025-03-04 02:29:33,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161533015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:33,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:33,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:29:33,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45589607] [2025-03-04 02:29:33,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:33,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:29:33,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:33,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:29:33,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:29:33,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2025-03-04 02:29:33,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-04 02:29:33,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:33,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2025-03-04 02:29:33,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:33,215 INFO L124 PetriNetUnfolderBase]: 482/1005 cut-off events. [2025-03-04 02:29:33,216 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2025-03-04 02:29:33,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2459 conditions, 1005 events. 482/1005 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4275 event pairs, 369 based on Foata normal form. 0/971 useless extension candidates. Maximal degree in co-relation 2439. Up to 828 conditions per place. [2025-03-04 02:29:33,220 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 36 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2025-03-04 02:29:33,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 48 transitions, 279 flow [2025-03-04 02:29:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:29:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:29:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-04 02:29:33,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.463768115942029 [2025-03-04 02:29:33,221 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 209 flow. Second operand 3 states and 64 transitions. [2025-03-04 02:29:33,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 48 transitions, 279 flow [2025-03-04 02:29:33,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 48 transitions, 269 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 02:29:33,224 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 197 flow [2025-03-04 02:29:33,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2025-03-04 02:29:33,225 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2025-03-04 02:29:33,225 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 197 flow [2025-03-04 02:29:33,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-04 02:29:33,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:33,225 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:33,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:29:33,225 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 02:29:33,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:33,226 INFO L85 PathProgramCache]: Analyzing trace with hash 238351922, now seen corresponding path program 1 times [2025-03-04 02:29:33,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:33,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368583746] [2025-03-04 02:29:33,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:33,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:33,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 02:29:33,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 02:29:33,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:33,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:33,383 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-04 02:29:33,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:33,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368583746] [2025-03-04 02:29:33,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368583746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:33,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:33,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:29:33,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932123118] [2025-03-04 02:29:33,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:33,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:29:33,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:33,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:29:33,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:29:33,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-04 02:29:33,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-04 02:29:33,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:33,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-04 02:29:33,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:33,561 INFO L124 PetriNetUnfolderBase]: 513/1026 cut-off events. [2025-03-04 02:29:33,562 INFO L125 PetriNetUnfolderBase]: For 454/454 co-relation queries the response was YES. [2025-03-04 02:29:33,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2536 conditions, 1026 events. 513/1026 cut-off events. For 454/454 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4215 event pairs, 232 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 2516. Up to 582 conditions per place. [2025-03-04 02:29:33,567 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 54 selfloop transitions, 11 changer transitions 5/79 dead transitions. [2025-03-04 02:29:33,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 79 transitions, 424 flow [2025-03-04 02:29:33,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:29:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:29:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2025-03-04 02:29:33,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4963768115942029 [2025-03-04 02:29:33,568 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 197 flow. Second operand 6 states and 137 transitions. [2025-03-04 02:29:33,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 79 transitions, 424 flow [2025-03-04 02:29:33,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:29:33,572 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 221 flow [2025-03-04 02:29:33,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2025-03-04 02:29:33,573 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2025-03-04 02:29:33,573 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 221 flow [2025-03-04 02:29:33,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-04 02:29:33,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:33,574 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:33,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:29:33,574 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 02:29:33,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:33,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1294782968, now seen corresponding path program 1 times [2025-03-04 02:29:33,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:33,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3294568] [2025-03-04 02:29:33,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:33,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:33,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 02:29:33,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:29:33,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:33,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 02:29:33,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1228590134] [2025-03-04 02:29:33,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:33,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:29:33,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:33,708 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-04 02:29:33,709 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-04 02:29:33,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 02:29:33,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:29:33,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:33,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:33,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 02:29:33,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:29:33,923 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 7 treesize of output 3 [2025-03-04 02:29:34,283 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 21 treesize of output 20 [2025-03-04 02:29:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:34,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:29:41,104 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 466 treesize of output 446 [2025-03-04 02:29:41,199 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-04 02:29:41,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 496 treesize of output 427 [2025-03-04 02:29:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:51,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:51,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3294568] [2025-03-04 02:29:51,657 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 02:29:51,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228590134] [2025-03-04 02:29:51,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228590134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:29:51,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:29:51,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2025-03-04 02:29:51,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130342628] [2025-03-04 02:29:51,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 02:29:51,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 02:29:51,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:51,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 02:29:51,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-03-04 02:29:52,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2025-03-04 02:29:52,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 221 flow. Second operand has 27 states, 27 states have (on average 13.37037037037037) internal successors, (361), 27 states have internal predecessors, (361), 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-04 02:29:52,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:52,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2025-03-04 02:29:52,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:10,097 WARN L286 SmtUtils]: Spent 16.91s on a formula simplification. DAG size of input: 131 DAG size of output: 128 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 02:30:24,839 WARN L286 SmtUtils]: Spent 12.99s on a formula simplification. DAG size of input: 128 DAG size of output: 125 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 02:30:46,225 WARN L286 SmtUtils]: Spent 19.94s on a formula simplification. DAG size of input: 123 DAG size of output: 121 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)