/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:30:07,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:30:07,799 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 17:30:07,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:30:07,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:30:07,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:30:07,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:30:07,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:30:07,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:30:07,829 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:30:07,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:30:07,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:30:07,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:30:07,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:30:07,830 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:30:07,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:30:07,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:30:07,831 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:30:07,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:30:07,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:30:07,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:30:07,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:30:07,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:30:07,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:30:07,831 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:30:07,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:30:07,831 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:30:07,831 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:30:07,831 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:30:07,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:30:07,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:30:07,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:30:07,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:30:07,832 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:30:07,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:30:07,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:30:07,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:30:07,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:30:07,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:30:07,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:30:07,832 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:30:07,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:30:07,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:30:07,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:30:07,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:30:07,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:30:07,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:30:07,833 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 [2025-04-13 17:30:08,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:30:08,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:30:08,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:30:08,057 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:30:08,058 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:30:08,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-04-13 17:30:09,340 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a336cdfa/6115d2e76c79471788909b065655c24d/FLAG6b0b5fbba [2025-04-13 17:30:09,560 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:30:09,561 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-04-13 17:30:09,572 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a336cdfa/6115d2e76c79471788909b065655c24d/FLAG6b0b5fbba [2025-04-13 17:30:10,389 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a336cdfa/6115d2e76c79471788909b065655c24d [2025-04-13 17:30:10,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:30:10,394 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:30:10,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:30:10,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:30:10,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:30:10,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:30:10" (1/1) ... [2025-04-13 17:30:10,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60439af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:30:10, skipping insertion in model container [2025-04-13 17:30:10,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:30:10" (1/1) ... [2025-04-13 17:30:10,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:30:10,748 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_72-funloop_hard_racing.i[41323,41336] [2025-04-13 17:30:10,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:30:10,797 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:30:10,852 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_72-funloop_hard_racing.i[41323,41336] [2025-04-13 17:30:10,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:30:10,899 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:30:10,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:30:10 WrapperNode [2025-04-13 17:30:10,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:30:10,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:30:10,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:30:10,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:30:10,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:30:10" (1/1) ... [2025-04-13 17:30:10,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:30:10" (1/1) ... [2025-04-13 17:30:10,944 INFO L138 Inliner]: procedures = 272, calls = 109, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 314 [2025-04-13 17:30:10,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:30:10,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:30:10,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:30:10,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:30:10,952 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:30:10" (1/1) ... [2025-04-13 17:30:10,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:30:10" (1/1) ... [2025-04-13 17:30:10,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:30:10" (1/1) ... [2025-04-13 17:30:10,966 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 5, 75, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 7 writes are split as follows [0, 0, 6, 1]. [2025-04-13 17:30:10,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:30:10" (1/1) ... [2025-04-13 17:30:10,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:30:10" (1/1) ... [2025-04-13 17:30:10,973 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:30:10" (1/1) ... [2025-04-13 17:30:10,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:30:10" (1/1) ... [2025-04-13 17:30:10,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:30:10" (1/1) ... [2025-04-13 17:30:10,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:30:10" (1/1) ... [2025-04-13 17:30:10,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:30:10" (1/1) ... [2025-04-13 17:30:10,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:30:10,987 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:30:10,987 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:30:10,987 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:30:10,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:30:10" (1/1) ... [2025-04-13 17:30:10,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:30:11,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:30:11,013 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 17:30:11,015 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 17:30:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 17:30:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 17:30:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 17:30:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 17:30:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 17:30:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 17:30:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 17:30:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 17:30:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 17:30:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 17:30:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 17:30:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 17:30:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:30:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-13 17:30:11,032 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-13 17:30:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:30:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:30:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 17:30:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 17:30:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:30:11,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:30:11,034 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 17:30:11,155 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:30:11,157 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:30:11,492 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:30:11,492 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:30:11,492 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:30:11,820 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:30:11,820 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:30:11,823 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:30:11,827 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:30:11,829 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:30:11,829 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:30:11,831 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:30:11,832 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:30:11,833 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:30:11,834 WARN L179 LargeBlockEncoding]: Complex 3:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:30:11,836 WARN L179 LargeBlockEncoding]: Complex 4:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:30:11,838 WARN L179 LargeBlockEncoding]: Complex 2:4 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:30:11,839 WARN L179 LargeBlockEncoding]: Complex 2:4 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:30:11,841 INFO L313 CfgBuilder]: Removed 15 assume(true) statements. [2025-04-13 17:30:11,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:30:11 BoogieIcfgContainer [2025-04-13 17:30:11,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:30:11,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:30:11,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:30:11,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:30:11,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:30:10" (1/3) ... [2025-04-13 17:30:11,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc83c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:30:11, skipping insertion in model container [2025-04-13 17:30:11,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:30:10" (2/3) ... [2025-04-13 17:30:11,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc83c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:30:11, skipping insertion in model container [2025-04-13 17:30:11,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:30:11" (3/3) ... [2025-04-13 17:30:11,847 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2025-04-13 17:30:11,858 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:30:11,859 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_72-funloop_hard_racing.i that has 2 procedures, 63 locations, 114 edges, 1 initial locations, 20 loop locations, and 3 error locations. [2025-04-13 17:30:11,859 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:30:11,897 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-13 17:30:11,919 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 115 transitions, 237 flow [2025-04-13 17:30:11,985 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 853 states, 843 states have (on average 3.475682087781732) internal successors, (2930), 852 states have internal predecessors, (2930), 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 17:30:12,005 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:30:12,014 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;@4b06d6b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:30:12,015 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 17:30:12,018 INFO L278 IsEmpty]: Start isEmpty. Operand has 853 states, 843 states have (on average 3.475682087781732) internal successors, (2930), 852 states have internal predecessors, (2930), 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 17:30:12,021 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 17:30:12,022 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:12,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 17:30:12,022 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:30:12,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:12,027 INFO L85 PathProgramCache]: Analyzing trace with hash 927709397, now seen corresponding path program 1 times [2025-04-13 17:30:12,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:12,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195316510] [2025-04-13 17:30:12,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:30:12,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:12,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:30:12,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:30:12,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:12,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:12,268 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 17:30:12,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:12,269 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195316510] [2025-04-13 17:30:12,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195316510] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:12,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:12,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:30:12,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176645065] [2025-04-13 17:30:12,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:12,276 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:30:12,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:12,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:30:12,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:30:12,293 INFO L87 Difference]: Start difference. First operand has 853 states, 843 states have (on average 3.475682087781732) internal successors, (2930), 852 states have internal predecessors, (2930), 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 17:30:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:12,487 INFO L93 Difference]: Finished difference Result 1652 states and 5764 transitions. [2025-04-13 17:30:12,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:30:12,489 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 17:30:12,489 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:12,517 INFO L225 Difference]: With dead ends: 1652 [2025-04-13 17:30:12,517 INFO L226 Difference]: Without dead ends: 790 [2025-04-13 17:30:12,521 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 17:30:12,522 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:12,523 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:30:12,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-04-13 17:30:12,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2025-04-13 17:30:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 783 states have (on average 2.1149425287356323) internal successors, (1656), 789 states have internal predecessors, (1656), 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 17:30:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1656 transitions. [2025-04-13 17:30:12,584 INFO L79 Accepts]: Start accepts. Automaton has 790 states and 1656 transitions. Word has length 5 [2025-04-13 17:30:12,585 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:12,585 INFO L485 AbstractCegarLoop]: Abstraction has 790 states and 1656 transitions. [2025-04-13 17:30:12,585 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 17:30:12,585 INFO L278 IsEmpty]: Start isEmpty. Operand 790 states and 1656 transitions. [2025-04-13 17:30:12,585 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 17:30:12,585 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:12,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 17:30:12,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:30:12,586 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:30:12,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:12,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1308603382, now seen corresponding path program 1 times [2025-04-13 17:30:12,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:12,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479577265] [2025-04-13 17:30:12,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:30:12,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:12,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 17:30:12,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 17:30:12,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:12,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:12,703 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 17:30:12,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:12,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479577265] [2025-04-13 17:30:12,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479577265] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:30:12,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109302750] [2025-04-13 17:30:12,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:30:12,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:30:12,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:30:12,706 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 17:30:12,707 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 17:30:12,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 17:30:12,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 17:30:12,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:12,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:12,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 17:30:12,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:30:12,825 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 17:30:12,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:30:12,842 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 17:30:12,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109302750] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:30:12,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:30:12,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 17:30:12,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219418895] [2025-04-13 17:30:12,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:30:12,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:30:12,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:12,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:30:12,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:30:12,844 INFO L87 Difference]: Start difference. First operand 790 states and 1656 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 17:30:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:12,987 INFO L93 Difference]: Finished difference Result 1580 states and 3314 transitions. [2025-04-13 17:30:12,987 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:30:12,987 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 17:30:12,987 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:12,991 INFO L225 Difference]: With dead ends: 1580 [2025-04-13 17:30:12,991 INFO L226 Difference]: Without dead ends: 793 [2025-04-13 17:30:12,993 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 17:30:12,993 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:12,993 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:30:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-04-13 17:30:13,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 793. [2025-04-13 17:30:13,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 786 states have (on average 2.1106870229007635) internal successors, (1659), 792 states have internal predecessors, (1659), 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 17:30:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1659 transitions. [2025-04-13 17:30:13,052 INFO L79 Accepts]: Start accepts. Automaton has 793 states and 1659 transitions. Word has length 6 [2025-04-13 17:30:13,052 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:13,052 INFO L485 AbstractCegarLoop]: Abstraction has 793 states and 1659 transitions. [2025-04-13 17:30:13,052 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 17:30:13,053 INFO L278 IsEmpty]: Start isEmpty. Operand 793 states and 1659 transitions. [2025-04-13 17:30:13,053 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 17:30:13,053 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:13,053 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-13 17:30:13,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 17:30:13,257 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 17:30:13,257 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:30:13,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:13,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1989059051, now seen corresponding path program 2 times [2025-04-13 17:30:13,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:13,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995330445] [2025-04-13 17:30:13,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:30:13,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:13,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-13 17:30:13,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 17:30:13,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:30:13,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:13,409 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 17:30:13,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:13,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995330445] [2025-04-13 17:30:13,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995330445] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:30:13,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883557462] [2025-04-13 17:30:13,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:30:13,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:30:13,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:30:13,412 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 17:30:13,413 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 17:30:13,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-13 17:30:13,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 17:30:13,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:30:13,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:13,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 17:30:13,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:30:13,511 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 17:30:13,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:30:13,559 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 17:30:13,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883557462] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:30:13,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:30:13,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 17:30:13,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982956129] [2025-04-13 17:30:13,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:30:13,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:30:13,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:13,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:30:13,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:30:13,561 INFO L87 Difference]: Start difference. First operand 793 states and 1659 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 17:30:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:13,753 INFO L93 Difference]: Finished difference Result 1586 states and 3323 transitions. [2025-04-13 17:30:13,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:30:13,754 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 17:30:13,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:13,758 INFO L225 Difference]: With dead ends: 1586 [2025-04-13 17:30:13,758 INFO L226 Difference]: Without dead ends: 799 [2025-04-13 17:30:13,759 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 17:30:13,760 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:13,760 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:30:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-04-13 17:30:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2025-04-13 17:30:13,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 792 states have (on average 2.102272727272727) internal successors, (1665), 798 states have internal predecessors, (1665), 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 17:30:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1665 transitions. [2025-04-13 17:30:13,780 INFO L79 Accepts]: Start accepts. Automaton has 799 states and 1665 transitions. Word has length 9 [2025-04-13 17:30:13,780 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:13,780 INFO L485 AbstractCegarLoop]: Abstraction has 799 states and 1665 transitions. [2025-04-13 17:30:13,780 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 17:30:13,780 INFO L278 IsEmpty]: Start isEmpty. Operand 799 states and 1665 transitions. [2025-04-13 17:30:13,780 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 17:30:13,780 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:13,780 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2025-04-13 17:30:13,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 17:30:13,981 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 17:30:13,981 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:30:13,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:13,982 INFO L85 PathProgramCache]: Analyzing trace with hash -313251339, now seen corresponding path program 3 times [2025-04-13 17:30:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:13,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558739025] [2025-04-13 17:30:13,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:30:13,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:13,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 6 equivalence classes. [2025-04-13 17:30:14,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 17:30:14,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 17:30:14,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:30:14,019 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:30:14,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 17:30:14,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 17:30:14,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:14,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:30:14,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:30:14,056 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:30:14,057 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 17:30:14,058 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 17:30:14,058 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 17:30:14,058 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 17:30:14,058 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 17:30:14,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:30:14,060 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-13 17:30:14,061 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:30:14,061 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 17:30:14,090 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 17:30:14,092 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 153 transitions, 322 flow [2025-04-13 17:30:14,595 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 17305 states, 17279 states have (on average 5.218068175241623) internal successors, (90163), 17304 states have internal predecessors, (90163), 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 17:30:14,596 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:30:14,596 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;@4b06d6b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:30:14,596 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 17:30:14,651 INFO L278 IsEmpty]: Start isEmpty. Operand has 17305 states, 17279 states have (on average 5.218068175241623) internal successors, (90163), 17304 states have internal predecessors, (90163), 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 17:30:14,652 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 17:30:14,652 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:14,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 17:30:14,652 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:14,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:14,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1077746724, now seen corresponding path program 1 times [2025-04-13 17:30:14,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:14,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229606225] [2025-04-13 17:30:14,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:30:14,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:14,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 17:30:14,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 17:30:14,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:14,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:14,712 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 17:30:14,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:14,712 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229606225] [2025-04-13 17:30:14,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229606225] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:14,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:14,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:30:14,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789752716] [2025-04-13 17:30:14,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:14,712 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 17:30:14,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:14,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 17:30:14,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:30:14,758 INFO L87 Difference]: Start difference. First operand has 17305 states, 17279 states have (on average 5.218068175241623) internal successors, (90163), 17304 states have internal predecessors, (90163), 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 17:30:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:15,447 INFO L93 Difference]: Finished difference Result 34169 states and 178799 transitions. [2025-04-13 17:30:15,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 17:30:15,449 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 17:30:15,449 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:15,605 INFO L225 Difference]: With dead ends: 34169 [2025-04-13 17:30:15,605 INFO L226 Difference]: Without dead ends: 16850 [2025-04-13 17:30:15,641 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 17:30:15,642 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:15,643 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:30:15,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16850 states. [2025-04-13 17:30:16,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16850 to 16850. [2025-04-13 17:30:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16850 states, 16829 states have (on average 3.1020856854239707) internal successors, (52205), 16849 states have internal predecessors, (52205), 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 17:30:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16850 states to 16850 states and 52205 transitions. [2025-04-13 17:30:16,268 INFO L79 Accepts]: Start accepts. Automaton has 16850 states and 52205 transitions. Word has length 6 [2025-04-13 17:30:16,268 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:16,268 INFO L485 AbstractCegarLoop]: Abstraction has 16850 states and 52205 transitions. [2025-04-13 17:30:16,268 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 17:30:16,268 INFO L278 IsEmpty]: Start isEmpty. Operand 16850 states and 52205 transitions. [2025-04-13 17:30:16,269 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 17:30:16,270 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:16,270 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-04-13 17:30:16,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:30:16,270 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:16,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:16,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1084223937, now seen corresponding path program 1 times [2025-04-13 17:30:16,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:16,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865721107] [2025-04-13 17:30:16,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:30:16,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:16,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 17:30:16,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 17:30:16,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:16,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:16,314 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 17:30:16,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:16,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865721107] [2025-04-13 17:30:16,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865721107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:16,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:16,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:30:16,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103340854] [2025-04-13 17:30:16,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:16,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:30:16,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:16,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:30:16,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:30:16,315 INFO L87 Difference]: Start difference. First operand 16850 states and 52205 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 17:30:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:16,708 INFO L93 Difference]: Finished difference Result 33699 states and 104409 transitions. [2025-04-13 17:30:16,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:30:16,708 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 17:30:16,708 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:16,790 INFO L225 Difference]: With dead ends: 33699 [2025-04-13 17:30:16,790 INFO L226 Difference]: Without dead ends: 16851 [2025-04-13 17:30:16,818 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 17:30:16,819 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 17:30:16,819 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 17:30:16,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16851 states. [2025-04-13 17:30:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16851 to 16851. [2025-04-13 17:30:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16851 states, 16830 states have (on average 3.1019607843137256) internal successors, (52206), 16850 states have internal predecessors, (52206), 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 17:30:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16851 states to 16851 states and 52206 transitions. [2025-04-13 17:30:17,237 INFO L79 Accepts]: Start accepts. Automaton has 16851 states and 52206 transitions. Word has length 7 [2025-04-13 17:30:17,237 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:17,238 INFO L485 AbstractCegarLoop]: Abstraction has 16851 states and 52206 transitions. [2025-04-13 17:30:17,238 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 17:30:17,238 INFO L278 IsEmpty]: Start isEmpty. Operand 16851 states and 52206 transitions. [2025-04-13 17:30:17,238 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 17:30:17,238 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:17,238 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:17,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 17:30:17,238 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:17,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:17,239 INFO L85 PathProgramCache]: Analyzing trace with hash -166699779, now seen corresponding path program 1 times [2025-04-13 17:30:17,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:17,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756722146] [2025-04-13 17:30:17,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:30:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:17,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 17:30:17,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 17:30:17,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:17,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:17,289 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 17:30:17,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:17,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756722146] [2025-04-13 17:30:17,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756722146] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:30:17,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026576833] [2025-04-13 17:30:17,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:30:17,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:30:17,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:30:17,293 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 17:30:17,293 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 17:30:17,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 17:30:17,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 17:30:17,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:17,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:17,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 17:30:17,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:30:17,384 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 17:30:17,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:30:17,396 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 17:30:17,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026576833] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:30:17,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:30:17,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 17:30:17,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955598488] [2025-04-13 17:30:17,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:30:17,397 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:30:17,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:17,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:30:17,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:30:17,398 INFO L87 Difference]: Start difference. First operand 16851 states and 52206 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 17:30:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:17,951 INFO L93 Difference]: Finished difference Result 33702 states and 104414 transitions. [2025-04-13 17:30:17,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:30:17,952 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 17:30:17,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:18,170 INFO L225 Difference]: With dead ends: 33702 [2025-04-13 17:30:18,175 INFO L226 Difference]: Without dead ends: 16854 [2025-04-13 17:30:18,219 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 17:30:18,220 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:18,221 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:30:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16854 states. [2025-04-13 17:30:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16854 to 16854. [2025-04-13 17:30:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16854 states, 16833 states have (on average 3.1015861700231686) internal successors, (52209), 16853 states have internal predecessors, (52209), 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 17:30:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16854 states to 16854 states and 52209 transitions. [2025-04-13 17:30:18,737 INFO L79 Accepts]: Start accepts. Automaton has 16854 states and 52209 transitions. Word has length 8 [2025-04-13 17:30:18,737 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:18,737 INFO L485 AbstractCegarLoop]: Abstraction has 16854 states and 52209 transitions. [2025-04-13 17:30:18,737 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 17:30:18,737 INFO L278 IsEmpty]: Start isEmpty. Operand 16854 states and 52209 transitions. [2025-04-13 17:30:18,738 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 17:30:18,738 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:18,738 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-04-13 17:30:18,744 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 17:30:18,938 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 17:30:18,938 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:18,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:18,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1325326529, now seen corresponding path program 2 times [2025-04-13 17:30:18,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:18,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140690771] [2025-04-13 17:30:18,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:30:18,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:18,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-13 17:30:18,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 17:30:18,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:30:18,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:19,035 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 17:30:19,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:19,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140690771] [2025-04-13 17:30:19,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140690771] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:30:19,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966488732] [2025-04-13 17:30:19,036 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:30:19,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:30:19,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:30:19,037 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 17:30:19,039 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 17:30:19,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-13 17:30:19,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 17:30:19,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:30:19,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:19,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 17:30:19,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:30:19,133 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 17:30:19,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:30:19,179 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 17:30:19,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966488732] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:30:19,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:30:19,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 17:30:19,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268480423] [2025-04-13 17:30:19,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:30:19,179 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:30:19,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:19,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:30:19,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:30:19,180 INFO L87 Difference]: Start difference. First operand 16854 states and 52209 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 17:30:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:19,494 INFO L93 Difference]: Finished difference Result 33708 states and 104423 transitions. [2025-04-13 17:30:19,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:30:19,494 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 17:30:19,494 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:19,707 INFO L225 Difference]: With dead ends: 33708 [2025-04-13 17:30:19,707 INFO L226 Difference]: Without dead ends: 16860 [2025-04-13 17:30:19,727 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 17:30:19,728 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:19,728 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:30:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16860 states. [2025-04-13 17:30:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16860 to 16860. [2025-04-13 17:30:19,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16860 states, 16839 states have (on average 3.10083734188491) internal successors, (52215), 16859 states have internal predecessors, (52215), 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 17:30:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16860 states to 16860 states and 52215 transitions. [2025-04-13 17:30:20,056 INFO L79 Accepts]: Start accepts. Automaton has 16860 states and 52215 transitions. Word has length 11 [2025-04-13 17:30:20,056 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:20,056 INFO L485 AbstractCegarLoop]: Abstraction has 16860 states and 52215 transitions. [2025-04-13 17:30:20,056 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 17:30:20,056 INFO L278 IsEmpty]: Start isEmpty. Operand 16860 states and 52215 transitions. [2025-04-13 17:30:20,057 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 17:30:20,057 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:20,057 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2025-04-13 17:30:20,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 17:30:20,258 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 17:30:20,258 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:20,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:20,258 INFO L85 PathProgramCache]: Analyzing trace with hash 574371649, now seen corresponding path program 3 times [2025-04-13 17:30:20,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:20,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166240912] [2025-04-13 17:30:20,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:30:20,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:20,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-04-13 17:30:20,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:30:20,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 17:30:20,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:30:20,294 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:30:20,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 17:30:20,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:30:20,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:20,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:30:20,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:30:20,317 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:30:20,318 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 17:30:20,318 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 17:30:20,318 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 17:30:20,318 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 17:30:20,318 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 17:30:20,318 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 17:30:20,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 17:30:20,318 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-04-13 17:30:20,320 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:30:20,320 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 17:30:20,358 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 17:30:20,363 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 110 places, 191 transitions, 409 flow [2025-04-13 17:30:30,548 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 347751 states, 347687 states have (on average 6.99983893559437) internal successors, (2433753), 347750 states have internal predecessors, (2433753), 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 17:30:30,552 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:30:30,552 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;@4b06d6b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:30:30,552 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 17:30:31,262 INFO L278 IsEmpty]: Start isEmpty. Operand has 347751 states, 347687 states have (on average 6.99983893559437) internal successors, (2433753), 347750 states have internal predecessors, (2433753), 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 17:30:31,264 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 17:30:31,264 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:31,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 17:30:31,264 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:30:31,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:31,264 INFO L85 PathProgramCache]: Analyzing trace with hash 277726076, now seen corresponding path program 1 times [2025-04-13 17:30:31,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:31,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899054129] [2025-04-13 17:30:31,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:30:31,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:31,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 17:30:31,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 17:30:31,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:31,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:31,286 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 17:30:31,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:31,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899054129] [2025-04-13 17:30:31,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899054129] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:31,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:31,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:30:31,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695010587] [2025-04-13 17:30:31,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:31,286 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 17:30:31,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:31,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 17:30:31,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:30:31,928 INFO L87 Difference]: Start difference. First operand has 347751 states, 347687 states have (on average 6.99983893559437) internal successors, (2433753), 347750 states have internal predecessors, (2433753), 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 17:30:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:48,509 INFO L93 Difference]: Finished difference Result 687459 states and 4824203 transitions. [2025-04-13 17:30:48,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 17:30:48,509 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 17:30:48,509 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:52,618 INFO L225 Difference]: With dead ends: 687459 [2025-04-13 17:30:52,618 INFO L226 Difference]: Without dead ends: 339685 [2025-04-13 17:30:53,596 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 17:30:53,597 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:53,597 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:30:54,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339685 states. [2025-04-13 17:31:04,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339685 to 339685. [2025-04-13 17:31:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339685 states, 339630 states have (on average 4.139142596354857) internal successors, (1405777), 339684 states have internal predecessors, (1405777), 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 17:31:08,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339685 states to 339685 states and 1405777 transitions. [2025-04-13 17:31:09,501 INFO L79 Accepts]: Start accepts. Automaton has 339685 states and 1405777 transitions. Word has length 6 [2025-04-13 17:31:09,502 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:09,502 INFO L485 AbstractCegarLoop]: Abstraction has 339685 states and 1405777 transitions. [2025-04-13 17:31:09,502 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 17:31:09,502 INFO L278 IsEmpty]: Start isEmpty. Operand 339685 states and 1405777 transitions. [2025-04-13 17:31:09,502 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 17:31:09,502 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:09,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:09,503 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 17:31:09,503 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:31:09,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:09,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1513414861, now seen corresponding path program 1 times [2025-04-13 17:31:09,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:09,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788951696] [2025-04-13 17:31:09,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:31:09,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:09,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 17:31:09,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 17:31:09,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:31:09,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:09,533 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 17:31:09,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:09,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788951696] [2025-04-13 17:31:09,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788951696] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:09,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:09,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:31:09,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071868434] [2025-04-13 17:31:09,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:09,533 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:31:09,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:09,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:31:09,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:31:09,534 INFO L87 Difference]: Start difference. First operand 339685 states and 1405777 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)