/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_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 16:54:53,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 16:54:53,869 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:53,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 16:54:53,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 16:54:53,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 16:54:53,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 16:54:53,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 16:54:53,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 16:54:53,897 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 16:54:53,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 16:54:53,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 16:54:53,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 16:54:53,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 16:54:53,898 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 16:54:53,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 16:54:53,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 16:54:53,898 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 16:54:53,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 16:54:53,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 16:54:53,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 16:54:53,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 16:54:53,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 16:54:53,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 16:54:53,899 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 16:54:53,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 16:54:53,899 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 16:54:53,899 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 16:54:53,899 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 16:54:53,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 16:54:53,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 16:54:53,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 16:54:53,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:54:53,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 16:54:53,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 16:54:53,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 16:54:53,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 16:54:53,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:54:53,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 16:54:53,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 16:54:53,900 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 16:54:53,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 16:54:53,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 16:54:53,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 16:54:53,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 16:54:53,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 16:54:53,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 16:54:53,900 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:54,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 16:54:54,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 16:54:54,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 16:54:54,110 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 16:54:54,112 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 16:54:54,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2025-04-13 16:54:55,359 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1241aa0/05fa551fe3e04f2c868a0cf511854859/FLAG37684e2fa [2025-04-13 16:54:55,569 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 16:54:55,569 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2025-04-13 16:54:55,579 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1241aa0/05fa551fe3e04f2c868a0cf511854859/FLAG37684e2fa [2025-04-13 16:54:56,561 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1241aa0/05fa551fe3e04f2c868a0cf511854859 [2025-04-13 16:54:56,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 16:54:56,564 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 16:54:56,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 16:54:56,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 16:54:56,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 16:54:56,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:54:56" (1/1) ... [2025-04-13 16:54:56,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d902b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:56, skipping insertion in model container [2025-04-13 16:54:56,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:54:56" (1/1) ... [2025-04-13 16:54:56,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 16:54:56,962 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2025-04-13 16:54:56,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2025-04-13 16:54:56,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 16:54:56,990 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 16:54:57,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2025-04-13 16:54:57,060 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2025-04-13 16:54:57,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 16:54:57,110 INFO L204 MainTranslator]: Completed translation [2025-04-13 16:54:57,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:57 WrapperNode [2025-04-13 16:54:57,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 16:54:57,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 16:54:57,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 16:54:57,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 16:54:57,117 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:57" (1/1) ... [2025-04-13 16:54:57,138 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:57" (1/1) ... [2025-04-13 16:54:57,169 INFO L138 Inliner]: procedures = 274, calls = 92, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 231 [2025-04-13 16:54:57,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 16:54:57,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 16:54:57,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 16:54:57,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 16:54:57,180 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:57" (1/1) ... [2025-04-13 16:54:57,181 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:57" (1/1) ... [2025-04-13 16:54:57,184 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:57" (1/1) ... [2025-04-13 16:54:57,205 INFO L175 MemorySlicer]: Split 75 memory accesses to 4 slices as follows [2, 5, 22, 46]. 61 percent of accesses are in the largest equivalence class. The 50 initializations are split as follows [2, 5, 20, 23]. The 11 writes are split as follows [0, 0, 1, 10]. [2025-04-13 16:54:57,205 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:57" (1/1) ... [2025-04-13 16:54:57,205 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:57" (1/1) ... [2025-04-13 16:54:57,215 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:57" (1/1) ... [2025-04-13 16:54:57,216 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:57" (1/1) ... [2025-04-13 16:54:57,219 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:57" (1/1) ... [2025-04-13 16:54:57,220 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:57" (1/1) ... [2025-04-13 16:54:57,221 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:57" (1/1) ... [2025-04-13 16:54:57,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 16:54:57,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 16:54:57,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 16:54:57,225 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 16:54:57,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:57" (1/1) ... [2025-04-13 16:54:57,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:54:57,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:54:57,250 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:57,252 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:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 16:54:57,269 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 16:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 16:54:57,269 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 16:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 16:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 16:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 16:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 16:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 16:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 16:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 16:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 16:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 16:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 16:54:57,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 16:54:57,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 16:54:57,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 16:54:57,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 16:54:57,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 16:54:57,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 16:54:57,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 16:54:57,272 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:57,412 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 16:54:57,413 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 16:54:57,707 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 16:54:57,708 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 16:54:57,708 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 16:54:58,140 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 16:54:58,171 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 16:54:58,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:54:58 BoogieIcfgContainer [2025-04-13 16:54:58,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 16:54:58,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 16:54:58,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 16:54:58,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 16:54:58,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 04:54:56" (1/3) ... [2025-04-13 16:54:58,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a55de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:54:58, skipping insertion in model container [2025-04-13 16:54:58,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:57" (2/3) ... [2025-04-13 16:54:58,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a55de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:54:58, skipping insertion in model container [2025-04-13 16:54:58,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:54:58" (3/3) ... [2025-04-13 16:54:58,179 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2025-04-13 16:54:58,189 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 16:54:58,190 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok.i that has 3 procedures, 24 locations, 24 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 16:54:58,190 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 16:54:58,278 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 16:54:58,300 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 29 transitions, 72 flow [2025-04-13 16:54:58,319 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 92 states, 90 states have (on average 2.7) internal successors, (243), 91 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:58,339 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 16:54:58,348 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;@11dfa000, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 16:54:58,348 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 16:54:58,351 INFO L278 IsEmpty]: Start isEmpty. Operand has 92 states, 90 states have (on average 2.7) internal successors, (243), 91 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:58,353 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2025-04-13 16:54:58,353 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:58,354 INFO L218 NwaCegarLoop]: trace histogram [1] [2025-04-13 16:54:58,354 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 16:54:58,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:58,357 INFO L85 PathProgramCache]: Analyzing trace with hash 614, now seen corresponding path program 1 times [2025-04-13 16:54:58,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:58,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916511159] [2025-04-13 16:54:58,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:58,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:58,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-13 16:54:58,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-13 16:54:58,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:58,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:58,461 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:58,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:58,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916511159] [2025-04-13 16:54:58,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916511159] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:54:58,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:54:58,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-13 16:54:58,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541183019] [2025-04-13 16:54:58,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:54:58,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 16:54:58,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:58,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 16:54:58,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 16:54:58,484 INFO L87 Difference]: Start difference. First operand has 92 states, 90 states have (on average 2.7) internal successors, (243), 91 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:58,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:58,543 INFO L93 Difference]: Finished difference Result 92 states and 243 transitions. [2025-04-13 16:54:58,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 16:54:58,546 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:58,546 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:58,553 INFO L225 Difference]: With dead ends: 92 [2025-04-13 16:54:58,553 INFO L226 Difference]: Without dead ends: 91 [2025-04-13 16:54:58,556 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:58,557 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:58,558 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 16:54:58,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-13 16:54:58,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-04-13 16:54:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 2.688888888888889) internal successors, (242), 90 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:58,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 242 transitions. [2025-04-13 16:54:58,593 INFO L79 Accepts]: Start accepts. Automaton has 91 states and 242 transitions. Word has length 1 [2025-04-13 16:54:58,593 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:58,593 INFO L485 AbstractCegarLoop]: Abstraction has 91 states and 242 transitions. [2025-04-13 16:54:58,593 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:58,594 INFO L278 IsEmpty]: Start isEmpty. Operand 91 states and 242 transitions. [2025-04-13 16:54:58,594 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 16:54:58,594 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:58,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:58,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 16:54:58,595 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 16:54:58,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:58,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1334675415, now seen corresponding path program 1 times [2025-04-13 16:54:58,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:58,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095399635] [2025-04-13 16:54:58,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:58,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:58,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 16:54:58,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 16:54:58,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:58,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:58,989 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:58,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:58,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095399635] [2025-04-13 16:54:58,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095399635] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:54:58,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:54:58,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 16:54:58,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484922834] [2025-04-13 16:54:58,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:54:58,992 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 16:54:58,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:58,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 16:54:58,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 16:54:58,992 INFO L87 Difference]: Start difference. First operand 91 states and 242 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:59,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:59,089 INFO L93 Difference]: Finished difference Result 144 states and 377 transitions. [2025-04-13 16:54:59,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 16:54:59,090 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:59,090 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:59,091 INFO L225 Difference]: With dead ends: 144 [2025-04-13 16:54:59,091 INFO L226 Difference]: Without dead ends: 95 [2025-04-13 16:54:59,092 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:59,092 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:59,092 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:54:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-13 16:54:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-04-13 16:54:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 2.478723404255319) internal successors, (233), 94 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:59,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 233 transitions. [2025-04-13 16:54:59,105 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 233 transitions. Word has length 7 [2025-04-13 16:54:59,105 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:59,105 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 233 transitions. [2025-04-13 16:54:59,105 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:59,105 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 233 transitions. [2025-04-13 16:54:59,106 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 16:54:59,106 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:59,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:59,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 16:54:59,106 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 16:54:59,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:59,107 INFO L85 PathProgramCache]: Analyzing trace with hash 989607033, now seen corresponding path program 1 times [2025-04-13 16:54:59,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:59,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031590377] [2025-04-13 16:54:59,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:59,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:59,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 16:54:59,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 16:54:59,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:59,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 16:54:59,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:59,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031590377] [2025-04-13 16:54:59,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031590377] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:54:59,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:54:59,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 16:54:59,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920573550] [2025-04-13 16:54:59,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:54:59,265 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 16:54:59,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:59,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 16:54:59,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 16:54:59,266 INFO L87 Difference]: Start difference. First operand 95 states and 233 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:59,331 INFO L93 Difference]: Finished difference Result 110 states and 268 transitions. [2025-04-13 16:54:59,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 16:54:59,333 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-13 16:54:59,333 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:59,333 INFO L225 Difference]: With dead ends: 110 [2025-04-13 16:54:59,333 INFO L226 Difference]: Without dead ends: 67 [2025-04-13 16:54:59,334 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:59,334 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:59,334 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:54:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-13 16:54:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-04-13 16:54:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 2.1363636363636362) internal successors, (141), 66 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 141 transitions. [2025-04-13 16:54:59,341 INFO L79 Accepts]: Start accepts. Automaton has 67 states and 141 transitions. Word has length 11 [2025-04-13 16:54:59,341 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:59,341 INFO L485 AbstractCegarLoop]: Abstraction has 67 states and 141 transitions. [2025-04-13 16:54:59,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:59,343 INFO L278 IsEmpty]: Start isEmpty. Operand 67 states and 141 transitions. [2025-04-13 16:54:59,344 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 16:54:59,344 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:59,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:59,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 16:54:59,345 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 16:54:59,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1821684218, now seen corresponding path program 1 times [2025-04-13 16:54:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:59,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636164414] [2025-04-13 16:54:59,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:59,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:59,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 16:54:59,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 16:54:59,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:59,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:54:59,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:59,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636164414] [2025-04-13 16:54:59,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636164414] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:54:59,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851453151] [2025-04-13 16:54:59,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:59,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:54:59,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:54:59,443 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:59,444 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:59,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 16:54:59,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 16:54:59,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:59,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:59,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 16:54:59,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:54:59,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:54:59,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:54:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:54:59,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851453151] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:54:59,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:54:59,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 16:54:59,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539185075] [2025-04-13 16:54:59,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:54:59,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 16:54:59,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:59,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 16:54:59,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:54:59,621 INFO L87 Difference]: Start difference. First operand 67 states and 141 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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:59,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:59,762 INFO L93 Difference]: Finished difference Result 120 states and 268 transitions. [2025-04-13 16:54:59,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 16:54:59,762 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-13 16:54:59,763 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:59,764 INFO L225 Difference]: With dead ends: 120 [2025-04-13 16:54:59,764 INFO L226 Difference]: Without dead ends: 85 [2025-04-13 16:54:59,764 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:54:59,764 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:59,765 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:54:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-13 16:54:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-04-13 16:54:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 2.107142857142857) internal successors, (177), 84 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 177 transitions. [2025-04-13 16:54:59,774 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 177 transitions. Word has length 13 [2025-04-13 16:54:59,774 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:59,774 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 177 transitions. [2025-04-13 16:54:59,774 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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:59,774 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 177 transitions. [2025-04-13 16:54:59,774 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 16:54:59,774 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:59,774 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:59,781 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:59,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:54:59,979 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 16:54:59,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:59,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2045072552, now seen corresponding path program 2 times [2025-04-13 16:54:59,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:59,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742032005] [2025-04-13 16:54:59,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 16:54:59,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:59,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 16:55:00,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 16:55:00,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 16:55:00,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:55:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:55:00,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:55:00,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742032005] [2025-04-13 16:55:00,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742032005] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:55:00,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945840554] [2025-04-13 16:55:00,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 16:55:00,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:55:00,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:55:00,136 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 16:55:00,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 16:55:00,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 16:55:00,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 16:55:00,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 16:55:00,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:55:00,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 16:55:00,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:55:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:55:00,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:55:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:55:00,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945840554] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:55:00,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:55:00,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 16:55:00,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808829857] [2025-04-13 16:55:00,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:55:00,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 16:55:00,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:55:00,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 16:55:00,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 16:55:00,377 INFO L87 Difference]: Start difference. First operand 85 states and 177 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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:55:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:55:00,560 INFO L93 Difference]: Finished difference Result 156 states and 358 transitions. [2025-04-13 16:55:00,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 16:55:00,562 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 16:55:00,562 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:55:00,562 INFO L225 Difference]: With dead ends: 156 [2025-04-13 16:55:00,562 INFO L226 Difference]: Without dead ends: 121 [2025-04-13 16:55:00,563 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 16:55:00,563 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 16:55:00,563 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 16:55:00,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-04-13 16:55:00,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-04-13 16:55:00,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.075) internal successors, (249), 120 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:55:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 249 transitions. [2025-04-13 16:55:00,579 INFO L79 Accepts]: Start accepts. Automaton has 121 states and 249 transitions. Word has length 16 [2025-04-13 16:55:00,579 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:55:00,579 INFO L485 AbstractCegarLoop]: Abstraction has 121 states and 249 transitions. [2025-04-13 16:55:00,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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:55:00,579 INFO L278 IsEmpty]: Start isEmpty. Operand 121 states and 249 transitions. [2025-04-13 16:55:00,580 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 16:55:00,580 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:55:00,580 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:55:00,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 16:55:00,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:55:00,781 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 16:55:00,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:55:00,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1809052520, now seen corresponding path program 3 times [2025-04-13 16:55:00,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:55:00,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956025873] [2025-04-13 16:55:00,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 16:55:00,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:55:00,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-04-13 16:55:01,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 16:55:01,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 16:55:01,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:55:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:55:01,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:55:01,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956025873] [2025-04-13 16:55:01,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956025873] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:55:01,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952938361] [2025-04-13 16:55:01,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 16:55:01,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:55:01,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:55:01,278 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 16:55:01,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 16:55:01,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-04-13 16:55:05,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 16:55:05,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 16:55:05,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:55:05,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 16:55:05,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:55:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:55:05,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:55:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:55:05,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952938361] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:55:05,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:55:05,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-04-13 16:55:05,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451421080] [2025-04-13 16:55:05,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:55:05,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 16:55:05,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:55:05,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 16:55:05,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-04-13 16:55:05,932 INFO L87 Difference]: Start difference. First operand 121 states and 249 transitions. Second operand has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 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:55:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:55:06,153 INFO L93 Difference]: Finished difference Result 216 states and 502 transitions. [2025-04-13 16:55:06,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 16:55:06,154 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 16:55:06,154 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:55:06,155 INFO L225 Difference]: With dead ends: 216 [2025-04-13 16:55:06,155 INFO L226 Difference]: Without dead ends: 181 [2025-04-13 16:55:06,155 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-04-13 16:55:06,156 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 16:55:06,156 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 16:55:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-04-13 16:55:06,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-04-13 16:55:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 2.05) internal successors, (369), 180 states have internal predecessors, (369), 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:55:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 369 transitions. [2025-04-13 16:55:06,174 INFO L79 Accepts]: Start accepts. Automaton has 181 states and 369 transitions. Word has length 22 [2025-04-13 16:55:06,174 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:55:06,174 INFO L485 AbstractCegarLoop]: Abstraction has 181 states and 369 transitions. [2025-04-13 16:55:06,174 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 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:55:06,174 INFO L278 IsEmpty]: Start isEmpty. Operand 181 states and 369 transitions. [2025-04-13 16:55:06,175 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 16:55:06,175 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:55:06,175 INFO L218 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:55:06,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 16:55:06,376 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:55:06,376 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 16:55:06,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:55:06,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1485989544, now seen corresponding path program 4 times [2025-04-13 16:55:06,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:55:06,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152966361] [2025-04-13 16:55:06,377 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 16:55:06,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:55:06,414 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 16:55:06,918 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 16:55:06,918 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 16:55:06,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:55:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:55:15,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:55:15,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152966361] [2025-04-13 16:55:15,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152966361] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:55:15,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999521957] [2025-04-13 16:55:15,372 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 16:55:15,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:55:15,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:55:15,375 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 16:55:15,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 16:55:15,512 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 16:55:15,615 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 16:55:15,615 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 16:55:15,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:55:15,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 145 conjuncts are in the unsatisfiable core [2025-04-13 16:55:15,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:55:15,658 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 21 treesize of output 15 [2025-04-13 16:55:15,717 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:15,718 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 21 [2025-04-13 16:55:15,723 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 15 treesize of output 11 [2025-04-13 16:55:15,772 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:55:15,779 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:15,779 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:15,838 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:55:15,845 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:15,845 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:15,902 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:15,902 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:15,906 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:55:15,960 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:15,961 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:15,966 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:55:16,020 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:55:16,026 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:16,026 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:16,081 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:55:16,086 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:16,087 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:16,137 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:55:16,141 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:16,141 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:16,196 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:16,196 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:16,201 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:55:16,256 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:16,257 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:16,260 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:55:16,308 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:55:16,312 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:16,313 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:16,363 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:55:16,366 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:16,367 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:16,435 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:16,435 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:16,438 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:55:16,493 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:55:16,497 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:16,497 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:16,552 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:16,553 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:16,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:55:16,619 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:55:16,623 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:16,624 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:16,680 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:55:16,684 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:16,684 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:16,731 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:55:16,738 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:16,738 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:16,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 16:55:16,793 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 31 treesize of output 15 [2025-04-13 16:55:16,804 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:16,804 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:16,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 16:55:16,860 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 31 treesize of output 15 [2025-04-13 16:55:16,864 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:16,865 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 16:55:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:55:16,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:55:17,106 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 16:55:17,107 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:55:17,130 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:17,130 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:55:18,886 INFO L325 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2025-04-13 16:55:18,886 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 637 treesize of output 382 [2025-04-13 16:55:18,908 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:18,909 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 458 treesize of output 274 [2025-04-13 16:55:27,610 INFO L325 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2025-04-13 16:55:27,611 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1659 treesize of output 972 [2025-04-13 16:55:27,676 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:27,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1926 treesize of output 1110 [2025-04-13 16:55:27,694 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:55:27,804 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:27,806 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2740197 treesize of output 2715641 [2025-04-13 16:55:30,052 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:30,053 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 3516708 treesize of output 1972312 [2025-04-13 16:55:31,529 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 8 treesize of output 4 [2025-04-13 16:55:31,688 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:55:31,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 26206179 treesize of output 14524999 [2025-04-13 16:56:22,690 WARN L286 SmtUtils]: Spent 51.00s on a formula simplification. DAG size of input: 1389 DAG size of output: 793 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 16:56:24,958 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 8 treesize of output 4 [2025-04-13 16:56:24,979 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 16:56:24,985 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:56:24,985 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 906 treesize of output 898 [2025-04-13 16:56:25,038 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 8 treesize of output 4 [2025-04-13 16:56:36,523 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 8 treesize of output 4 [2025-04-13 16:56:36,540 INFO L325 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2025-04-13 16:56:36,540 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 5271 treesize of output 3080 [2025-04-13 16:56:36,555 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 8 treesize of output 4 [2025-04-13 16:56:36,566 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 8 treesize of output 4 [2025-04-13 16:56:36,585 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 16:56:36,599 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:56:36,600 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 123647 treesize of output 122883 [2025-04-13 16:56:36,817 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:56:36,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 49608429 treesize of output 29496409 [2025-04-13 16:57:39,069 WARN L286 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 1401 DAG size of output: 816 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 16:57:39,877 INFO L325 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2025-04-13 16:57:39,877 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 659 treesize of output 400 [2025-04-13 16:57:39,896 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:57:39,926 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 38 treesize of output 22 [2025-04-13 16:57:39,956 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:57:39,965 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 27 treesize of output 23 [2025-04-13 16:57:39,990 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 8 treesize of output 4 [2025-04-13 16:57:40,013 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 8 treesize of output 4 [2025-04-13 16:57:40,234 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 16:57:40,237 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 222170348 treesize of output 125943384 Received shutdown request... [2025-04-13 17:09:22,439 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 17:09:22,439 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 17:09:22,451 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 17:09:22,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 17:09:22,652 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:09:22,653 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 33 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-26-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-3-4-3-4-3-4-3-6-3-7-3-7-3-7-3-6-3-4-3-3-3-3-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-1 context. [2025-04-13 17:09:22,655 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 17:09:22,655 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 17:09:22,655 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 17:09:22,655 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 17:09:22,658 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2025-04-13 17:09:22,661 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:09:22,661 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:09:22,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:09:22 BasicIcfg [2025-04-13 17:09:22,663 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:09:22,663 INFO L158 Benchmark]: Toolchain (without parser) took 866099.47ms. Allocated memory was 155.2MB in the beginning and 872.4MB in the end (delta: 717.2MB). Free memory was 105.0MB in the beginning and 714.5MB in the end (delta: -609.5MB). Peak memory consumption was 530.2MB. Max. memory is 8.0GB. [2025-04-13 17:09:22,663 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:09:22,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.53ms. Allocated memory is still 155.2MB. Free memory was 105.0MB in the beginning and 71.6MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-13 17:09:22,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.50ms. Allocated memory is still 155.2MB. Free memory was 71.6MB in the beginning and 68.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:09:22,664 INFO L158 Benchmark]: Boogie Preprocessor took 54.25ms. Allocated memory is still 155.2MB. Free memory was 68.4MB in the beginning and 65.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:09:22,664 INFO L158 Benchmark]: RCFGBuilder took 947.25ms. Allocated memory is still 155.2MB. Free memory was 65.9MB in the beginning and 59.0MB in the end (delta: 6.8MB). Peak memory consumption was 49.7MB. Max. memory is 8.0GB. [2025-04-13 17:09:22,664 INFO L158 Benchmark]: TraceAbstraction took 864489.03ms. Allocated memory was 155.2MB in the beginning and 872.4MB in the end (delta: 717.2MB). Free memory was 59.0MB in the beginning and 714.5MB in the end (delta: -655.5MB). Peak memory consumption was 482.7MB. Max. memory is 8.0GB. [2025-04-13 17:09:22,664 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.18ms. Allocated memory is still 155.2MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 546.53ms. Allocated memory is still 155.2MB. Free memory was 105.0MB in the beginning and 71.6MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.50ms. Allocated memory is still 155.2MB. Free memory was 71.6MB in the beginning and 68.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.25ms. Allocated memory is still 155.2MB. Free memory was 68.4MB in the beginning and 65.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 947.25ms. Allocated memory is still 155.2MB. Free memory was 65.9MB in the beginning and 59.0MB in the end (delta: 6.8MB). Peak memory consumption was 49.7MB. Max. memory is 8.0GB. * TraceAbstraction took 864489.03ms. Allocated memory was 155.2MB in the beginning and 872.4MB in the end (delta: 717.2MB). Free memory was 59.0MB in the beginning and 714.5MB in the end (delta: -655.5MB). Peak memory consumption was 482.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 33 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-26-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-3-4-3-4-3-4-3-6-3-7-3-7-3-7-3-6-3-4-3-3-3-3-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 33 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-26-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-3-4-3-4-3-4-3-6-3-7-3-7-3-7-3-6-3-4-3-3-3-3-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 33 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-26-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-3-4-3-4-3-4-3-6-3-7-3-7-3-7-3-6-3-4-3-3-3-3-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 33 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-26-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-63-3-4-3-4-3-4-3-6-3-7-3-7-3-7-3-6-3-4-3-3-3-3-3-2-3-2-3-2-3-2-3-2-3-2-2-2-2-2-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 42 locations, 51 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 864.4s, OverallIterations: 7, TraceHistogramMax: 20, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 565 IncrementalHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 0 mSDtfsCounter, 565 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=6, InterpolantAutomatonStates: 48, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 400 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1104 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 1/199 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown