/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:22:52,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:22:52,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:22:52,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:22:52,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:22:53,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:22:53,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:22:53,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:22:53,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:22:53,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:22:53,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:22:53,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:22:53,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:22:53,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:22:53,018 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:22:53,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:22:53,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:22:53,019 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:22:53,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:22:53,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:22:53,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:22:53,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:22:53,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:22:53,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:22:53,019 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:22:53,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:22:53,019 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:22:53,019 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:22:53,019 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:22:53,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:22:53,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:22:53,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:22:53,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:22:53,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:22:53,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:22:53,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:22:53,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:22:53,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:22:53,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:22:53,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:22:53,020 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:22:53,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:22:53,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:22:53,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:22:53,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:22:53,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:22:53,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:22:53,020 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:22:53,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:22:53,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:22:53,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:22:53,221 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:22:53,221 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:22:53,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2025-04-13 21:22:54,424 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1291f72fc/27059a47ec8641c5b44da7bf7e0851a7/FLAG0255daed4 [2025-04-13 21:22:54,690 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:22:54,691 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2025-04-13 21:22:54,708 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1291f72fc/27059a47ec8641c5b44da7bf7e0851a7/FLAG0255daed4 [2025-04-13 21:22:55,474 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1291f72fc/27059a47ec8641c5b44da7bf7e0851a7 [2025-04-13 21:22:55,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:22:55,477 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:22:55,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:22:55,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:22:55,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:22:55,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:22:55" (1/1) ... [2025-04-13 21:22:55,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a2ba21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:22:55, skipping insertion in model container [2025-04-13 21:22:55,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:22:55" (1/1) ... [2025-04-13 21:22:55,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:22:55,779 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2025-04-13 21:22:55,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2025-04-13 21:22:55,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:22:55,820 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:22:55,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2025-04-13 21:22:55,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2025-04-13 21:22:55,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:22:55,967 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:22:55,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:22:55 WrapperNode [2025-04-13 21:22:55,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:22:55,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:22:55,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:22:55,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:22:55,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:22:55" (1/1) ... [2025-04-13 21:22:55,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:22:55" (1/1) ... [2025-04-13 21:22:56,061 INFO L138 Inliner]: procedures = 274, calls = 852, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 991 [2025-04-13 21:22:56,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:22:56,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:22:56,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:22:56,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:22:56,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:22:55" (1/1) ... [2025-04-13 21:22:56,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:22:55" (1/1) ... [2025-04-13 21:22:56,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:22:55" (1/1) ... [2025-04-13 21:22:56,116 INFO L175 MemorySlicer]: Split 835 memory accesses to 4 slices as follows [2, 5, 426, 402]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 5, 403, 400]. The 11 writes are split as follows [0, 0, 10, 1]. [2025-04-13 21:22:56,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:22:55" (1/1) ... [2025-04-13 21:22:56,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:22:55" (1/1) ... [2025-04-13 21:22:56,147 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:22:55" (1/1) ... [2025-04-13 21:22:56,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:22:55" (1/1) ... [2025-04-13 21:22:56,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:22:55" (1/1) ... [2025-04-13 21:22:56,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:22:55" (1/1) ... [2025-04-13 21:22:56,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:22:56,172 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:22:56,172 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:22:56,172 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:22:56,172 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:22:55" (1/1) ... [2025-04-13 21:22:56,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:22:56,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:22:56,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:22:56,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:22:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 21:22:56,215 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 21:22:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 21:22:56,215 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 21:22:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 21:22:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:22:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:22:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 21:22:56,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 21:22:56,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:22:56,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:22:56,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 21:22:56,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 21:22:56,216 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 21:22:56,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:22:56,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:22:56,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:22:56,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 21:22:56,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 21:22:56,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:22:56,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:22:56,217 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:22:56,333 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:22:56,334 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:22:57,256 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:22:57,257 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:22:57,258 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:23:07,876 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:23:07,902 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:23:07,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:23:07 BoogieIcfgContainer [2025-04-13 21:23:07,903 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:23:07,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:23:07,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:23:07,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:23:07,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:22:55" (1/3) ... [2025-04-13 21:23:07,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6abf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:23:07, skipping insertion in model container [2025-04-13 21:23:07,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:22:55" (2/3) ... [2025-04-13 21:23:07,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6abf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:23:07, skipping insertion in model container [2025-04-13 21:23:07,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:23:07" (3/3) ... [2025-04-13 21:23:07,912 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2025-04-13 21:23:07,925 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:23:07,926 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok_longer.i that has 3 procedures, 24 locations, 24 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 21:23:07,926 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:23:08,023 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:23:08,042 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 29 transitions, 72 flow [2025-04-13 21:23:08,056 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 92 states, 90 states have (on average 2.7) internal successors, (243), 91 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:08,078 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:23:08,086 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;@4a4ace80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:23:08,086 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 21:23:08,089 INFO L278 IsEmpty]: Start isEmpty. Operand has 92 states, 90 states have (on average 2.7) internal successors, (243), 91 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:08,092 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2025-04-13 21:23:08,092 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:23:08,092 INFO L218 NwaCegarLoop]: trace histogram [1] [2025-04-13 21:23:08,092 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:23:08,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:23:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2084, now seen corresponding path program 1 times [2025-04-13 21:23:08,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:23:08,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659438464] [2025-04-13 21:23:08,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:23:08,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:23:08,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-13 21:23:08,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-13 21:23:08,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:23:08,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:23:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:23:08,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:23:08,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659438464] [2025-04-13 21:23:08,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659438464] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:23:08,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:23:08,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-13 21:23:08,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242713854] [2025-04-13 21:23:08,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:23:08,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:23:08,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:23:08,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:23:08,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:23:08,201 INFO L87 Difference]: Start difference. First operand has 92 states, 90 states have (on average 2.7) internal successors, (243), 91 states have internal predecessors, (243), 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, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:08,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:23:08,348 INFO L93 Difference]: Finished difference Result 92 states and 243 transitions. [2025-04-13 21:23:08,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:23:08,351 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2025-04-13 21:23:08,351 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:23:08,357 INFO L225 Difference]: With dead ends: 92 [2025-04-13 21:23:08,358 INFO L226 Difference]: Without dead ends: 91 [2025-04-13 21:23:08,359 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:23:08,364 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:23:08,365 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:23:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-13 21:23:08,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-04-13 21:23:08,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 2.688888888888889) internal successors, (242), 90 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 242 transitions. [2025-04-13 21:23:08,392 INFO L79 Accepts]: Start accepts. Automaton has 91 states and 242 transitions. Word has length 1 [2025-04-13 21:23:08,393 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:23:08,393 INFO L485 AbstractCegarLoop]: Abstraction has 91 states and 242 transitions. [2025-04-13 21:23:08,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:08,393 INFO L278 IsEmpty]: Start isEmpty. Operand 91 states and 242 transitions. [2025-04-13 21:23:08,393 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 21:23:08,393 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:23:08,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:23:08,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:23:08,393 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:23:08,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:23:08,394 INFO L85 PathProgramCache]: Analyzing trace with hash 972520302, now seen corresponding path program 1 times [2025-04-13 21:23:08,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:23:08,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690074068] [2025-04-13 21:23:08,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:23:08,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:23:08,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:23:08,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:23:08,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:23:08,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:23:09,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:23:09,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:23:09,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690074068] [2025-04-13 21:23:09,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690074068] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:23:09,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:23:09,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:23:09,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254552476] [2025-04-13 21:23:09,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:23:09,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:23:09,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:23:09,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:23:09,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:23:09,122 INFO L87 Difference]: Start difference. First operand 91 states and 242 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:09,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:23:09,311 INFO L93 Difference]: Finished difference Result 144 states and 377 transitions. [2025-04-13 21:23:09,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:23:09,312 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-13 21:23:09,312 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:23:09,313 INFO L225 Difference]: With dead ends: 144 [2025-04-13 21:23:09,313 INFO L226 Difference]: Without dead ends: 95 [2025-04-13 21:23:09,314 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:23:09,314 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:23:09,314 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:23:09,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-13 21:23:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-04-13 21:23:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 2.478723404255319) internal successors, (233), 94 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 233 transitions. [2025-04-13 21:23:09,327 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 233 transitions. Word has length 7 [2025-04-13 21:23:09,327 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:23:09,327 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 233 transitions. [2025-04-13 21:23:09,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:09,327 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 233 transitions. [2025-04-13 21:23:09,328 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 21:23:09,328 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:23:09,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:23:09,328 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:23:09,328 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:23:09,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:23:09,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1094900982, now seen corresponding path program 1 times [2025-04-13 21:23:09,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:23:09,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055516900] [2025-04-13 21:23:09,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:23:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:23:09,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:23:09,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:23:09,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:23:09,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:23:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:23:09,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:23:09,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055516900] [2025-04-13 21:23:09,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055516900] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:23:09,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:23:09,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:23:09,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268633331] [2025-04-13 21:23:09,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:23:09,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:23:09,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:23:09,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:23:09,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:23:09,592 INFO L87 Difference]: Start difference. First operand 95 states and 233 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:09,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:23:09,761 INFO L93 Difference]: Finished difference Result 110 states and 268 transitions. [2025-04-13 21:23:09,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:23:09,761 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 11 [2025-04-13 21:23:09,761 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:23:09,762 INFO L225 Difference]: With dead ends: 110 [2025-04-13 21:23:09,762 INFO L226 Difference]: Without dead ends: 67 [2025-04-13 21:23:09,762 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:23:09,763 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:23:09,763 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:23:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-13 21:23:09,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-04-13 21:23:09,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 2.1363636363636362) internal successors, (141), 66 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 141 transitions. [2025-04-13 21:23:09,767 INFO L79 Accepts]: Start accepts. Automaton has 67 states and 141 transitions. Word has length 11 [2025-04-13 21:23:09,768 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:23:09,768 INFO L485 AbstractCegarLoop]: Abstraction has 67 states and 141 transitions. [2025-04-13 21:23:09,768 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:09,768 INFO L278 IsEmpty]: Start isEmpty. Operand 67 states and 141 transitions. [2025-04-13 21:23:09,768 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 21:23:09,769 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:23:09,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:23:09,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:23:09,769 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:23:09,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:23:09,769 INFO L85 PathProgramCache]: Analyzing trace with hash -423680661, now seen corresponding path program 1 times [2025-04-13 21:23:09,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:23:09,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134173074] [2025-04-13 21:23:09,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:23:09,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:23:09,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 21:23:09,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:23:09,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:23:09,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:23:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:23:09,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:23:09,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134173074] [2025-04-13 21:23:09,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134173074] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:23:09,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197910264] [2025-04-13 21:23:09,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:23:09,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:23:09,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:23:09,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:23:09,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 21:23:10,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 21:23:10,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:23:10,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:23:10,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:23:10,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 1792 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 21:23:10,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:23:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:23:10,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:23:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:23:10,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197910264] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:23:10,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:23:10,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 21:23:10,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785686150] [2025-04-13 21:23:10,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:23:10,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:23:10,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:23:10,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:23:10,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:23:10,284 INFO L87 Difference]: Start difference. First operand 67 states and 141 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:10,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:23:10,925 INFO L93 Difference]: Finished difference Result 120 states and 268 transitions. [2025-04-13 21:23:10,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:23:10,926 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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 13 [2025-04-13 21:23:10,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:23:10,927 INFO L225 Difference]: With dead ends: 120 [2025-04-13 21:23:10,927 INFO L226 Difference]: Without dead ends: 85 [2025-04-13 21:23:10,927 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:23:10,928 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:23:10,928 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:23:10,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-13 21:23:10,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-04-13 21:23:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 2.107142857142857) internal successors, (177), 84 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 177 transitions. [2025-04-13 21:23:10,934 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 177 transitions. Word has length 13 [2025-04-13 21:23:10,935 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:23:10,935 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 177 transitions. [2025-04-13 21:23:10,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:10,935 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 177 transitions. [2025-04-13 21:23:10,935 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 21:23:10,935 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:23:10,935 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:23:10,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 21:23:11,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:23:11,140 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:23:11,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:23:11,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1711220670, now seen corresponding path program 2 times [2025-04-13 21:23:11,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:23:11,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310494704] [2025-04-13 21:23:11,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:23:11,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:23:11,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:23:11,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:23:11,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:23:11,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:23:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:23:11,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:23:11,423 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310494704] [2025-04-13 21:23:11,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310494704] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:23:11,423 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600745963] [2025-04-13 21:23:11,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:23:11,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:23:11,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:23:11,427 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:23:11,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 21:23:11,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:23:14,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:23:14,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:23:14,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:23:14,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 1864 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:23:14,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:23:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:23:14,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:23:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:23:14,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600745963] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:23:14,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:23:14,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 21:23:14,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062993975] [2025-04-13 21:23:14,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:23:14,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:23:14,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:23:14,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:23:14,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:23:14,486 INFO L87 Difference]: Start difference. First operand 85 states and 177 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:23:14,989 INFO L93 Difference]: Finished difference Result 156 states and 358 transitions. [2025-04-13 21:23:14,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:23:14,989 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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 16 [2025-04-13 21:23:14,990 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:23:14,990 INFO L225 Difference]: With dead ends: 156 [2025-04-13 21:23:14,990 INFO L226 Difference]: Without dead ends: 121 [2025-04-13 21:23:14,991 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:23:14,991 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:23:14,991 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:23:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-04-13 21:23:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-04-13 21:23:14,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.075) internal successors, (249), 120 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 249 transitions. [2025-04-13 21:23:15,001 INFO L79 Accepts]: Start accepts. Automaton has 121 states and 249 transitions. Word has length 16 [2025-04-13 21:23:15,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:23:15,002 INFO L485 AbstractCegarLoop]: Abstraction has 121 states and 249 transitions. [2025-04-13 21:23:15,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:15,002 INFO L278 IsEmpty]: Start isEmpty. Operand 121 states and 249 transitions. [2025-04-13 21:23:15,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 21:23:15,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:23:15,002 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:23:15,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 21:23:15,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:23:15,203 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:23:15,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:23:15,203 INFO L85 PathProgramCache]: Analyzing trace with hash -444885086, now seen corresponding path program 3 times [2025-04-13 21:23:15,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:23:15,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150468290] [2025-04-13 21:23:15,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:23:15,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:23:15,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-04-13 21:23:16,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:23:16,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:23:16,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:23:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:23:16,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:23:16,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150468290] [2025-04-13 21:23:16,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150468290] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:23:16,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427212134] [2025-04-13 21:23:16,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:23:16,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:23:16,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:23:16,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:23:16,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 21:23:16,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-04-13 21:23:21,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:23:21,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:23:21,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:23:21,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 2008 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 21:23:21,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:23:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:23:22,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:23:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:23:22,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427212134] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:23:22,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:23:22,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2025-04-13 21:23:22,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217045430] [2025-04-13 21:23:22,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:23:22,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 21:23:22,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:23:22,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 21:23:22,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:23:22,168 INFO L87 Difference]: Start difference. First operand 121 states and 249 transitions. Second operand has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:23:22,554 INFO L93 Difference]: Finished difference Result 228 states and 538 transitions. [2025-04-13 21:23:22,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 21:23:22,555 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 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 22 [2025-04-13 21:23:22,555 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:23:22,556 INFO L225 Difference]: With dead ends: 228 [2025-04-13 21:23:22,556 INFO L226 Difference]: Without dead ends: 193 [2025-04-13 21:23:22,557 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:23:22,557 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 420 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:23:22,557 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 0 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 21:23:22,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-13 21:23:22,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-04-13 21:23:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 2.046875) internal successors, (393), 192 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 393 transitions. [2025-04-13 21:23:22,567 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 393 transitions. Word has length 22 [2025-04-13 21:23:22,567 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:23:22,567 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 393 transitions. [2025-04-13 21:23:22,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:22,567 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 393 transitions. [2025-04-13 21:23:22,568 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 21:23:22,568 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:23:22,568 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:23:22,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 21:23:22,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:23:22,768 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:23:22,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:23:22,769 INFO L85 PathProgramCache]: Analyzing trace with hash -512229790, now seen corresponding path program 4 times [2025-04-13 21:23:22,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:23:22,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409843300] [2025-04-13 21:23:22,769 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:23:22,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:23:22,816 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-13 21:23:22,853 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 21:23:22,853 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:23:22,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:23:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:23:23,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:23:23,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409843300] [2025-04-13 21:23:23,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409843300] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:23:23,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886310430] [2025-04-13 21:23:23,574 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:23:23,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:23:23,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:23:23,576 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:23:23,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 21:23:23,738 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-13 21:23:23,928 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 21:23:23,929 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:23:23,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:23:23,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 2296 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 21:23:23,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:23:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:23:23,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:23:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:23:24,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886310430] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:23:24,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:23:24,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-04-13 21:23:24,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379994351] [2025-04-13 21:23:24,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:23:24,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-13 21:23:24,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:23:24,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-13 21:23:24,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 21:23:24,501 INFO L87 Difference]: Start difference. First operand 193 states and 393 transitions. Second operand has 49 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:23:25,191 INFO L93 Difference]: Finished difference Result 372 states and 898 transitions. [2025-04-13 21:23:25,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 21:23:25,191 INFO L79 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 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 34 [2025-04-13 21:23:25,192 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:23:25,193 INFO L225 Difference]: With dead ends: 372 [2025-04-13 21:23:25,193 INFO L226 Difference]: Without dead ends: 337 [2025-04-13 21:23:25,194 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 21:23:25,194 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 656 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:23:25,194 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 0 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:23:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-04-13 21:23:25,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-04-13 21:23:25,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 2.0267857142857144) internal successors, (681), 336 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 681 transitions. [2025-04-13 21:23:25,210 INFO L79 Accepts]: Start accepts. Automaton has 337 states and 681 transitions. Word has length 34 [2025-04-13 21:23:25,210 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:23:25,210 INFO L485 AbstractCegarLoop]: Abstraction has 337 states and 681 transitions. [2025-04-13 21:23:25,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:25,210 INFO L278 IsEmpty]: Start isEmpty. Operand 337 states and 681 transitions. [2025-04-13 21:23:25,212 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-13 21:23:25,212 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:23:25,212 INFO L218 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:23:25,224 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 21:23:25,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:23:25,413 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 21:23:25,413 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:23:25,413 INFO L85 PathProgramCache]: Analyzing trace with hash 87321570, now seen corresponding path program 5 times [2025-04-13 21:23:25,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:23:25,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276539670] [2025-04-13 21:23:25,413 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:23:25,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:23:25,479 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 24 equivalence classes. [2025-04-13 21:23:28,352 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 58 of 58 statements. [2025-04-13 21:23:28,352 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-04-13 21:23:28,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:23:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:23:30,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:23:30,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276539670] [2025-04-13 21:23:30,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276539670] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:23:30,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006061974] [2025-04-13 21:23:30,641 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:23:30,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:23:30,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:23:30,643 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:23:30,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 21:23:30,887 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 24 equivalence classes. Received shutdown request... [2025-04-13 21:37:30,823 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:37:30,824 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:37:31,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2025-04-13 21:37:32,024 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forcibly destroying the process [2025-04-13 21:37:32,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 137 [2025-04-13 21:37:32,091 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 21:37:32,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-04-13 21:37:32,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2025-04-13 21:37:32,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127221608] [2025-04-13 21:37:32,092 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-04-13 21:37:32,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-13 21:37:32,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:37:32,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-13 21:37:32,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 21:37:32,093 INFO L87 Difference]: Start difference. First operand 337 states and 681 transitions. Second operand has 49 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:37:32,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:37:32,097 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 21:37:32,097 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:37:32,097 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 21:37:32,098 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 21:37:32,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:37:32,098 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (337states) and FLOYD_HOARE automaton (currently 2 states, 49 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). [2025-04-13 21:37:32,100 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 21:37:32,101 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 21:37:32,101 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 21:37:32,101 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 21:37:32,103 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2025-04-13 21:37:32,105 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:37:32,105 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:37:32,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:37:32 BasicIcfg [2025-04-13 21:37:32,107 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:37:32,107 INFO L158 Benchmark]: Toolchain (without parser) took 876630.00ms. Allocated memory was 142.6MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 98.9MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 900.7MB. Max. memory is 8.0GB. [2025-04-13 21:37:32,107 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 155.2MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:37:32,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.56ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 58.1MB in the end (delta: 40.8MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-13 21:37:32,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.25ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 48.8MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 21:37:32,108 INFO L158 Benchmark]: Boogie Preprocessor took 105.71ms. Allocated memory is still 142.6MB. Free memory was 48.8MB in the beginning and 40.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 21:37:32,108 INFO L158 Benchmark]: IcfgBuilder took 11731.32ms. Allocated memory was 142.6MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 40.4MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2025-04-13 21:37:32,108 INFO L158 Benchmark]: TraceAbstraction took 864200.60ms. Allocated memory was 3.2GB in the beginning and 4.7GB in the end (delta: 1.4GB). Free memory was 1.9GB in the beginning and 3.7GB in the end (delta: -1.8GB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:37:32,109 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 155.2MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 489.56ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 58.1MB in the end (delta: 40.8MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 96.25ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 48.8MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 105.71ms. Allocated memory is still 142.6MB. Free memory was 48.8MB in the beginning and 40.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * IcfgBuilder took 11731.32ms. Allocated memory was 142.6MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 40.4MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * TraceAbstraction took 864200.60ms. Allocated memory was 3.2GB in the beginning and 4.7GB in the end (delta: 1.4GB). Free memory was 1.9GB in the beginning and 3.7GB in the end (delta: -1.8GB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (337states) and FLOYD_HOARE automaton (currently 2 states, 49 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (337states) and FLOYD_HOARE automaton (currently 2 states, 49 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (337states) and FLOYD_HOARE automaton (currently 2 states, 49 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (337states) and FLOYD_HOARE automaton (currently 2 states, 49 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 42 locations, 51 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 864.1s, OverallIterations: 8, TraceHistogramMax: 46, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1174 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1174 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 841 IncrementalHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 0 mSDtfsCounter, 841 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=337occurred in iteration=7, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 12.6s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 777 SizeOfPredicates, 1 NumberOfNonLiveVariables, 7960 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 1/2039 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown