/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread/queue_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 16:54:05,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 16:54:05,307 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 16:54:05,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 16:54:05,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 16:54:05,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 16:54:05,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 16:54:05,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 16:54:05,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 16:54:05,331 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 16:54:05,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 16:54:05,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 16:54:05,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 16:54:05,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 16:54:05,331 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 16:54:05,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 16:54:05,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 16:54:05,331 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 16:54:05,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 16:54:05,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 16:54:05,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 16:54:05,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 16:54:05,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 16:54:05,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 16:54:05,332 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 16:54:05,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 16:54:05,332 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 16:54:05,332 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 16:54:05,332 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 16:54:05,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 16:54:05,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 16:54:05,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 16:54:05,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:54:05,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 16:54:05,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 16:54:05,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 16:54:05,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 16:54:05,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:54:05,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 16:54:05,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 16:54:05,333 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 16:54:05,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 16:54:05,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 16:54:05,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 16:54:05,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 16:54:05,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 16:54:05,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 16:54:05,336 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 16:54:05,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 16:54:05,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 16:54:05,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 16:54:05,554 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 16:54:05,554 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 16:54:05,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2025-04-13 16:54:06,832 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a02f5478/8cda47739dc9457bb5a80bf7a76bccb1/FLAGec9179672 [2025-04-13 16:54:07,067 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 16:54:07,067 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2025-04-13 16:54:07,079 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a02f5478/8cda47739dc9457bb5a80bf7a76bccb1/FLAGec9179672 [2025-04-13 16:54:07,882 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a02f5478/8cda47739dc9457bb5a80bf7a76bccb1 [2025-04-13 16:54:07,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 16:54:07,885 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 16:54:07,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 16:54:07,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 16:54:07,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 16:54:07,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:54:07" (1/1) ... [2025-04-13 16:54:07,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49e9165a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:07, skipping insertion in model container [2025-04-13 16:54:07,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:54:07" (1/1) ... [2025-04-13 16:54:07,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 16:54:08,248 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_longer.i[43296,43309] [2025-04-13 16:54:08,256 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_longer.i[43503,43516] [2025-04-13 16:54:08,260 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_longer.i[43783,43796] [2025-04-13 16:54:08,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 16:54:08,294 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 16:54:08,357 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_longer.i[43296,43309] [2025-04-13 16:54:08,358 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_longer.i[43503,43516] [2025-04-13 16:54:08,359 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_longer.i[43783,43796] [2025-04-13 16:54:08,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 16:54:08,442 INFO L204 MainTranslator]: Completed translation [2025-04-13 16:54:08,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:08 WrapperNode [2025-04-13 16:54:08,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 16:54:08,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 16:54:08,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 16:54:08,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 16:54:08,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:08" (1/1) ... [2025-04-13 16:54:08,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:08" (1/1) ... [2025-04-13 16:54:08,532 INFO L138 Inliner]: procedures = 274, calls = 856, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1034 [2025-04-13 16:54:08,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 16:54:08,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 16:54:08,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 16:54:08,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 16:54:08,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:08" (1/1) ... [2025-04-13 16:54:08,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:08" (1/1) ... [2025-04-13 16:54:08,555 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:08" (1/1) ... [2025-04-13 16:54:08,586 INFO L175 MemorySlicer]: Split 844 memory accesses to 4 slices as follows [2, 5, 403, 434]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 5, 400, 403]. The 16 writes are split as follows [0, 0, 2, 14]. [2025-04-13 16:54:08,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:08" (1/1) ... [2025-04-13 16:54:08,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:08" (1/1) ... [2025-04-13 16:54:08,616 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:08" (1/1) ... [2025-04-13 16:54:08,621 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:08" (1/1) ... [2025-04-13 16:54:08,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:08" (1/1) ... [2025-04-13 16:54:08,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:08" (1/1) ... [2025-04-13 16:54:08,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:08" (1/1) ... [2025-04-13 16:54:08,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 16:54:08,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 16:54:08,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 16:54:08,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 16:54:08,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:08" (1/1) ... [2025-04-13 16:54:08,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:54:08,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:54:08,673 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 16:54:08,679 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 16:54:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 16:54:08,692 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 16:54:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 16:54:08,693 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 16:54:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 16:54:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 16:54:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 16:54:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 16:54:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 16:54:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 16:54:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 16:54:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 16:54:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 16:54:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 16:54:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 16:54:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 16:54:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 16:54:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 16:54:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 16:54:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 16:54:08,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 16:54:08,695 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 16:54:08,809 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 16:54:08,810 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 16:54:09,750 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 16:54:09,751 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 16:54:09,751 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 16:54:21,086 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 16:54:21,087 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 16:54:21,088 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 16:54:21,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:54:21 BoogieIcfgContainer [2025-04-13 16:54:21,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 16:54:21,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 16:54:21,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 16:54:21,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 16:54:21,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 04:54:07" (1/3) ... [2025-04-13 16:54:21,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dfe53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:54:21, skipping insertion in model container [2025-04-13 16:54:21,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:08" (2/3) ... [2025-04-13 16:54:21,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dfe53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:54:21, skipping insertion in model container [2025-04-13 16:54:21,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:54:21" (3/3) ... [2025-04-13 16:54:21,096 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2025-04-13 16:54:21,108 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 16:54:21,109 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longer.i that has 3 procedures, 28 locations, 30 edges, 1 initial locations, 2 loop locations, and 3 error locations. [2025-04-13 16:54:21,109 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 16:54:21,180 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 16:54:21,200 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 32 transitions, 78 flow [2025-04-13 16:54:21,230 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 171 states, 167 states have (on average 2.6526946107784433) internal successors, (443), 170 states have internal predecessors, (443), 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 16:54:21,249 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 16:54:21,258 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;@2c90c15f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 16:54:21,258 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 16:54:21,260 INFO L278 IsEmpty]: Start isEmpty. Operand has 171 states, 167 states have (on average 2.6526946107784433) internal successors, (443), 170 states have internal predecessors, (443), 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 16:54:21,264 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2025-04-13 16:54:21,264 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:21,265 INFO L218 NwaCegarLoop]: trace histogram [1] [2025-04-13 16:54:21,265 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 4 more)] === [2025-04-13 16:54:21,268 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2248, now seen corresponding path program 1 times [2025-04-13 16:54:21,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:21,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742760715] [2025-04-13 16:54:21,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:21,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:21,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-13 16:54:21,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-13 16:54:21,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:21,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:21,355 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 16:54:21,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:21,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742760715] [2025-04-13 16:54:21,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742760715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:54:21,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:54:21,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-13 16:54:21,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040073323] [2025-04-13 16:54:21,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:54:21,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 16:54:21,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:21,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 16:54:21,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 16:54:21,376 INFO L87 Difference]: Start difference. First operand has 171 states, 167 states have (on average 2.6526946107784433) internal successors, (443), 170 states have internal predecessors, (443), 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 16:54:21,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:21,516 INFO L93 Difference]: Finished difference Result 199 states and 485 transitions. [2025-04-13 16:54:21,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 16:54:21,518 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 16:54:21,518 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:21,528 INFO L225 Difference]: With dead ends: 199 [2025-04-13 16:54:21,528 INFO L226 Difference]: Without dead ends: 170 [2025-04-13 16:54:21,531 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 16:54:21,533 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:21,533 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:54:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-04-13 16:54:21,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-04-13 16:54:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 167 states have (on average 2.431137724550898) internal successors, (406), 169 states have internal predecessors, (406), 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 16:54:21,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 406 transitions. [2025-04-13 16:54:21,576 INFO L79 Accepts]: Start accepts. Automaton has 170 states and 406 transitions. Word has length 1 [2025-04-13 16:54:21,576 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:21,576 INFO L485 AbstractCegarLoop]: Abstraction has 170 states and 406 transitions. [2025-04-13 16:54:21,576 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 16:54:21,576 INFO L278 IsEmpty]: Start isEmpty. Operand 170 states and 406 transitions. [2025-04-13 16:54:21,577 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 16:54:21,577 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:21,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 16:54:21,577 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 16:54:21,577 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:54:21,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:21,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2146177363, now seen corresponding path program 1 times [2025-04-13 16:54:21,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:21,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865609312] [2025-04-13 16:54:21,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:21,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:21,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 16:54:21,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 16:54:21,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:21,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:22,861 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 16:54:22,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:22,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865609312] [2025-04-13 16:54:22,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865609312] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:54:22,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:54:22,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 16:54:22,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042815433] [2025-04-13 16:54:22,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:54:22,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 16:54:22,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:22,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 16:54:22,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 16:54:22,863 INFO L87 Difference]: Start difference. First operand 170 states and 406 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:22,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:22,987 INFO L93 Difference]: Finished difference Result 194 states and 464 transitions. [2025-04-13 16:54:22,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 16:54:22,988 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-13 16:54:22,988 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:22,989 INFO L225 Difference]: With dead ends: 194 [2025-04-13 16:54:22,989 INFO L226 Difference]: Without dead ends: 178 [2025-04-13 16:54:22,990 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 16:54:22,990 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:22,990 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:54:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-04-13 16:54:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-04-13 16:54:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 2.474285714285714) internal successors, (433), 177 states have internal predecessors, (433), 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 16:54:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 433 transitions. [2025-04-13 16:54:23,007 INFO L79 Accepts]: Start accepts. Automaton has 178 states and 433 transitions. Word has length 5 [2025-04-13 16:54:23,007 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:23,007 INFO L485 AbstractCegarLoop]: Abstraction has 178 states and 433 transitions. [2025-04-13 16:54:23,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:23,007 INFO L278 IsEmpty]: Start isEmpty. Operand 178 states and 433 transitions. [2025-04-13 16:54:23,008 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 16:54:23,008 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:23,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:23,008 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 16:54:23,008 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:54:23,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:23,008 INFO L85 PathProgramCache]: Analyzing trace with hash 872533171, now seen corresponding path program 1 times [2025-04-13 16:54:23,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:23,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534846120] [2025-04-13 16:54:23,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:23,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:23,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 16:54:23,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 16:54:23,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:23,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:23,205 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 16:54:23,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:23,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534846120] [2025-04-13 16:54:23,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534846120] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:54:23,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:54:23,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 16:54:23,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080667185] [2025-04-13 16:54:23,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:54:23,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 16:54:23,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:23,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 16:54:23,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 16:54:23,208 INFO L87 Difference]: Start difference. First operand 178 states and 433 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 16:54:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:23,358 INFO L93 Difference]: Finished difference Result 213 states and 511 transitions. [2025-04-13 16:54:23,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 16:54:23,359 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 16:54:23,359 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:23,360 INFO L225 Difference]: With dead ends: 213 [2025-04-13 16:54:23,360 INFO L226 Difference]: Without dead ends: 190 [2025-04-13 16:54:23,360 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 16:54:23,361 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:23,361 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:54:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-04-13 16:54:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-04-13 16:54:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 188 states have (on average 2.4202127659574466) internal successors, (455), 189 states have internal predecessors, (455), 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 16:54:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 455 transitions. [2025-04-13 16:54:23,374 INFO L79 Accepts]: Start accepts. Automaton has 190 states and 455 transitions. Word has length 7 [2025-04-13 16:54:23,374 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:23,374 INFO L485 AbstractCegarLoop]: Abstraction has 190 states and 455 transitions. [2025-04-13 16:54:23,374 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 16:54:23,374 INFO L278 IsEmpty]: Start isEmpty. Operand 190 states and 455 transitions. [2025-04-13 16:54:23,374 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 16:54:23,374 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:23,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:23,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 16:54:23,375 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:54:23,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:23,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2024581120, now seen corresponding path program 1 times [2025-04-13 16:54:23,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:23,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87968634] [2025-04-13 16:54:23,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:23,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:23,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 16:54:23,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 16:54:23,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:23,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:23,576 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 16:54:23,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:23,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87968634] [2025-04-13 16:54:23,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87968634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:54:23,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:54:23,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 16:54:23,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956916666] [2025-04-13 16:54:23,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:54:23,577 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 16:54:23,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:23,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 16:54:23,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 16:54:23,577 INFO L87 Difference]: Start difference. First operand 190 states and 455 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16:54:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:23,809 INFO L93 Difference]: Finished difference Result 269 states and 648 transitions. [2025-04-13 16:54:23,810 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 16:54:23,810 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-04-13 16:54:23,810 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:23,811 INFO L225 Difference]: With dead ends: 269 [2025-04-13 16:54:23,811 INFO L226 Difference]: Without dead ends: 160 [2025-04-13 16:54:23,811 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 16:54:23,812 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:23,812 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 16:54:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-04-13 16:54:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 148. [2025-04-13 16:54:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 144 states have (on average 2.2569444444444446) internal successors, (325), 147 states have internal predecessors, (325), 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 16:54:23,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 325 transitions. [2025-04-13 16:54:23,822 INFO L79 Accepts]: Start accepts. Automaton has 148 states and 325 transitions. Word has length 10 [2025-04-13 16:54:23,823 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:23,823 INFO L485 AbstractCegarLoop]: Abstraction has 148 states and 325 transitions. [2025-04-13 16:54:23,823 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16:54:23,823 INFO L278 IsEmpty]: Start isEmpty. Operand 148 states and 325 transitions. [2025-04-13 16:54:23,823 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 16:54:23,823 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:23,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:23,823 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 16:54:23,823 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:54:23,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:23,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1342244226, now seen corresponding path program 1 times [2025-04-13 16:54:23,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:23,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998734088] [2025-04-13 16:54:23,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:23,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:23,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 16:54:23,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 16:54:23,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:23,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:24,608 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 16:54:24,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:24,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998734088] [2025-04-13 16:54:24,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998734088] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:54:24,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:54:24,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 16:54:24,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208555672] [2025-04-13 16:54:24,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:54:24,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 16:54:24,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:24,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 16:54:24,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 16:54:24,610 INFO L87 Difference]: Start difference. First operand 148 states and 325 transitions. Second operand has 4 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 16:54:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:24,768 INFO L93 Difference]: Finished difference Result 148 states and 325 transitions. [2025-04-13 16:54:24,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 16:54:24,768 INFO L79 Accepts]: Start accepts. Automaton has has 4 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 16:54:24,768 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:24,769 INFO L225 Difference]: With dead ends: 148 [2025-04-13 16:54:24,769 INFO L226 Difference]: Without dead ends: 136 [2025-04-13 16:54:24,769 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 16:54:24,770 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:24,770 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 16:54:24,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-04-13 16:54:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2025-04-13 16:54:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 2.234375) internal successors, (286), 129 states have internal predecessors, (286), 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 16:54:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 286 transitions. [2025-04-13 16:54:24,778 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 286 transitions. Word has length 11 [2025-04-13 16:54:24,778 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:24,778 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 286 transitions. [2025-04-13 16:54:24,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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 16:54:24,779 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 286 transitions. [2025-04-13 16:54:24,780 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 16:54:24,780 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:24,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:24,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 16:54:24,780 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:54:24,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:24,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1181086340, now seen corresponding path program 1 times [2025-04-13 16:54:24,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:24,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566495010] [2025-04-13 16:54:24,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:24,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:24,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 16:54:24,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 16:54:24,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:24,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:26,927 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 16:54:26,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:26,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566495010] [2025-04-13 16:54:26,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566495010] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:54:26,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:54:26,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 16:54:26,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207459285] [2025-04-13 16:54:26,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:54:26,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 16:54:26,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:26,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 16:54:26,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:54:26,929 INFO L87 Difference]: Start difference. First operand 130 states and 286 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 16:54:27,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:27,350 INFO L93 Difference]: Finished difference Result 232 states and 509 transitions. [2025-04-13 16:54:27,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 16:54:27,350 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2025-04-13 16:54:27,351 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:27,351 INFO L225 Difference]: With dead ends: 232 [2025-04-13 16:54:27,352 INFO L226 Difference]: Without dead ends: 225 [2025-04-13 16:54:27,352 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-04-13 16:54:27,352 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:27,352 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 16:54:27,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-04-13 16:54:27,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 167. [2025-04-13 16:54:27,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 165 states have (on average 2.2303030303030305) internal successors, (368), 166 states have internal predecessors, (368), 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 16:54:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 368 transitions. [2025-04-13 16:54:27,361 INFO L79 Accepts]: Start accepts. Automaton has 167 states and 368 transitions. Word has length 15 [2025-04-13 16:54:27,361 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:27,361 INFO L485 AbstractCegarLoop]: Abstraction has 167 states and 368 transitions. [2025-04-13 16:54:27,361 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 16:54:27,361 INFO L278 IsEmpty]: Start isEmpty. Operand 167 states and 368 transitions. [2025-04-13 16:54:27,362 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 16:54:27,362 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:27,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:27,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 16:54:27,362 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:54:27,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash 689614286, now seen corresponding path program 2 times [2025-04-13 16:54:27,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:27,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996924529] [2025-04-13 16:54:27,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 16:54:27,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:27,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-04-13 16:54:27,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 16:54:27,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 16:54:27,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:28,857 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 16:54:28,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:28,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996924529] [2025-04-13 16:54:28,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996924529] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:54:28,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:54:28,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 16:54:28,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394750999] [2025-04-13 16:54:28,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:54:28,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 16:54:28,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:28,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 16:54:28,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:54:28,858 INFO L87 Difference]: Start difference. First operand 167 states and 368 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 16:54:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:29,246 INFO L93 Difference]: Finished difference Result 220 states and 477 transitions. [2025-04-13 16:54:29,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 16:54:29,246 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2025-04-13 16:54:29,247 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:29,247 INFO L225 Difference]: With dead ends: 220 [2025-04-13 16:54:29,248 INFO L226 Difference]: Without dead ends: 213 [2025-04-13 16:54:29,248 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:54:29,248 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:29,248 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 16:54:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-04-13 16:54:29,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 171. [2025-04-13 16:54:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 2.224852071005917) internal successors, (376), 170 states have internal predecessors, (376), 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 16:54:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 376 transitions. [2025-04-13 16:54:29,255 INFO L79 Accepts]: Start accepts. Automaton has 171 states and 376 transitions. Word has length 15 [2025-04-13 16:54:29,256 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:29,256 INFO L485 AbstractCegarLoop]: Abstraction has 171 states and 376 transitions. [2025-04-13 16:54:29,256 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 16:54:29,256 INFO L278 IsEmpty]: Start isEmpty. Operand 171 states and 376 transitions. [2025-04-13 16:54:29,258 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 16:54:29,258 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:29,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:29,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 16:54:29,258 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:54:29,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:29,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1076553646, now seen corresponding path program 3 times [2025-04-13 16:54:29,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:29,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393568508] [2025-04-13 16:54:29,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 16:54:29,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:29,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 1 equivalence classes. [2025-04-13 16:54:29,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 16:54:29,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 16:54:29,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:31,075 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 16:54:31,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:31,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393568508] [2025-04-13 16:54:31,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393568508] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:54:31,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:54:31,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 16:54:31,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213025810] [2025-04-13 16:54:31,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:54:31,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 16:54:31,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:31,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 16:54:31,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:54:31,076 INFO L87 Difference]: Start difference. First operand 171 states and 376 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 16:54:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:31,381 INFO L93 Difference]: Finished difference Result 232 states and 501 transitions. [2025-04-13 16:54:31,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 16:54:31,381 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2025-04-13 16:54:31,381 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:31,382 INFO L225 Difference]: With dead ends: 232 [2025-04-13 16:54:31,382 INFO L226 Difference]: Without dead ends: 225 [2025-04-13 16:54:31,383 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:54:31,383 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:31,383 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 16:54:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-04-13 16:54:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 175. [2025-04-13 16:54:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 2.2196531791907512) internal successors, (384), 174 states have internal predecessors, (384), 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 16:54:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 384 transitions. [2025-04-13 16:54:31,388 INFO L79 Accepts]: Start accepts. Automaton has 175 states and 384 transitions. Word has length 15 [2025-04-13 16:54:31,388 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:31,388 INFO L485 AbstractCegarLoop]: Abstraction has 175 states and 384 transitions. [2025-04-13 16:54:31,388 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 16:54:31,388 INFO L278 IsEmpty]: Start isEmpty. Operand 175 states and 384 transitions. [2025-04-13 16:54:31,388 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 16:54:31,388 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:31,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:31,389 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 16:54:31,389 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:54:31,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:31,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2083083528, now seen corresponding path program 4 times [2025-04-13 16:54:31,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:31,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876196589] [2025-04-13 16:54:31,389 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 16:54:31,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:31,414 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 16:54:31,537 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 16:54:31,537 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 16:54:31,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:33,044 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 16:54:33,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:33,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876196589] [2025-04-13 16:54:33,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876196589] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:54:33,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:54:33,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 16:54:33,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980276708] [2025-04-13 16:54:33,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:54:33,045 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 16:54:33,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:33,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 16:54:33,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:54:33,045 INFO L87 Difference]: Start difference. First operand 175 states and 384 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 16:54:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:33,354 INFO L93 Difference]: Finished difference Result 222 states and 482 transitions. [2025-04-13 16:54:33,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 16:54:33,355 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2025-04-13 16:54:33,355 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:33,356 INFO L225 Difference]: With dead ends: 222 [2025-04-13 16:54:33,356 INFO L226 Difference]: Without dead ends: 215 [2025-04-13 16:54:33,356 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:54:33,357 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:33,357 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 16:54:33,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-04-13 16:54:33,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 181. [2025-04-13 16:54:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 2.217877094972067) internal successors, (397), 180 states have internal predecessors, (397), 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 16:54:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 397 transitions. [2025-04-13 16:54:33,361 INFO L79 Accepts]: Start accepts. Automaton has 181 states and 397 transitions. Word has length 15 [2025-04-13 16:54:33,361 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:33,361 INFO L485 AbstractCegarLoop]: Abstraction has 181 states and 397 transitions. [2025-04-13 16:54:33,361 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 16:54:33,361 INFO L278 IsEmpty]: Start isEmpty. Operand 181 states and 397 transitions. [2025-04-13 16:54:33,361 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 16:54:33,361 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:33,361 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:33,361 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 16:54:33,361 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:54:33,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:33,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1935242118, now seen corresponding path program 1 times [2025-04-13 16:54:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:33,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878500384] [2025-04-13 16:54:33,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:33,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:33,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 16:54:33,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 16:54:33,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:33,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:54:34,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:34,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878500384] [2025-04-13 16:54:34,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878500384] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:54:34,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952354749] [2025-04-13 16:54:34,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:34,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:54:34,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:54:34,919 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 16:54:34,920 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 16:54:35,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 16:54:35,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 16:54:35,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:35,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:35,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 16:54:35,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:54:35,238 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-04-13 16:54:35,298 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-13 16:54:35,308 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:54:35,308 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2025-04-13 16:54:35,555 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 16:54:35,582 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:54:35,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 45 [2025-04-13 16:54:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:54:36,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:54:36,410 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 16:54:36,410 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-04-13 16:54:36,444 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:54:36,445 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-04-13 16:54:42,418 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:54:42,419 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-04-13 16:54:42,467 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 16:54:42,467 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-04-13 16:54:47,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2025-04-13 16:54:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:54:47,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952354749] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:54:47,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:54:47,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-04-13 16:54:47,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833389540] [2025-04-13 16:54:47,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:54:47,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 16:54:47,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:47,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 16:54:47,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=401, Unknown=2, NotChecked=0, Total=506 [2025-04-13 16:54:47,509 INFO L87 Difference]: Start difference. First operand 181 states and 397 transitions. Second operand has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:49,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:49,611 INFO L93 Difference]: Finished difference Result 226 states and 489 transitions. [2025-04-13 16:54:49,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 16:54:49,612 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 16:54:49,612 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:49,613 INFO L225 Difference]: With dead ends: 226 [2025-04-13 16:54:49,613 INFO L226 Difference]: Without dead ends: 196 [2025-04-13 16:54:49,614 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=229, Invalid=825, Unknown=2, NotChecked=0, Total=1056 [2025-04-13 16:54:49,614 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:49,614 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 16:54:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-04-13 16:54:49,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 180. [2025-04-13 16:54:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 178 states have (on average 2.207865168539326) internal successors, (393), 179 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 16:54:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 393 transitions. [2025-04-13 16:54:49,619 INFO L79 Accepts]: Start accepts. Automaton has 180 states and 393 transitions. Word has length 19 [2025-04-13 16:54:49,619 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:49,619 INFO L485 AbstractCegarLoop]: Abstraction has 180 states and 393 transitions. [2025-04-13 16:54:49,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:49,620 INFO L278 IsEmpty]: Start isEmpty. Operand 180 states and 393 transitions. [2025-04-13 16:54:49,620 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 16:54:49,620 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:49,620 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:49,630 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 16:54:49,820 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 16:54:49,821 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:54:49,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:49,821 INFO L85 PathProgramCache]: Analyzing trace with hash -712673777, now seen corresponding path program 1 times [2025-04-13 16:54:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:49,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446422002] [2025-04-13 16:54:49,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:49,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:49,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 16:54:49,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 16:54:49,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:49,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:54:50,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:50,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446422002] [2025-04-13 16:54:50,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446422002] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:54:50,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:54:50,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 16:54:50,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27716789] [2025-04-13 16:54:50,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:54:50,093 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 16:54:50,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:50,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 16:54:50,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 16:54:50,094 INFO L87 Difference]: Start difference. First operand 180 states and 393 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 16:54:50,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:50,280 INFO L93 Difference]: Finished difference Result 212 states and 465 transitions. [2025-04-13 16:54:50,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 16:54:50,280 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2025-04-13 16:54:50,280 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:50,281 INFO L225 Difference]: With dead ends: 212 [2025-04-13 16:54:50,281 INFO L226 Difference]: Without dead ends: 182 [2025-04-13 16:54:50,282 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 16:54:50,282 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:50,282 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 16:54:50,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-04-13 16:54:50,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 140. [2025-04-13 16:54:50,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 138 states have (on average 2.210144927536232) internal successors, (305), 139 states have internal predecessors, (305), 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 16:54:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 305 transitions. [2025-04-13 16:54:50,288 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 305 transitions. Word has length 19 [2025-04-13 16:54:50,288 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:50,288 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 305 transitions. [2025-04-13 16:54:50,288 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 16:54:50,288 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 305 transitions. [2025-04-13 16:54:50,289 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 16:54:50,289 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:50,289 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:50,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 16:54:50,289 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 16:54:50,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:50,289 INFO L85 PathProgramCache]: Analyzing trace with hash -797235975, now seen corresponding path program 2 times [2025-04-13 16:54:50,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:50,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434068893] [2025-04-13 16:54:50,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 16:54:50,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:50,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 16:54:50,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 16:54:50,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 16:54:50,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 16:54:50,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 16:54:50,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 16:54:50,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 16:54:50,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:50,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 16:54:50,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 16:54:50,695 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 16:54:50,696 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 16:54:50,697 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 16:54:50,697 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 16:54:50,698 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 16:54:50,698 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 16:54:50,698 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 16:54:50,698 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 16:54:50,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 16:54:50,700 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:50,773 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 16:54:50,773 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 16:54:50,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 04:54:50 BasicIcfg [2025-04-13 16:54:50,776 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 16:54:50,776 INFO L158 Benchmark]: Toolchain (without parser) took 42891.31ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 97.8MB in the beginning and 271.4MB in the end (delta: -173.6MB). Peak memory consumption was 791.0MB. Max. memory is 8.0GB. [2025-04-13 16:54:50,776 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 16:54:50,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.56ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 56.4MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-13 16:54:50,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.26ms. Allocated memory is still 142.6MB. Free memory was 56.4MB in the beginning and 46.9MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 16:54:50,777 INFO L158 Benchmark]: Boogie Preprocessor took 115.06ms. Allocated memory is still 142.6MB. Free memory was 46.9MB in the beginning and 38.8MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 16:54:50,777 INFO L158 Benchmark]: RCFGBuilder took 12440.71ms. Allocated memory was 142.6MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 38.8MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2025-04-13 16:54:50,777 INFO L158 Benchmark]: TraceAbstraction took 29684.70ms. Allocated memory was 4.1GB in the beginning and 1.1GB in the end (delta: -3.0GB). Free memory was 3.5GB in the beginning and 271.4MB in the end (delta: 3.2GB). Peak memory consumption was 217.3MB. Max. memory is 8.0GB. [2025-04-13 16:54:50,779 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.14ms. Allocated memory is still 159.4MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 558.56ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 56.4MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 87.26ms. Allocated memory is still 142.6MB. Free memory was 56.4MB in the beginning and 46.9MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 115.06ms. Allocated memory is still 142.6MB. Free memory was 46.9MB in the beginning and 38.8MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 12440.71ms. Allocated memory was 142.6MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 38.8MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * TraceAbstraction took 29684.70ms. Allocated memory was 4.1GB in the beginning and 1.1GB in the end (delta: -3.0GB). Free memory was 3.5GB in the beginning and 271.4MB in the end (delta: 3.2GB). Peak memory consumption was 217.3MB. 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 - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1062] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=6, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [\at(arg, Pre)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1009] 1 value = __VERIFIER_nondet_int() [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (400)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) [L1018] 1 i=0 [L1018] COND TRUE 1 i<((400)-1) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1063] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=6, id2=7, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; [L1037] 2 i=0 [L1037] COND TRUE 2 i<(400) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i++ [L1037] COND TRUE 2 i<(400) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (400)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value [L1026] 1 enqueue_flag=(0) [L1027] 1 dequeue_flag=(1) VAL [\at(arg, Pre)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=1] [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (400)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1002] 2 q->head++ [L1003] 2 return x; [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [\at(arg, Pre)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] - UnprovableResult [Line: 1059]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 48 locations, 57 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 29.5s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1607 IncrementalHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 0 mSDtfsCounter, 1607 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=3, InterpolantAutomatonStates: 61, 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, 11 MinimizatonAttempts, 260 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 22.6s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 157 ConstructedInterpolants, 14 QuantifiedInterpolants, 11209 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1844 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 2/8 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 proved your program to be incorrect! [2025-04-13 16:54:50,803 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 Received shutdown request...