./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-8fc3dc6-m [2025-03-17 06:47:53,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:47:53,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:47:53,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:47:53,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:47:53,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:47:53,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:47:53,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:47:53,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:47:53,245 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:47:53,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:47:53,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:47:53,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:47:53,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:47:53,246 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:47:53,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:47:53,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:47:53,246 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:47:53,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:47:53,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:47:53,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:47:53,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:47:53,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:47:53,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:47:53,246 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:47:53,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:47:53,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:47:53,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:47:53,246 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:47:53,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:47:53,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:47:53,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:47:53,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:47:53,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:47:53,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:47:53,248 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:47:53,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:47:53,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:47:53,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:47:53,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:47:53,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:47:53,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:47:53,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:47:53,249 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-17 06:47:53,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:47:53,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:47:53,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:47:53,476 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:47:53,477 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:47:53,477 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-17 06:47:54,617 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7543b0cf8/08e4ca0b05bc4e19a3c19fda91c1a95c/FLAGac4dc42f0 [2025-03-17 06:47:54,869 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:47:54,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2025-03-17 06:47:54,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7543b0cf8/08e4ca0b05bc4e19a3c19fda91c1a95c/FLAGac4dc42f0 [2025-03-17 06:47:54,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7543b0cf8/08e4ca0b05bc4e19a3c19fda91c1a95c [2025-03-17 06:47:54,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:47:54,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:47:54,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:47:54,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:47:54,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:47:54,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:47:54" (1/1) ... [2025-03-17 06:47:54,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a436c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:47:54, skipping insertion in model container [2025-03-17 06:47:54,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:47:54" (1/1) ... [2025-03-17 06:47:54,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:47:55,148 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-17 06:47:55,153 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-17 06:47:55,158 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-17 06:47:55,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:47:55,174 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:47:55,199 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-17 06:47:55,200 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-17 06:47:55,201 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-17 06:47:55,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:47:55,230 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:47:55,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:47:55 WrapperNode [2025-03-17 06:47:55,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:47:55,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:47:55,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:47:55,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:47:55,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:47:55" (1/1) ... [2025-03-17 06:47:55,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:47:55" (1/1) ... [2025-03-17 06:47:55,256 INFO L138 Inliner]: procedures = 168, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2025-03-17 06:47:55,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:47:55,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:47:55,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:47:55,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:47:55,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:47:55" (1/1) ... [2025-03-17 06:47:55,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:47:55" (1/1) ... [2025-03-17 06:47:55,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:47:55" (1/1) ... [2025-03-17 06:47:55,273 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-17 06:47:55,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:47:55" (1/1) ... [2025-03-17 06:47:55,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:47:55" (1/1) ... [2025-03-17 06:47:55,277 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:47:55" (1/1) ... [2025-03-17 06:47:55,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:47:55" (1/1) ... [2025-03-17 06:47:55,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:47:55" (1/1) ... [2025-03-17 06:47:55,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:47:55" (1/1) ... [2025-03-17 06:47:55,283 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:47:55,284 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:47:55,284 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:47:55,284 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:47:55,284 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:47:55" (1/1) ... [2025-03-17 06:47:55,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:47:55,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:47:55,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:47:55,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-17 06:47:55,327 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-17 06:47:55,327 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 06:47:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:47:55,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:47:55,328 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:47:55,423 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:47:55,425 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:47:55,625 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: havoc removeLogElement_#t~mem2#1; [2025-03-17 06:47:55,626 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:47:55,627 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:47:55,781 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:47:55,781 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:47:55,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:47:55 BoogieIcfgContainer [2025-03-17 06:47:55,781 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:47:55,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:47:55,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:47:55,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:47:55,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:47:54" (1/3) ... [2025-03-17 06:47:55,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63629a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:47:55, skipping insertion in model container [2025-03-17 06:47:55,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:47:55" (2/3) ... [2025-03-17 06:47:55,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63629a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:47:55, skipping insertion in model container [2025-03-17 06:47:55,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:47:55" (3/3) ... [2025-03-17 06:47:55,789 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2025-03-17 06:47:55,800 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:47:55,801 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-17 06:47:55,801 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:47:55,867 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 06:47:55,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 46 transitions, 106 flow [2025-03-17 06:47:55,924 INFO L124 PetriNetUnfolderBase]: 8/44 cut-off events. [2025-03-17 06:47:55,926 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 06:47:55,929 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-17 06:47:55,930 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 46 transitions, 106 flow [2025-03-17 06:47:55,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 42 transitions, 93 flow [2025-03-17 06:47:55,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:47:55,953 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;@77e5eb65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:47:55,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 06:47:55,966 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:47:55,966 INFO L124 PetriNetUnfolderBase]: 5/33 cut-off events. [2025-03-17 06:47:55,966 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 06:47:55,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:47:55,967 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:47:55,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-17 06:47:55,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:47:55,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1017985567, now seen corresponding path program 1 times [2025-03-17 06:47:55,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:47:55,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694015144] [2025-03-17 06:47:55,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:47:55,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:47:56,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 06:47:56,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 06:47:56,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:47:56,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:47:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:47:56,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:47:56,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694015144] [2025-03-17 06:47:56,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694015144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:47:56,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:47:56,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:47:56,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131114369] [2025-03-17 06:47:56,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:47:56,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:47:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:47:56,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:47:56,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:47:56,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-17 06:47:56,445 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-17 06:47:56,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:47:56,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-17 06:47:56,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:47:56,609 INFO L124 PetriNetUnfolderBase]: 392/721 cut-off events. [2025-03-17 06:47:56,610 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-17 06:47:56,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 721 events. 392/721 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3450 event pairs, 290 based on Foata normal form. 65/712 useless extension candidates. Maximal degree in co-relation 1316. Up to 614 conditions per place. [2025-03-17 06:47:56,615 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 26 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2025-03-17 06:47:56,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 137 flow [2025-03-17 06:47:56,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:47:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:47:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-03-17 06:47:56,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-17 06:47:56,625 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 93 flow. Second operand 3 states and 69 transitions. [2025-03-17 06:47:56,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 137 flow [2025-03-17 06:47:56,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 132 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 06:47:56,629 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 80 flow [2025-03-17 06:47:56,631 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-17 06:47:56,633 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2025-03-17 06:47:56,633 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 80 flow [2025-03-17 06:47:56,633 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-17 06:47:56,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:47:56,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:47:56,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:47:56,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-17 06:47:56,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:47:56,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1123941244, now seen corresponding path program 1 times [2025-03-17 06:47:56,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:47:56,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730270852] [2025-03-17 06:47:56,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:47:56,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:47:56,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 06:47:56,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 06:47:56,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:47:56,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:47:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:47:56,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:47:56,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730270852] [2025-03-17 06:47:56,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730270852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:47:56,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:47:56,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:47:56,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569548551] [2025-03-17 06:47:56,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:47:56,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:47:56,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:47:56,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:47:56,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:47:56,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2025-03-17 06:47:56,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 80 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-17 06:47:56,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:47:56,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2025-03-17 06:47:56,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:47:56,900 INFO L124 PetriNetUnfolderBase]: 626/1167 cut-off events. [2025-03-17 06:47:56,900 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 06:47:56,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2186 conditions, 1167 events. 626/1167 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5336 event pairs, 231 based on Foata normal form. 24/1092 useless extension candidates. Maximal degree in co-relation 2180. Up to 572 conditions per place. [2025-03-17 06:47:56,907 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 42 selfloop transitions, 3 changer transitions 2/57 dead transitions. [2025-03-17 06:47:56,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 57 transitions, 217 flow [2025-03-17 06:47:56,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:47:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:47:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-17 06:47:56,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2025-03-17 06:47:56,912 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 80 flow. Second operand 3 states and 90 transitions. [2025-03-17 06:47:56,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 57 transitions, 217 flow [2025-03-17 06:47:56,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 57 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:47:56,915 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 94 flow [2025-03-17 06:47:56,915 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-03-17 06:47:56,916 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-03-17 06:47:56,916 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 94 flow [2025-03-17 06:47:56,916 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-17 06:47:56,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:47:56,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:47:56,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:47:56,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-17 06:47:56,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:47:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1492812935, now seen corresponding path program 1 times [2025-03-17 06:47:56,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:47:56,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161290009] [2025-03-17 06:47:56,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:47:56,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:47:56,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 06:47:56,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 06:47:56,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:47:56,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:47:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:47:57,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:47:57,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161290009] [2025-03-17 06:47:57,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161290009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:47:57,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:47:57,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:47:57,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130447316] [2025-03-17 06:47:57,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:47:57,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:47:57,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:47:57,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:47:57,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:47:57,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-17 06:47:57,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 94 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-17 06:47:57,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:47:57,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-17 06:47:57,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:47:57,154 INFO L124 PetriNetUnfolderBase]: 687/1304 cut-off events. [2025-03-17 06:47:57,155 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-17 06:47:57,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2521 conditions, 1304 events. 687/1304 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6221 event pairs, 211 based on Foata normal form. 0/1211 useless extension candidates. Maximal degree in co-relation 2513. Up to 889 conditions per place. [2025-03-17 06:47:57,160 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 39 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2025-03-17 06:47:57,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 213 flow [2025-03-17 06:47:57,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:47:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:47:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-03-17 06:47:57,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5942028985507246 [2025-03-17 06:47:57,162 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 94 flow. Second operand 3 states and 82 transitions. [2025-03-17 06:47:57,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 213 flow [2025-03-17 06:47:57,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:47:57,163 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 103 flow [2025-03-17 06:47:57,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-03-17 06:47:57,164 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2025-03-17 06:47:57,164 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 103 flow [2025-03-17 06:47:57,164 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-17 06:47:57,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:47:57,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:47:57,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:47:57,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-17 06:47:57,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:47:57,167 INFO L85 PathProgramCache]: Analyzing trace with hash -44568972, now seen corresponding path program 1 times [2025-03-17 06:47:57,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:47:57,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570191789] [2025-03-17 06:47:57,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:47:57,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:47:57,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 06:47:57,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 06:47:57,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:47:57,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:47:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:47:57,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:47:57,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570191789] [2025-03-17 06:47:57,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570191789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:47:57,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:47:57,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:47:57,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160945908] [2025-03-17 06:47:57,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:47:57,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:47:57,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:47:57,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:47:57,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:47:57,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-17 06:47:57,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 103 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-17 06:47:57,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:47:57,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-17 06:47:57,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:47:57,559 INFO L124 PetriNetUnfolderBase]: 898/1687 cut-off events. [2025-03-17 06:47:57,559 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-17 06:47:57,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3397 conditions, 1687 events. 898/1687 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 9187 event pairs, 438 based on Foata normal form. 12/1592 useless extension candidates. Maximal degree in co-relation 3387. Up to 1086 conditions per place. [2025-03-17 06:47:57,567 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 78 selfloop transitions, 7 changer transitions 0/94 dead transitions. [2025-03-17 06:47:57,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 94 transitions, 402 flow [2025-03-17 06:47:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:47:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 06:47:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2025-03-17 06:47:57,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546583850931677 [2025-03-17 06:47:57,571 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 103 flow. Second operand 7 states and 176 transitions. [2025-03-17 06:47:57,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 94 transitions, 402 flow [2025-03-17 06:47:57,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 94 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:47:57,573 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 150 flow [2025-03-17 06:47:57,574 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-17 06:47:57,574 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2025-03-17 06:47:57,574 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 150 flow [2025-03-17 06:47:57,574 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-17 06:47:57,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:47:57,574 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:47:57,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:47:57,575 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-17 06:47:57,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:47:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash 993720154, now seen corresponding path program 1 times [2025-03-17 06:47:57,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:47:57,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135332934] [2025-03-17 06:47:57,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:47:57,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:47:57,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 06:47:57,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 06:47:57,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:47:57,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:47:57,616 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-17 06:47:57,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:47:57,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135332934] [2025-03-17 06:47:57,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135332934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:47:57,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:47:57,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:47:57,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861111008] [2025-03-17 06:47:57,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:47:57,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:47:57,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:47:57,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:47:57,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:47:57,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-17 06:47:57,619 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-17 06:47:57,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:47:57,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-17 06:47:57,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:47:57,772 INFO L124 PetriNetUnfolderBase]: 756/1460 cut-off events. [2025-03-17 06:47:57,772 INFO L125 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2025-03-17 06:47:57,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3151 conditions, 1460 events. 756/1460 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 7244 event pairs, 254 based on Foata normal form. 42/1462 useless extension candidates. Maximal degree in co-relation 3137. Up to 732 conditions per place. [2025-03-17 06:47:57,779 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 43 selfloop transitions, 3 changer transitions 3/59 dead transitions. [2025-03-17 06:47:57,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 283 flow [2025-03-17 06:47:57,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:47:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:47:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-03-17 06:47:57,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5942028985507246 [2025-03-17 06:47:57,781 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 150 flow. Second operand 3 states and 82 transitions. [2025-03-17 06:47:57,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 283 flow [2025-03-17 06:47:57,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:47:57,785 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 156 flow [2025-03-17 06:47:57,785 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-17 06:47:57,786 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2025-03-17 06:47:57,787 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 156 flow [2025-03-17 06:47:57,787 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-17 06:47:57,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:47:57,787 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-17 06:47:57,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:47:57,787 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-17 06:47:57,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:47:57,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1380251864, now seen corresponding path program 1 times [2025-03-17 06:47:57,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:47:57,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326080809] [2025-03-17 06:47:57,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:47:57,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:47:57,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 06:47:57,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 06:47:57,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:47:57,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:47:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:47:57,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:47:57,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326080809] [2025-03-17 06:47:57,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326080809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:47:57,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:47:57,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:47:57,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427332577] [2025-03-17 06:47:57,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:47:57,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:47:57,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:47:57,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:47:57,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:47:57,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2025-03-17 06:47:57,888 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-17 06:47:57,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:47:57,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2025-03-17 06:47:57,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:47:58,000 INFO L124 PetriNetUnfolderBase]: 412/908 cut-off events. [2025-03-17 06:47:58,000 INFO L125 PetriNetUnfolderBase]: For 237/237 co-relation queries the response was YES. [2025-03-17 06:47:58,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 908 events. 412/908 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3986 event pairs, 128 based on Foata normal form. 46/932 useless extension candidates. Maximal degree in co-relation 2007. Up to 410 conditions per place. [2025-03-17 06:47:58,004 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 39 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2025-03-17 06:47:58,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 276 flow [2025-03-17 06:47:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:47:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:47:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-03-17 06:47:58,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2025-03-17 06:47:58,005 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 156 flow. Second operand 3 states and 81 transitions. [2025-03-17 06:47:58,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 276 flow [2025-03-17 06:47:58,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:47:58,010 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 158 flow [2025-03-17 06:47:58,010 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-17 06:47:58,011 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2025-03-17 06:47:58,012 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 158 flow [2025-03-17 06:47:58,012 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-17 06:47:58,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:47:58,012 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-17 06:47:58,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:47:58,012 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-17 06:47:58,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:47:58,013 INFO L85 PathProgramCache]: Analyzing trace with hash -112535196, now seen corresponding path program 1 times [2025-03-17 06:47:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:47:58,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140840500] [2025-03-17 06:47:58,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:47:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:47:58,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 06:47:58,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:47:58,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:47:58,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:47:58,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2020043284] [2025-03-17 06:47:58,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:47:58,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:47:58,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:47:58,055 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:47:58,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:47:58,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 06:47:58,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:47:58,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:47:58,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:47:58,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 06:47:58,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:47:58,365 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-17 06:47:58,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:47:58,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:47:58,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:47:58,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140840500] [2025-03-17 06:47:58,573 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 06:47:58,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020043284] [2025-03-17 06:47:58,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020043284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:47:58,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:47:58,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:47:58,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098753403] [2025-03-17 06:47:58,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:47:58,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:47:58,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:47:58,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:47:58,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:47:58,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-17 06:47:58,596 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-17 06:47:58,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:47:58,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-17 06:47:58,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:47:58,829 INFO L124 PetriNetUnfolderBase]: 476/1016 cut-off events. [2025-03-17 06:47:58,829 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2025-03-17 06:47:58,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2381 conditions, 1016 events. 476/1016 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4354 event pairs, 94 based on Foata normal form. 0/991 useless extension candidates. Maximal degree in co-relation 2366. Up to 422 conditions per place. [2025-03-17 06:47:58,835 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 71 selfloop transitions, 9 changer transitions 11/103 dead transitions. [2025-03-17 06:47:58,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 515 flow [2025-03-17 06:47:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:47:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 06:47:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2025-03-17 06:47:58,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-17 06:47:58,836 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 158 flow. Second operand 9 states and 207 transitions. [2025-03-17 06:47:58,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 515 flow [2025-03-17 06:47:58,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 498 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:47:58,839 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 209 flow [2025-03-17 06:47:58,839 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-17 06:47:58,840 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2025-03-17 06:47:58,840 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 209 flow [2025-03-17 06:47:58,841 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-17 06:47:58,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:47:58,841 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-17 06:47:58,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:47:59,045 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-17 06:47:59,046 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-17 06:47:59,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:47:59,046 INFO L85 PathProgramCache]: Analyzing trace with hash 250426457, now seen corresponding path program 1 times [2025-03-17 06:47:59,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:47:59,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886602747] [2025-03-17 06:47:59,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:47:59,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:47:59,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 06:47:59,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 06:47:59,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:47:59,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:47:59,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:47:59,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:47:59,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886602747] [2025-03-17 06:47:59,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886602747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:47:59,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:47:59,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:47:59,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315025846] [2025-03-17 06:47:59,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:47:59,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:47:59,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:47:59,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:47:59,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:47:59,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2025-03-17 06:47:59,138 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-17 06:47:59,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:47:59,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2025-03-17 06:47:59,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:47:59,226 INFO L124 PetriNetUnfolderBase]: 482/1013 cut-off events. [2025-03-17 06:47:59,227 INFO L125 PetriNetUnfolderBase]: For 517/517 co-relation queries the response was YES. [2025-03-17 06:47:59,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2466 conditions, 1013 events. 482/1013 cut-off events. For 517/517 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4345 event pairs, 369 based on Foata normal form. 0/988 useless extension candidates. Maximal degree in co-relation 2446. Up to 828 conditions per place. [2025-03-17 06:47:59,231 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 36 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2025-03-17 06:47:59,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 48 transitions, 279 flow [2025-03-17 06:47:59,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:47:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:47:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-17 06:47:59,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.463768115942029 [2025-03-17 06:47:59,233 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 209 flow. Second operand 3 states and 64 transitions. [2025-03-17 06:47:59,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 48 transitions, 279 flow [2025-03-17 06:47:59,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 48 transitions, 269 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-17 06:47:59,236 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 197 flow [2025-03-17 06:47:59,236 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-17 06:47:59,238 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2025-03-17 06:47:59,239 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 197 flow [2025-03-17 06:47:59,239 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-17 06:47:59,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:47:59,239 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-17 06:47:59,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:47:59,239 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-17 06:47:59,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:47:59,240 INFO L85 PathProgramCache]: Analyzing trace with hash -590280762, now seen corresponding path program 1 times [2025-03-17 06:47:59,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:47:59,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662798246] [2025-03-17 06:47:59,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:47:59,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:47:59,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 06:47:59,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 06:47:59,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:47:59,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:47:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:47:59,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:47:59,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662798246] [2025-03-17 06:47:59,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662798246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:47:59,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:47:59,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:47:59,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6250364] [2025-03-17 06:47:59,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:47:59,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:47:59,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:47:59,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:47:59,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:47:59,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-17 06:47:59,382 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-17 06:47:59,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:47:59,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-17 06:47:59,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:47:59,522 INFO L124 PetriNetUnfolderBase]: 513/1047 cut-off events. [2025-03-17 06:47:59,522 INFO L125 PetriNetUnfolderBase]: For 450/450 co-relation queries the response was YES. [2025-03-17 06:47:59,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 1047 events. 513/1047 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4324 event pairs, 232 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 2539. Up to 582 conditions per place. [2025-03-17 06:47:59,526 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 54 selfloop transitions, 11 changer transitions 5/79 dead transitions. [2025-03-17 06:47:59,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 79 transitions, 424 flow [2025-03-17 06:47:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:47:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:47:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2025-03-17 06:47:59,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4963768115942029 [2025-03-17 06:47:59,527 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 197 flow. Second operand 6 states and 137 transitions. [2025-03-17 06:47:59,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 79 transitions, 424 flow [2025-03-17 06:47:59,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:47:59,531 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 221 flow [2025-03-17 06:47:59,531 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-17 06:47:59,532 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2025-03-17 06:47:59,532 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 221 flow [2025-03-17 06:47:59,532 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-17 06:47:59,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:47:59,533 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-17 06:47:59,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:47:59,533 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-17 06:47:59,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:47:59,533 INFO L85 PathProgramCache]: Analyzing trace with hash 455246258, now seen corresponding path program 1 times [2025-03-17 06:47:59,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:47:59,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986934271] [2025-03-17 06:47:59,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:47:59,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:47:59,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 06:47:59,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 06:47:59,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:47:59,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:47:59,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1063487250] [2025-03-17 06:47:59,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:47:59,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:47:59,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:47:59,606 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:47:59,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:47:59,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 06:47:59,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 06:47:59,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:47:59,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:47:59,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 06:47:59,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:48:00,265 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-17 06:48:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:48:00,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:48:06,828 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-17 06:48:06,846 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-17 06:48:06,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 496 treesize of output 427 [2025-03-17 06:48:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:48:16,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:48:16,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986934271] [2025-03-17 06:48:16,642 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 06:48:16,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063487250] [2025-03-17 06:48:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063487250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:48:16,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:48:16,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2025-03-17 06:48:16,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462903706] [2025-03-17 06:48:16,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:48:16,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 06:48:16,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:48:16,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 06:48:16,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-03-17 06:48:17,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2025-03-17 06:48:17,197 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-17 06:48:17,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:48:17,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2025-03-17 06:48:17,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:48:30,233 WARN L286 SmtUtils]: Spent 12.00s 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-17 06:48:46,660 WARN L286 SmtUtils]: Spent 15.08s 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-17 06:49:02,606 WARN L286 SmtUtils]: Spent 14.66s 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) [2025-03-17 06:49:25,644 WARN L286 SmtUtils]: Spent 8.99s on a formula simplification. DAG size of input: 128 DAG size of output: 127 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)