/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:55:32,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:55:32,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:55:32,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:55:32,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:55:32,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:55:32,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:55:32,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:55:32,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:55:32,159 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:55:32,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:55:32,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:55:32,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:55:32,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:55:32,160 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:55:32,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:55:32,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:55:32,160 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:55:32,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:55:32,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:55:32,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:55:32,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:55:32,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:55:32,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:55:32,161 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:55:32,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:55:32,161 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:55:32,161 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:55:32,161 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:55:32,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:55:32,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:55:32,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:55:32,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:55:32,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:55:32,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:55:32,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:55:32,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:55:32,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:55:32,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:55:32,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:55:32,162 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:55:32,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:55:32,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:55:32,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:55:32,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:55:32,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:55:32,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:55:32,162 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:55:32,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:55:32,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:55:32,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:55:32,406 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:55:32,407 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:55:32,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-04-13 21:55:33,741 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363b71ed4/2ac80fd8ff4e49e9906beb52c58e7e6e/FLAG43f81e167 [2025-04-13 21:55:34,027 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:55:34,027 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-04-13 21:55:34,044 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363b71ed4/2ac80fd8ff4e49e9906beb52c58e7e6e/FLAG43f81e167 [2025-04-13 21:55:34,742 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363b71ed4/2ac80fd8ff4e49e9906beb52c58e7e6e [2025-04-13 21:55:34,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:55:34,747 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:55:34,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:55:34,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:55:34,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:55:34,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:55:34" (1/1) ... [2025-04-13 21:55:34,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248921ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:55:34, skipping insertion in model container [2025-04-13 21:55:34,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:55:34" (1/1) ... [2025-04-13 21:55:34,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:55:35,068 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2025-04-13 21:55:35,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:55:35,110 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:55:35,156 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2025-04-13 21:55:35,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:55:35,204 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:55:35,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:55:35 WrapperNode [2025-04-13 21:55:35,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:55:35,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:55:35,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:55:35,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:55:35,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:55:35" (1/1) ... [2025-04-13 21:55:35,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:55:35" (1/1) ... [2025-04-13 21:55:35,254 INFO L138 Inliner]: procedures = 272, calls = 95, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 252 [2025-04-13 21:55:35,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:55:35,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:55:35,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:55:35,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:55:35,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:55:35" (1/1) ... [2025-04-13 21:55:35,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:55:35" (1/1) ... [2025-04-13 21:55:35,272 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:55:35" (1/1) ... [2025-04-13 21:55:35,293 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 5, 70, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2025-04-13 21:55:35,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:55:35" (1/1) ... [2025-04-13 21:55:35,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:55:35" (1/1) ... [2025-04-13 21:55:35,300 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:55:35" (1/1) ... [2025-04-13 21:55:35,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:55:35" (1/1) ... [2025-04-13 21:55:35,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:55:35" (1/1) ... [2025-04-13 21:55:35,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:55:35" (1/1) ... [2025-04-13 21:55:35,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:55:35,312 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:55:35,312 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:55:35,312 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:55:35,315 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:55:35" (1/1) ... [2025-04-13 21:55:35,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:55:35,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:55:35,340 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-04-13 21:55:35,345 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-04-13 21:55:35,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 21:55:35,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 21:55:35,358 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 21:55:35,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:55:35,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:55:35,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 21:55:35,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 21:55:35,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:55:35,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:55:35,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 21:55:35,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 21:55:35,359 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 21:55:35,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:55:35,359 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-13 21:55:35,359 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-13 21:55:35,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:55:35,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:55:35,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 21:55:35,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 21:55:35,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:55:35,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:55:35,361 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:55:35,485 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:55:35,486 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:55:35,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-04-13 21:55:35,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-04-13 21:55:35,775 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:55:35,776 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:55:35,776 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:55:36,105 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:55:36,107 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:55:36,110 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:55:36,110 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:55:36,110 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:55:36,112 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:55:36,116 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:55:36,121 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:55:36,124 WARN L179 LargeBlockEncoding]: Complex 5:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:55:36,127 WARN L179 LargeBlockEncoding]: Complex 5:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:55:36,129 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:55:36,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:55:36 BoogieIcfgContainer [2025-04-13 21:55:36,131 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:55:36,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:55:36,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:55:36,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:55:36,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:55:34" (1/3) ... [2025-04-13 21:55:36,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16545c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:55:36, skipping insertion in model container [2025-04-13 21:55:36,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:55:35" (2/3) ... [2025-04-13 21:55:36,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16545c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:55:36, skipping insertion in model container [2025-04-13 21:55:36,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:55:36" (3/3) ... [2025-04-13 21:55:36,137 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2025-04-13 21:55:36,147 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:55:36,148 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_70-funloop_racefree.i that has 2 procedures, 43 locations, 91 edges, 1 initial locations, 13 loop locations, and 2 error locations. [2025-04-13 21:55:36,148 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:55:36,193 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-13 21:55:36,215 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 92 transitions, 191 flow [2025-04-13 21:55:36,267 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 436 states, 429 states have (on average 3.9813519813519815) internal successors, (1708), 435 states have internal predecessors, (1708), 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-04-13 21:55:36,290 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:55:36,299 INFO L340 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=FINITE_AUTOMATA, 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;@280f1baf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:55:36,301 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 21:55:36,304 INFO L278 IsEmpty]: Start isEmpty. Operand has 436 states, 429 states have (on average 3.9813519813519815) internal successors, (1708), 435 states have internal predecessors, (1708), 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-04-13 21:55:36,309 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 21:55:36,309 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:36,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 21:55:36,310 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 21:55:36,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:36,314 INFO L85 PathProgramCache]: Analyzing trace with hash 648400752, now seen corresponding path program 1 times [2025-04-13 21:55:36,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:36,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297943564] [2025-04-13 21:55:36,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:55:36,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:36,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 21:55:36,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 21:55:36,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:55:36,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:36,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:36,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297943564] [2025-04-13 21:55:36,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297943564] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:36,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:36,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:55:36,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196079023] [2025-04-13 21:55:36,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:36,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:55:36,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:36,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:55:36,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:55:36,560 INFO L87 Difference]: Start difference. First operand has 436 states, 429 states have (on average 3.9813519813519815) internal successors, (1708), 435 states have internal predecessors, (1708), 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) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-04-13 21:55:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:36,693 INFO L93 Difference]: Finished difference Result 836 states and 3342 transitions. [2025-04-13 21:55:36,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:55:36,696 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2025-04-13 21:55:36,696 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:36,709 INFO L225 Difference]: With dead ends: 836 [2025-04-13 21:55:36,709 INFO L226 Difference]: Without dead ends: 402 [2025-04-13 21:55:36,714 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:55:36,716 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:36,716 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:55:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-04-13 21:55:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2025-04-13 21:55:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 397 states have (on average 2.118387909319899) internal successors, (841), 401 states have internal predecessors, (841), 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-04-13 21:55:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 841 transitions. [2025-04-13 21:55:36,775 INFO L79 Accepts]: Start accepts. Automaton has 402 states and 841 transitions. Word has length 5 [2025-04-13 21:55:36,775 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:36,775 INFO L485 AbstractCegarLoop]: Abstraction has 402 states and 841 transitions. [2025-04-13 21:55:36,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-04-13 21:55:36,776 INFO L278 IsEmpty]: Start isEmpty. Operand 402 states and 841 transitions. [2025-04-13 21:55:36,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 21:55:36,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:36,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:55:36,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:55:36,776 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 21:55:36,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:36,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1378930510, now seen corresponding path program 1 times [2025-04-13 21:55:36,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:36,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845960029] [2025-04-13 21:55:36,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:55:36,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:36,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:55:36,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:55:36,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:55:36,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:36,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:36,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845960029] [2025-04-13 21:55:36,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845960029] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:55:36,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559958558] [2025-04-13 21:55:36,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:55:36,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:55:36,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:55:36,912 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-04-13 21:55:36,914 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-04-13 21:55:36,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:55:36,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:55:36,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:55:36,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:36,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 21:55:36,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:55:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:37,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:55:37,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:37,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559958558] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:55:37,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:55:37,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 21:55:37,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850421074] [2025-04-13 21:55:37,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:55:37,028 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:55:37,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:37,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:55:37,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:55:37,030 INFO L87 Difference]: Start difference. First operand 402 states and 841 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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-04-13 21:55:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:37,159 INFO L93 Difference]: Finished difference Result 804 states and 1684 transitions. [2025-04-13 21:55:37,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:55:37,161 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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) Word has length 6 [2025-04-13 21:55:37,161 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:37,165 INFO L225 Difference]: With dead ends: 804 [2025-04-13 21:55:37,165 INFO L226 Difference]: Without dead ends: 405 [2025-04-13 21:55:37,166 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:55:37,166 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:37,166 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:55:37,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-04-13 21:55:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2025-04-13 21:55:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 400 states have (on average 2.11) internal successors, (844), 404 states have internal predecessors, (844), 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-04-13 21:55:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 844 transitions. [2025-04-13 21:55:37,184 INFO L79 Accepts]: Start accepts. Automaton has 405 states and 844 transitions. Word has length 6 [2025-04-13 21:55:37,184 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:37,184 INFO L485 AbstractCegarLoop]: Abstraction has 405 states and 844 transitions. [2025-04-13 21:55:37,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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-04-13 21:55:37,184 INFO L278 IsEmpty]: Start isEmpty. Operand 405 states and 844 transitions. [2025-04-13 21:55:37,184 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 21:55:37,184 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:37,184 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-13 21:55:37,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 21:55:37,389 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:55:37,389 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 21:55:37,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:37,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1452609520, now seen corresponding path program 2 times [2025-04-13 21:55:37,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:37,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298221159] [2025-04-13 21:55:37,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:55:37,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:37,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-13 21:55:37,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:55:37,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:55:37,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:37,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:37,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298221159] [2025-04-13 21:55:37,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298221159] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:55:37,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758909079] [2025-04-13 21:55:37,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:55:37,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:55:37,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:55:37,552 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-04-13 21:55:37,553 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-04-13 21:55:37,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-13 21:55:37,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:55:37,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:55:37,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:37,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:55:37,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:55:37,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:37,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:55:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:37,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758909079] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:55:37,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:55:37,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 21:55:37,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994799935] [2025-04-13 21:55:37,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:55:37,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:55:37,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:37,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:55:37,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:55:37,698 INFO L87 Difference]: Start difference. First operand 405 states and 844 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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-04-13 21:55:37,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:37,867 INFO L93 Difference]: Finished difference Result 810 states and 1693 transitions. [2025-04-13 21:55:37,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:55:37,867 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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) Word has length 9 [2025-04-13 21:55:37,867 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:37,869 INFO L225 Difference]: With dead ends: 810 [2025-04-13 21:55:37,869 INFO L226 Difference]: Without dead ends: 411 [2025-04-13 21:55:37,870 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:55:37,870 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:37,871 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:55:37,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-04-13 21:55:37,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-04-13 21:55:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 406 states have (on average 2.0935960591133007) internal successors, (850), 410 states have internal predecessors, (850), 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-04-13 21:55:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 850 transitions. [2025-04-13 21:55:37,885 INFO L79 Accepts]: Start accepts. Automaton has 411 states and 850 transitions. Word has length 9 [2025-04-13 21:55:37,885 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:37,885 INFO L485 AbstractCegarLoop]: Abstraction has 411 states and 850 transitions. [2025-04-13 21:55:37,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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-04-13 21:55:37,885 INFO L278 IsEmpty]: Start isEmpty. Operand 411 states and 850 transitions. [2025-04-13 21:55:37,885 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 21:55:37,885 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:37,885 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2025-04-13 21:55:37,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 21:55:38,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-13 21:55:38,091 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 21:55:38,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:38,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1066399920, now seen corresponding path program 3 times [2025-04-13 21:55:38,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:38,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556506553] [2025-04-13 21:55:38,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:55:38,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:38,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 6 equivalence classes. [2025-04-13 21:55:38,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:55:38,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:55:38,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:55:38,160 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:55:38,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:55:38,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:55:38,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:55:38,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:55:38,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:55:38,205 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:55:38,205 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 21:55:38,207 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 21:55:38,207 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 21:55:38,207 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 21:55:38,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:55:38,209 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-13 21:55:38,210 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:55:38,210 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 21:55:38,237 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:55:38,239 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 133 transitions, 282 flow [2025-04-13 21:55:38,544 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8429 states, 8410 states have (on average 5.950059453032105) internal successors, (50040), 8428 states have internal predecessors, (50040), 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-04-13 21:55:38,545 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:55:38,546 INFO L340 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=FINITE_AUTOMATA, 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;@280f1baf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:55:38,546 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 21:55:38,576 INFO L278 IsEmpty]: Start isEmpty. Operand has 8429 states, 8410 states have (on average 5.950059453032105) internal successors, (50040), 8428 states have internal predecessors, (50040), 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-04-13 21:55:38,577 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 21:55:38,577 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:38,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:55:38,577 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 21:55:38,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:38,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1736439396, now seen corresponding path program 1 times [2025-04-13 21:55:38,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:38,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105993072] [2025-04-13 21:55:38,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:55:38,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:38,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:55:38,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:55:38,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:55:38,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:38,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:38,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105993072] [2025-04-13 21:55:38,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105993072] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:38,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:38,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:55:38,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221561053] [2025-04-13 21:55:38,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:38,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:55:38,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:38,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:55:38,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:55:38,627 INFO L87 Difference]: Start difference. First operand has 8429 states, 8410 states have (on average 5.950059453032105) internal successors, (50040), 8428 states have internal predecessors, (50040), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04-13 21:55:39,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:39,090 INFO L93 Difference]: Finished difference Result 16473 states and 98535 transitions. [2025-04-13 21:55:39,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:55:39,090 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2025-04-13 21:55:39,090 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:39,173 INFO L225 Difference]: With dead ends: 16473 [2025-04-13 21:55:39,174 INFO L226 Difference]: Without dead ends: 8052 [2025-04-13 21:55:39,191 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:55:39,192 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:39,192 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:55:39,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8052 states. [2025-04-13 21:55:39,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8052 to 8052. [2025-04-13 21:55:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8052 states, 8037 states have (on average 3.1009082991165857) internal successors, (24922), 8051 states have internal predecessors, (24922), 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-04-13 21:55:39,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8052 states to 8052 states and 24922 transitions. [2025-04-13 21:55:39,534 INFO L79 Accepts]: Start accepts. Automaton has 8052 states and 24922 transitions. Word has length 6 [2025-04-13 21:55:39,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:39,534 INFO L485 AbstractCegarLoop]: Abstraction has 8052 states and 24922 transitions. [2025-04-13 21:55:39,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04-13 21:55:39,534 INFO L278 IsEmpty]: Start isEmpty. Operand 8052 states and 24922 transitions. [2025-04-13 21:55:39,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 21:55:39,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:39,535 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-04-13 21:55:39,535 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:55:39,535 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 21:55:39,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:39,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2092446262, now seen corresponding path program 1 times [2025-04-13 21:55:39,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:39,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864175466] [2025-04-13 21:55:39,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:55:39,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:39,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:55:39,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:55:39,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:55:39,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:39,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:39,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864175466] [2025-04-13 21:55:39,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864175466] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:39,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:39,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:55:39,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857067821] [2025-04-13 21:55:39,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:39,566 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:55:39,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:39,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:55:39,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:55:39,567 INFO L87 Difference]: Start difference. First operand 8052 states and 24922 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04-13 21:55:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:39,835 INFO L93 Difference]: Finished difference Result 16103 states and 49843 transitions. [2025-04-13 21:55:39,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:55:39,835 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 7 [2025-04-13 21:55:39,835 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:39,894 INFO L225 Difference]: With dead ends: 16103 [2025-04-13 21:55:39,894 INFO L226 Difference]: Without dead ends: 8053 [2025-04-13 21:55:39,909 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:55:39,910 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:39,910 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:55:39,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8053 states. [2025-04-13 21:55:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8053 to 8053. [2025-04-13 21:55:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8053 states, 8038 states have (on average 3.1006469270962924) internal successors, (24923), 8052 states have internal predecessors, (24923), 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-04-13 21:55:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8053 states to 8053 states and 24923 transitions. [2025-04-13 21:55:40,167 INFO L79 Accepts]: Start accepts. Automaton has 8053 states and 24923 transitions. Word has length 7 [2025-04-13 21:55:40,168 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:40,168 INFO L485 AbstractCegarLoop]: Abstraction has 8053 states and 24923 transitions. [2025-04-13 21:55:40,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04-13 21:55:40,168 INFO L278 IsEmpty]: Start isEmpty. Operand 8053 states and 24923 transitions. [2025-04-13 21:55:40,169 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 21:55:40,169 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:40,169 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 21:55:40,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:55:40,169 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 21:55:40,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:40,169 INFO L85 PathProgramCache]: Analyzing trace with hash -687170861, now seen corresponding path program 1 times [2025-04-13 21:55:40,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:40,169 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397837618] [2025-04-13 21:55:40,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:55:40,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:40,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:55:40,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:55:40,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:55:40,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:40,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:40,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397837618] [2025-04-13 21:55:40,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397837618] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:55:40,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251789217] [2025-04-13 21:55:40,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:55:40,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:55:40,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:55:40,223 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:55:40,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 21:55:40,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:55:40,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:55:40,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:55:40,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:40,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 21:55:40,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:55:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:40,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:55:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:40,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251789217] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:55:40,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:55:40,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 21:55:40,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440169569] [2025-04-13 21:55:40,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:55:40,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:55:40,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:40,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:55:40,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:55:40,320 INFO L87 Difference]: Start difference. First operand 8053 states and 24923 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-04-13 21:55:40,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:40,593 INFO L93 Difference]: Finished difference Result 16106 states and 49848 transitions. [2025-04-13 21:55:40,594 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:55:40,594 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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) Word has length 8 [2025-04-13 21:55:40,594 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:40,659 INFO L225 Difference]: With dead ends: 16106 [2025-04-13 21:55:40,659 INFO L226 Difference]: Without dead ends: 8056 [2025-04-13 21:55:40,673 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:55:40,673 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:40,674 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:55:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8056 states. [2025-04-13 21:55:40,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8056 to 8056. [2025-04-13 21:55:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8056 states, 8041 states have (on average 3.0998632010943914) internal successors, (24926), 8055 states have internal predecessors, (24926), 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-04-13 21:55:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8056 states to 8056 states and 24926 transitions. [2025-04-13 21:55:41,044 INFO L79 Accepts]: Start accepts. Automaton has 8056 states and 24926 transitions. Word has length 8 [2025-04-13 21:55:41,044 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:41,044 INFO L485 AbstractCegarLoop]: Abstraction has 8056 states and 24926 transitions. [2025-04-13 21:55:41,044 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-04-13 21:55:41,045 INFO L278 IsEmpty]: Start isEmpty. Operand 8056 states and 24926 transitions. [2025-04-13 21:55:41,045 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 21:55:41,045 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:41,045 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-04-13 21:55:41,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 21:55:41,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:55:41,246 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 21:55:41,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:41,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1302597258, now seen corresponding path program 2 times [2025-04-13 21:55:41,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:41,247 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869800754] [2025-04-13 21:55:41,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:55:41,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:41,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-13 21:55:41,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:55:41,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:55:41,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:41,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:41,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869800754] [2025-04-13 21:55:41,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869800754] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:55:41,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758408950] [2025-04-13 21:55:41,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:55:41,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:55:41,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:55:41,359 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:55:41,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 21:55:41,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-13 21:55:41,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:55:41,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:55:41,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:41,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:55:41,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:55:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:41,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:55:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:41,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758408950] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:55:41,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:55:41,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 21:55:41,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305379644] [2025-04-13 21:55:41,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:55:41,510 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:55:41,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:41,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:55:41,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:55:41,511 INFO L87 Difference]: Start difference. First operand 8056 states and 24926 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-04-13 21:55:41,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:41,756 INFO L93 Difference]: Finished difference Result 16112 states and 49857 transitions. [2025-04-13 21:55:41,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:55:41,757 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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) Word has length 11 [2025-04-13 21:55:41,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:41,805 INFO L225 Difference]: With dead ends: 16112 [2025-04-13 21:55:41,805 INFO L226 Difference]: Without dead ends: 8062 [2025-04-13 21:55:41,820 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:55:41,821 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:41,821 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:55:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2025-04-13 21:55:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 8062. [2025-04-13 21:55:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8062 states, 8047 states have (on average 3.0982975021747237) internal successors, (24932), 8061 states have internal predecessors, (24932), 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-04-13 21:55:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8062 states to 8062 states and 24932 transitions. [2025-04-13 21:55:42,058 INFO L79 Accepts]: Start accepts. Automaton has 8062 states and 24932 transitions. Word has length 11 [2025-04-13 21:55:42,058 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:55:42,058 INFO L485 AbstractCegarLoop]: Abstraction has 8062 states and 24932 transitions. [2025-04-13 21:55:42,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-04-13 21:55:42,058 INFO L278 IsEmpty]: Start isEmpty. Operand 8062 states and 24932 transitions. [2025-04-13 21:55:42,059 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 21:55:42,059 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:42,059 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2025-04-13 21:55:42,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 21:55:42,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:55:42,263 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 21:55:42,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:42,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1373471830, now seen corresponding path program 3 times [2025-04-13 21:55:42,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:42,264 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484319861] [2025-04-13 21:55:42,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:55:42,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:42,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-04-13 21:55:42,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:55:42,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:55:42,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:55:42,297 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:55:42,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:55:42,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:55:42,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:55:42,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:55:42,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:55:42,319 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:55:42,319 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 21:55:42,319 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 21:55:42,320 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 21:55:42,320 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 21:55:42,320 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 21:55:42,320 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:55:42,320 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-04-13 21:55:42,320 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:55:42,320 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 21:55:42,350 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 21:55:42,356 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 174 transitions, 375 flow [2025-04-13 21:55:48,046 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 161538 states, 161489 states have (on average 7.966474496714946) internal successors, (1286498), 161537 states have internal predecessors, (1286498), 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-04-13 21:55:48,050 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:55:48,050 INFO L340 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=FINITE_AUTOMATA, 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;@280f1baf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:55:48,050 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 21:55:48,440 INFO L278 IsEmpty]: Start isEmpty. Operand has 161538 states, 161489 states have (on average 7.966474496714946) internal successors, (1286498), 161537 states have internal predecessors, (1286498), 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-04-13 21:55:48,441 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 21:55:48,441 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:55:48,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:55:48,442 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:55:48,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:55:48,442 INFO L85 PathProgramCache]: Analyzing trace with hash -883885348, now seen corresponding path program 1 times [2025-04-13 21:55:48,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:55:48,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886316387] [2025-04-13 21:55:48,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:55:48,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:55:48,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:55:48,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:55:48,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:55:48,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:55:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:55:48,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:55:48,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886316387] [2025-04-13 21:55:48,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886316387] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:55:48,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:55:48,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:55:48,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249821407] [2025-04-13 21:55:48,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:55:48,457 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:55:48,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:55:48,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:55:48,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:55:48,795 INFO L87 Difference]: Start difference. First operand has 161538 states, 161489 states have (on average 7.966474496714946) internal successors, (1286498), 161537 states have internal predecessors, (1286498), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04-13 21:55:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:55:56,930 INFO L93 Difference]: Finished difference Result 316191 states and 2530679 transitions. [2025-04-13 21:55:56,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:55:56,931 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2025-04-13 21:55:56,931 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:55:59,067 INFO L225 Difference]: With dead ends: 316191 [2025-04-13 21:55:59,068 INFO L226 Difference]: Without dead ends: 154663 [2025-04-13 21:55:59,325 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:55:59,325 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:55:59,325 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:55:59,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154663 states. [2025-04-13 21:56:04,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154663 to 154663. [2025-04-13 21:56:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154663 states, 154622 states have (on average 4.135148943876033) internal successors, (639385), 154662 states have internal predecessors, (639385), 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-04-13 21:56:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154663 states to 154663 states and 639385 transitions. [2025-04-13 21:56:06,206 INFO L79 Accepts]: Start accepts. Automaton has 154663 states and 639385 transitions. Word has length 6 [2025-04-13 21:56:06,206 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:06,206 INFO L485 AbstractCegarLoop]: Abstraction has 154663 states and 639385 transitions. [2025-04-13 21:56:06,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04-13 21:56:06,206 INFO L278 IsEmpty]: Start isEmpty. Operand 154663 states and 639385 transitions. [2025-04-13 21:56:06,207 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 21:56:06,207 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:06,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:06,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 21:56:06,207 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:56:06,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:06,207 INFO L85 PathProgramCache]: Analyzing trace with hash 520702435, now seen corresponding path program 1 times [2025-04-13 21:56:06,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:06,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111517032] [2025-04-13 21:56:06,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:56:06,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:06,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:56:06,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:56:06,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:56:06,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:56:06,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:06,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111517032] [2025-04-13 21:56:06,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111517032] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:06,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:56:06,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:56:06,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404141554] [2025-04-13 21:56:06,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:06,238 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:56:06,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:06,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:56:06,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:56:06,238 INFO L87 Difference]: Start difference. First operand 154663 states and 639385 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-04-13 21:56:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:10,232 INFO L93 Difference]: Finished difference Result 309325 states and 1278769 transitions. [2025-04-13 21:56:10,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:56:10,232 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2025-04-13 21:56:10,232 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:12,003 INFO L225 Difference]: With dead ends: 309325 [2025-04-13 21:56:12,003 INFO L226 Difference]: Without dead ends: 154664 [2025-04-13 21:56:12,251 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:56:12,251 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:12,251 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:56:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154664 states. [2025-04-13 21:56:16,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154664 to 154664. [2025-04-13 21:56:17,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154664 states, 154623 states have (on average 4.135128667791984) internal successors, (639386), 154663 states have internal predecessors, (639386), 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-04-13 21:56:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154664 states to 154664 states and 639386 transitions. [2025-04-13 21:56:18,691 INFO L79 Accepts]: Start accepts. Automaton has 154664 states and 639386 transitions. Word has length 8 [2025-04-13 21:56:18,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:18,691 INFO L485 AbstractCegarLoop]: Abstraction has 154664 states and 639386 transitions. [2025-04-13 21:56:18,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-04-13 21:56:18,691 INFO L278 IsEmpty]: Start isEmpty. Operand 154664 states and 639386 transitions. [2025-04-13 21:56:18,692 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 21:56:18,692 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:18,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:18,692 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 21:56:18,692 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:56:18,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:18,692 INFO L85 PathProgramCache]: Analyzing trace with hash -712546412, now seen corresponding path program 1 times [2025-04-13 21:56:18,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:18,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379513270] [2025-04-13 21:56:18,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:56:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:18,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:56:18,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:56:18,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:56:18,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:56:18,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:18,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379513270] [2025-04-13 21:56:18,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379513270] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:56:18,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300948750] [2025-04-13 21:56:18,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:56:18,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:56:18,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:56:18,728 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:56:18,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 21:56:18,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:56:18,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:56:18,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:56:18,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:18,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-13 21:56:18,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:56:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:56:18,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 21:56:18,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300948750] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:56:18,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 21:56:18,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-04-13 21:56:18,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897867674] [2025-04-13 21:56:18,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:56:18,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:56:18,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:18,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:56:18,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:56:18,818 INFO L87 Difference]: Start difference. First operand 154664 states and 639386 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-04-13 21:56:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:56:20,719 INFO L93 Difference]: Finished difference Result 154682 states and 639405 transitions. [2025-04-13 21:56:20,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:56:20,720 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2025-04-13 21:56:20,721 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:56:22,283 INFO L225 Difference]: With dead ends: 154682 [2025-04-13 21:56:22,283 INFO L226 Difference]: Without dead ends: 154341 [2025-04-13 21:56:22,330 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:56:22,331 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:56:22,331 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:56:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154341 states. [2025-04-13 21:56:26,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154341 to 154341. [2025-04-13 21:56:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154341 states, 154302 states have (on average 4.139071431348913) internal successors, (638667), 154340 states have internal predecessors, (638667), 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-04-13 21:56:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154341 states to 154341 states and 638667 transitions. [2025-04-13 21:56:28,260 INFO L79 Accepts]: Start accepts. Automaton has 154341 states and 638667 transitions. Word has length 9 [2025-04-13 21:56:28,260 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:56:28,260 INFO L485 AbstractCegarLoop]: Abstraction has 154341 states and 638667 transitions. [2025-04-13 21:56:28,260 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-04-13 21:56:28,260 INFO L278 IsEmpty]: Start isEmpty. Operand 154341 states and 638667 transitions. [2025-04-13 21:56:28,261 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 21:56:28,261 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:56:28,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:56:28,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 21:56:28,461 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 21:56:28,461 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:56:28,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:56:28,462 INFO L85 PathProgramCache]: Analyzing trace with hash -574715610, now seen corresponding path program 1 times [2025-04-13 21:56:28,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:56:28,462 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442874973] [2025-04-13 21:56:28,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:56:28,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:56:28,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:56:28,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:56:28,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:56:28,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:56:28,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:56:28,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442874973] [2025-04-13 21:56:28,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442874973] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:56:28,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872078966] [2025-04-13 21:56:28,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:56:28,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:56:28,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:56:28,501 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:56:28,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 21:56:28,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:56:28,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:56:28,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:56:28,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:56:28,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 21:56:28,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:56:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:56:28,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:56:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:56:28,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872078966] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:56:28,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:56:28,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 21:56:28,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340936287] [2025-04-13 21:56:28,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:56:28,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:56:28,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:56:28,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:56:28,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:56:28,611 INFO L87 Difference]: Start difference. First operand 154341 states and 638667 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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)