/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:50:50,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:50:50,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:50:50,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:50:50,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:50:50,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:50:50,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:50:50,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:50:50,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:50:50,942 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:50:50,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:50:50,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:50:50,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:50:50,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:50:50,943 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:50:50,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:50:50,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:50:50,944 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:50:50,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:50:50,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:50:50,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:50:50,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:50:50,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:50:50,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:50:50,944 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:50:50,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:50:50,944 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:50:50,944 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:50:50,944 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:50:50,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:50:50,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:50:50,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:50:50,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:50,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:50:50,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:50:50,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:50:50,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:50:50,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:50,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:50:50,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:50:50,945 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:50:50,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:50:50,945 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:50:50,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:50:50,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:50:50,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:50:50,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:50:50,946 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:50:51,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:50:51,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:50:51,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:50:51,168 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:50:51,168 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:50:51,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2025-04-13 21:50:52,472 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d25340b8/6cfe5d224c0149ecbbe65af83836548a/FLAG3e37db25f [2025-04-13 21:50:52,736 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:50:52,739 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2025-04-13 21:50:52,762 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d25340b8/6cfe5d224c0149ecbbe65af83836548a/FLAG3e37db25f [2025-04-13 21:50:53,523 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d25340b8/6cfe5d224c0149ecbbe65af83836548a [2025-04-13 21:50:53,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:50:53,526 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:50:53,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:50:53,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:50:53,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:50:53,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:50:53" (1/1) ... [2025-04-13 21:50:53,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b839e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:53, skipping insertion in model container [2025-04-13 21:50:53,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:50:53" (1/1) ... [2025-04-13 21:50:53,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:50:53,896 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[186203,186216] [2025-04-13 21:50:53,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:50:53,939 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:50:53,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[186203,186216] [2025-04-13 21:50:53,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:50:54,039 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:50:54,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:54 WrapperNode [2025-04-13 21:50:54,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:50:54,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:50:54,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:50:54,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:50:54,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:54" (1/1) ... [2025-04-13 21:50:54,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:54" (1/1) ... [2025-04-13 21:50:54,082 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 126 [2025-04-13 21:50:54,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:50:54,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:50:54,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:50:54,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:50:54,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:54" (1/1) ... [2025-04-13 21:50:54,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:54" (1/1) ... [2025-04-13 21:50:54,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:54" (1/1) ... [2025-04-13 21:50:54,106 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 2, 13]. 76 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 2, 6]. [2025-04-13 21:50:54,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:54" (1/1) ... [2025-04-13 21:50:54,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:54" (1/1) ... [2025-04-13 21:50:54,121 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:54" (1/1) ... [2025-04-13 21:50:54,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:54" (1/1) ... [2025-04-13 21:50:54,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:54" (1/1) ... [2025-04-13 21:50:54,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:54" (1/1) ... [2025-04-13 21:50:54,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:50:54,135 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:50:54,135 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:50:54,135 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:50:54,139 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:54" (1/1) ... [2025-04-13 21:50:54,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:54,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:50:54,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:50:54,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:50:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-04-13 21:50:54,190 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-04-13 21:50:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 21:50:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 21:50:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 21:50:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:50:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:50:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 21:50:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:50:54,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:50:54,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 21:50:54,191 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 21:50:54,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:50:54,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-13 21:50:54,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-13 21:50:54,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-13 21:50:54,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:50:54,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:50:54,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 21:50:54,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:50:54,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:50:54,192 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:50:54,382 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:50:54,384 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:50:54,575 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:50:54,575 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:50:54,575 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:50:54,788 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:50:54,808 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:50:54,834 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:50:54,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:50:54 BoogieIcfgContainer [2025-04-13 21:50:54,835 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:50:54,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:50:54,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:50:54,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:50:54,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:50:53" (1/3) ... [2025-04-13 21:50:54,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6abf1552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:50:54, skipping insertion in model container [2025-04-13 21:50:54,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:54" (2/3) ... [2025-04-13 21:50:54,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6abf1552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:50:54, skipping insertion in model container [2025-04-13 21:50:54,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:50:54" (3/3) ... [2025-04-13 21:50:54,842 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2025-04-13 21:50:54,855 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:50:54,856 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_1-container_of.i that has 2 procedures, 22 locations, 27 edges, 1 initial locations, 0 loop locations, and 6 error locations. [2025-04-13 21:50:54,856 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:50:54,905 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:50:54,926 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 34 transitions, 82 flow [2025-04-13 21:50:54,954 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 214 states, 204 states have (on average 2.450980392156863) internal successors, (500), 213 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:54,977 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:50:54,985 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;@3f80d170, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:50:54,985 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 21:50:54,989 INFO L278 IsEmpty]: Start isEmpty. Operand has 214 states, 204 states have (on average 2.450980392156863) internal successors, (500), 213 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:54,992 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2025-04-13 21:50:54,992 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:54,993 INFO L218 NwaCegarLoop]: trace histogram [1] [2025-04-13 21:50:54,993 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:50:54,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:54,997 INFO L85 PathProgramCache]: Analyzing trace with hash 390, now seen corresponding path program 1 times [2025-04-13 21:50:55,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:55,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725810196] [2025-04-13 21:50:55,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:55,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:55,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-13 21:50:55,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-13 21:50:55,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:55,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:50:55,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:55,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725810196] [2025-04-13 21:50:55,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725810196] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:55,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:55,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-13 21:50:55,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966479360] [2025-04-13 21:50:55,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:55,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:50:55,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:55,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:50:55,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:50:55,483 INFO L87 Difference]: Start difference. First operand has 214 states, 204 states have (on average 2.450980392156863) internal successors, (500), 213 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:55,564 INFO L93 Difference]: Finished difference Result 214 states and 500 transitions. [2025-04-13 21:50:55,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:50:55,566 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2025-04-13 21:50:55,566 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:55,573 INFO L225 Difference]: With dead ends: 214 [2025-04-13 21:50:55,573 INFO L226 Difference]: Without dead ends: 101 [2025-04-13 21:50:55,576 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:50:55,580 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:55,580 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:50:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-13 21:50:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-04-13 21:50:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 99 states have (on average 2.0707070707070705) internal successors, (205), 100 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 205 transitions. [2025-04-13 21:50:55,607 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 205 transitions. Word has length 1 [2025-04-13 21:50:55,607 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:55,607 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 205 transitions. [2025-04-13 21:50:55,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:55,607 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 205 transitions. [2025-04-13 21:50:55,608 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:50:55,608 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:55,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:50:55,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:50:55,608 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:50:55,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:55,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1461038525, now seen corresponding path program 1 times [2025-04-13 21:50:55,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:55,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65550569] [2025-04-13 21:50:55,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:55,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:55,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:50:55,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:50:55,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:55,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:50:56,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:56,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65550569] [2025-04-13 21:50:56,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65550569] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:56,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:56,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 21:50:56,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54824793] [2025-04-13 21:50:56,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:56,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:50:56,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:56,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:50:56,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:50:56,702 INFO L87 Difference]: Start difference. First operand 101 states and 205 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:57,109 INFO L93 Difference]: Finished difference Result 192 states and 375 transitions. [2025-04-13 21:50:57,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:50:57,110 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:50:57,110 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:57,114 INFO L225 Difference]: With dead ends: 192 [2025-04-13 21:50:57,114 INFO L226 Difference]: Without dead ends: 191 [2025-04-13 21:50:57,114 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:50:57,115 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:57,115 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:50:57,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-04-13 21:50:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 150. [2025-04-13 21:50:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 148 states have (on average 2.0337837837837838) internal successors, (301), 149 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 301 transitions. [2025-04-13 21:50:57,124 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 301 transitions. Word has length 19 [2025-04-13 21:50:57,124 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:57,124 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 301 transitions. [2025-04-13 21:50:57,124 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:57,124 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 301 transitions. [2025-04-13 21:50:57,125 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:50:57,125 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:57,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:50:57,125 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:50:57,125 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:50:57,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash -560561116, now seen corresponding path program 1 times [2025-04-13 21:50:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:57,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667802632] [2025-04-13 21:50:57,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:50:57,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:57,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:50:57,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:50:57,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:50:57,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:50:58,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:58,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667802632] [2025-04-13 21:50:58,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667802632] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:58,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:58,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 21:50:58,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809896864] [2025-04-13 21:50:58,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:58,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:50:58,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:58,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:50:58,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:50:58,019 INFO L87 Difference]: Start difference. First operand 150 states and 301 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:58,337 INFO L93 Difference]: Finished difference Result 176 states and 346 transitions. [2025-04-13 21:50:58,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:50:58,337 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:50:58,338 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:58,338 INFO L225 Difference]: With dead ends: 176 [2025-04-13 21:50:58,338 INFO L226 Difference]: Without dead ends: 120 [2025-04-13 21:50:58,339 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:50:58,339 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:58,339 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:50:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-13 21:50:58,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-04-13 21:50:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 118 states have (on average 2.016949152542373) internal successors, (238), 119 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 238 transitions. [2025-04-13 21:50:58,345 INFO L79 Accepts]: Start accepts. Automaton has 120 states and 238 transitions. Word has length 19 [2025-04-13 21:50:58,345 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:58,345 INFO L485 AbstractCegarLoop]: Abstraction has 120 states and 238 transitions. [2025-04-13 21:50:58,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:58,346 INFO L278 IsEmpty]: Start isEmpty. Operand 120 states and 238 transitions. [2025-04-13 21:50:58,346 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:50:58,346 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:58,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:50:58,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:50:58,346 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:50:58,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:58,347 INFO L85 PathProgramCache]: Analyzing trace with hash -489456537, now seen corresponding path program 2 times [2025-04-13 21:50:58,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:58,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319823326] [2025-04-13 21:50:58,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:50:58,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:58,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:50:58,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:50:58,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:50:58,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:50:58,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:58,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319823326] [2025-04-13 21:50:58,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319823326] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:58,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:58,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 21:50:58,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672079729] [2025-04-13 21:50:58,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:58,880 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:50:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:58,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:50:58,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:50:58,881 INFO L87 Difference]: Start difference. First operand 120 states and 238 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:59,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:50:59,343 INFO L93 Difference]: Finished difference Result 235 states and 463 transitions. [2025-04-13 21:50:59,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:50:59,344 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:50:59,344 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:50:59,345 INFO L225 Difference]: With dead ends: 235 [2025-04-13 21:50:59,345 INFO L226 Difference]: Without dead ends: 234 [2025-04-13 21:50:59,345 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:50:59,346 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:50:59,346 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:50:59,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-04-13 21:50:59,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 168. [2025-04-13 21:50:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 166 states have (on average 2.0783132530120483) internal successors, (345), 167 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 345 transitions. [2025-04-13 21:50:59,359 INFO L79 Accepts]: Start accepts. Automaton has 168 states and 345 transitions. Word has length 19 [2025-04-13 21:50:59,360 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:50:59,360 INFO L485 AbstractCegarLoop]: Abstraction has 168 states and 345 transitions. [2025-04-13 21:50:59,360 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:50:59,360 INFO L278 IsEmpty]: Start isEmpty. Operand 168 states and 345 transitions. [2025-04-13 21:50:59,361 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:50:59,361 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:50:59,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:50:59,361 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:50:59,361 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:50:59,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:50:59,364 INFO L85 PathProgramCache]: Analyzing trace with hash -489456536, now seen corresponding path program 2 times [2025-04-13 21:50:59,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:50:59,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611879715] [2025-04-13 21:50:59,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:50:59,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:50:59,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:50:59,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:50:59,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:50:59,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:50:59,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:50:59,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:50:59,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611879715] [2025-04-13 21:50:59,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611879715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:50:59,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:50:59,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 21:50:59,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553389478] [2025-04-13 21:50:59,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:50:59,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:50:59,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:50:59,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:50:59,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:50:59,956 INFO L87 Difference]: Start difference. First operand 168 states and 345 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:00,213 INFO L93 Difference]: Finished difference Result 210 states and 424 transitions. [2025-04-13 21:51:00,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:51:00,214 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:00,214 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:00,215 INFO L225 Difference]: With dead ends: 210 [2025-04-13 21:51:00,215 INFO L226 Difference]: Without dead ends: 160 [2025-04-13 21:51:00,215 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:51:00,216 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:00,216 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:51:00,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-04-13 21:51:00,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-04-13 21:51:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 158 states have (on average 2.0632911392405062) internal successors, (326), 159 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 326 transitions. [2025-04-13 21:51:00,222 INFO L79 Accepts]: Start accepts. Automaton has 160 states and 326 transitions. Word has length 19 [2025-04-13 21:51:00,222 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:00,222 INFO L485 AbstractCegarLoop]: Abstraction has 160 states and 326 transitions. [2025-04-13 21:51:00,222 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:00,222 INFO L278 IsEmpty]: Start isEmpty. Operand 160 states and 326 transitions. [2025-04-13 21:51:00,224 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:00,224 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:00,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:00,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:51:00,225 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:00,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash 546653264, now seen corresponding path program 3 times [2025-04-13 21:51:00,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:00,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63815185] [2025-04-13 21:51:00,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:51:00,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:00,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:00,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:00,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:51:00,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:00,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:00,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63815185] [2025-04-13 21:51:00,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63815185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:00,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:00,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 21:51:00,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324073221] [2025-04-13 21:51:00,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:00,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:51:00,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:00,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:51:00,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:51:00,743 INFO L87 Difference]: Start difference. First operand 160 states and 326 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:01,106 INFO L93 Difference]: Finished difference Result 186 states and 371 transitions. [2025-04-13 21:51:01,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:51:01,107 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:01,108 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:01,108 INFO L225 Difference]: With dead ends: 186 [2025-04-13 21:51:01,108 INFO L226 Difference]: Without dead ends: 144 [2025-04-13 21:51:01,109 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:51:01,109 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:01,109 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:51:01,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-04-13 21:51:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-04-13 21:51:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 142 states have (on average 2.028169014084507) internal successors, (288), 143 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 288 transitions. [2025-04-13 21:51:01,121 INFO L79 Accepts]: Start accepts. Automaton has 144 states and 288 transitions. Word has length 19 [2025-04-13 21:51:01,121 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:01,121 INFO L485 AbstractCegarLoop]: Abstraction has 144 states and 288 transitions. [2025-04-13 21:51:01,121 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:01,121 INFO L278 IsEmpty]: Start isEmpty. Operand 144 states and 288 transitions. [2025-04-13 21:51:01,122 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:01,122 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:01,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:01,122 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:51:01,122 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:01,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash -502191664, now seen corresponding path program 4 times [2025-04-13 21:51:01,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:01,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139958191] [2025-04-13 21:51:01,123 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:51:01,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:01,145 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:51:01,154 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:01,154 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:51:01,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:01,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:01,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139958191] [2025-04-13 21:51:01,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139958191] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:01,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:01,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:51:01,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845455376] [2025-04-13 21:51:01,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:01,364 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:51:01,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:01,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:51:01,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:51:01,364 INFO L87 Difference]: Start difference. First operand 144 states and 288 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:01,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:01,559 INFO L93 Difference]: Finished difference Result 188 states and 370 transitions. [2025-04-13 21:51:01,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:51:01,560 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:01,560 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:01,561 INFO L225 Difference]: With dead ends: 188 [2025-04-13 21:51:01,561 INFO L226 Difference]: Without dead ends: 148 [2025-04-13 21:51:01,561 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:51:01,564 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:01,564 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:01,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-04-13 21:51:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2025-04-13 21:51:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 140 states have (on average 2.0285714285714285) internal successors, (284), 141 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:01,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 284 transitions. [2025-04-13 21:51:01,572 INFO L79 Accepts]: Start accepts. Automaton has 142 states and 284 transitions. Word has length 19 [2025-04-13 21:51:01,573 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:01,573 INFO L485 AbstractCegarLoop]: Abstraction has 142 states and 284 transitions. [2025-04-13 21:51:01,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:01,573 INFO L278 IsEmpty]: Start isEmpty. Operand 142 states and 284 transitions. [2025-04-13 21:51:01,573 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:01,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:01,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:01,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:51:01,573 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:01,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:01,574 INFO L85 PathProgramCache]: Analyzing trace with hash 104719242, now seen corresponding path program 5 times [2025-04-13 21:51:01,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:01,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560024126] [2025-04-13 21:51:01,574 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:51:01,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:01,592 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:01,598 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:01,598 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:51:01,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:01,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:01,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560024126] [2025-04-13 21:51:01,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560024126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:01,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:01,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:51:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250493573] [2025-04-13 21:51:01,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:01,782 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:51:01,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:01,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:51:01,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:51:01,782 INFO L87 Difference]: Start difference. First operand 142 states and 284 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:01,996 INFO L93 Difference]: Finished difference Result 212 states and 409 transitions. [2025-04-13 21:51:01,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:51:01,996 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:01,996 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:01,997 INFO L225 Difference]: With dead ends: 212 [2025-04-13 21:51:01,997 INFO L226 Difference]: Without dead ends: 174 [2025-04-13 21:51:01,998 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:51:02,000 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:02,000 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-04-13 21:51:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 140. [2025-04-13 21:51:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 138 states have (on average 2.0217391304347827) internal successors, (279), 139 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 279 transitions. [2025-04-13 21:51:02,005 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 279 transitions. Word has length 19 [2025-04-13 21:51:02,006 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:02,006 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 279 transitions. [2025-04-13 21:51:02,006 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:02,006 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 279 transitions. [2025-04-13 21:51:02,006 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:02,006 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:02,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:02,006 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:51:02,006 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:02,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:02,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1585223662, now seen corresponding path program 6 times [2025-04-13 21:51:02,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:02,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786634970] [2025-04-13 21:51:02,007 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:51:02,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:02,025 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:02,034 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:02,035 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:51:02,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:02,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:02,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786634970] [2025-04-13 21:51:02,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786634970] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:02,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:02,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:51:02,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790338952] [2025-04-13 21:51:02,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:02,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:51:02,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:02,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:51:02,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:51:02,176 INFO L87 Difference]: Start difference. First operand 140 states and 279 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:02,427 INFO L93 Difference]: Finished difference Result 188 states and 360 transitions. [2025-04-13 21:51:02,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:51:02,428 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:02,428 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:02,429 INFO L225 Difference]: With dead ends: 188 [2025-04-13 21:51:02,429 INFO L226 Difference]: Without dead ends: 152 [2025-04-13 21:51:02,429 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:51:02,430 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:02,430 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:51:02,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-04-13 21:51:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 134. [2025-04-13 21:51:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 132 states have (on average 1.9848484848484849) internal successors, (262), 133 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 262 transitions. [2025-04-13 21:51:02,433 INFO L79 Accepts]: Start accepts. Automaton has 134 states and 262 transitions. Word has length 19 [2025-04-13 21:51:02,433 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:02,433 INFO L485 AbstractCegarLoop]: Abstraction has 134 states and 262 transitions. [2025-04-13 21:51:02,433 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:02,433 INFO L278 IsEmpty]: Start isEmpty. Operand 134 states and 262 transitions. [2025-04-13 21:51:02,434 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:02,434 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:02,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:02,434 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:51:02,434 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:02,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:02,434 INFO L85 PathProgramCache]: Analyzing trace with hash 230376798, now seen corresponding path program 7 times [2025-04-13 21:51:02,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:02,434 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928582624] [2025-04-13 21:51:02,434 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:51:02,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:02,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:02,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:02,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:02,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:02,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:02,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:02,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928582624] [2025-04-13 21:51:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928582624] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:02,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:02,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 21:51:02,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026871037] [2025-04-13 21:51:02,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:02,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:51:02,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:02,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:51:02,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:51:02,905 INFO L87 Difference]: Start difference. First operand 134 states and 262 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:03,185 INFO L93 Difference]: Finished difference Result 167 states and 317 transitions. [2025-04-13 21:51:03,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:51:03,185 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:03,185 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:03,186 INFO L225 Difference]: With dead ends: 167 [2025-04-13 21:51:03,186 INFO L226 Difference]: Without dead ends: 131 [2025-04-13 21:51:03,187 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:51:03,187 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:03,187 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:51:03,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-13 21:51:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2025-04-13 21:51:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 2.017543859649123) internal successors, (230), 115 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 230 transitions. [2025-04-13 21:51:03,192 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 230 transitions. Word has length 19 [2025-04-13 21:51:03,192 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:03,192 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 230 transitions. [2025-04-13 21:51:03,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:03,193 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 230 transitions. [2025-04-13 21:51:03,193 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:03,193 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:03,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:03,193 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 21:51:03,193 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:03,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:03,194 INFO L85 PathProgramCache]: Analyzing trace with hash -684275703, now seen corresponding path program 3 times [2025-04-13 21:51:03,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:03,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058673963] [2025-04-13 21:51:03,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:51:03,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:03,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:03,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:03,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:51:03,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:03,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:03,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058673963] [2025-04-13 21:51:03,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058673963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:03,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:03,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 21:51:03,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287963866] [2025-04-13 21:51:03,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:03,607 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:51:03,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:03,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:51:03,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:51:03,608 INFO L87 Difference]: Start difference. First operand 116 states and 230 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:03,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:03,946 INFO L93 Difference]: Finished difference Result 175 states and 335 transitions. [2025-04-13 21:51:03,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:51:03,946 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:03,946 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:03,947 INFO L225 Difference]: With dead ends: 175 [2025-04-13 21:51:03,947 INFO L226 Difference]: Without dead ends: 174 [2025-04-13 21:51:03,947 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:51:03,948 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:03,948 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:51:03,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-04-13 21:51:03,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2025-04-13 21:51:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 130 states have (on average 2.0307692307692307) internal successors, (264), 131 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 264 transitions. [2025-04-13 21:51:03,953 INFO L79 Accepts]: Start accepts. Automaton has 132 states and 264 transitions. Word has length 19 [2025-04-13 21:51:03,953 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:03,953 INFO L485 AbstractCegarLoop]: Abstraction has 132 states and 264 transitions. [2025-04-13 21:51:03,953 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:03,953 INFO L278 IsEmpty]: Start isEmpty. Operand 132 states and 264 transitions. [2025-04-13 21:51:03,953 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:03,953 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:03,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:03,953 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 21:51:03,953 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:03,954 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:03,954 INFO L85 PathProgramCache]: Analyzing trace with hash -684275702, now seen corresponding path program 8 times [2025-04-13 21:51:03,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:03,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235042498] [2025-04-13 21:51:03,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:51:03,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:03,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:03,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:03,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:51:03,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:04,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:04,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235042498] [2025-04-13 21:51:04,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235042498] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:04,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:04,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 21:51:04,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867131748] [2025-04-13 21:51:04,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:04,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:51:04,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:04,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:51:04,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:51:04,493 INFO L87 Difference]: Start difference. First operand 132 states and 264 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:04,787 INFO L93 Difference]: Finished difference Result 158 states and 309 transitions. [2025-04-13 21:51:04,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:51:04,787 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:04,788 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:04,789 INFO L225 Difference]: With dead ends: 158 [2025-04-13 21:51:04,789 INFO L226 Difference]: Without dead ends: 108 [2025-04-13 21:51:04,789 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:51:04,790 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:04,790 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:51:04,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-13 21:51:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-04-13 21:51:04,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 106 states have (on average 1.990566037735849) internal successors, (211), 107 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 211 transitions. [2025-04-13 21:51:04,793 INFO L79 Accepts]: Start accepts. Automaton has 108 states and 211 transitions. Word has length 19 [2025-04-13 21:51:04,793 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:04,793 INFO L485 AbstractCegarLoop]: Abstraction has 108 states and 211 transitions. [2025-04-13 21:51:04,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:04,794 INFO L278 IsEmpty]: Start isEmpty. Operand 108 states and 211 transitions. [2025-04-13 21:51:04,794 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:04,795 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:04,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:04,795 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 21:51:04,795 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:04,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:04,795 INFO L85 PathProgramCache]: Analyzing trace with hash 351834097, now seen corresponding path program 4 times [2025-04-13 21:51:04,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:04,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101206733] [2025-04-13 21:51:04,795 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:51:04,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:04,814 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:51:04,824 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:04,824 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:51:04,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:05,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:05,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:05,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101206733] [2025-04-13 21:51:05,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101206733] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:05,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:05,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 21:51:05,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707016106] [2025-04-13 21:51:05,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:05,225 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:51:05,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:05,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:51:05,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:51:05,225 INFO L87 Difference]: Start difference. First operand 108 states and 211 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:05,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:05,637 INFO L93 Difference]: Finished difference Result 196 states and 382 transitions. [2025-04-13 21:51:05,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:51:05,637 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:05,638 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:05,639 INFO L225 Difference]: With dead ends: 196 [2025-04-13 21:51:05,639 INFO L226 Difference]: Without dead ends: 195 [2025-04-13 21:51:05,639 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:51:05,639 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:05,639 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:51:05,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-04-13 21:51:05,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 132. [2025-04-13 21:51:05,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 130 states have (on average 2.0384615384615383) internal successors, (265), 131 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 265 transitions. [2025-04-13 21:51:05,643 INFO L79 Accepts]: Start accepts. Automaton has 132 states and 265 transitions. Word has length 19 [2025-04-13 21:51:05,643 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:05,643 INFO L485 AbstractCegarLoop]: Abstraction has 132 states and 265 transitions. [2025-04-13 21:51:05,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:05,643 INFO L278 IsEmpty]: Start isEmpty. Operand 132 states and 265 transitions. [2025-04-13 21:51:05,644 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:05,644 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:05,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:05,644 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 21:51:05,644 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:05,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:05,644 INFO L85 PathProgramCache]: Analyzing trace with hash 351834098, now seen corresponding path program 9 times [2025-04-13 21:51:05,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:05,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205028093] [2025-04-13 21:51:05,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:51:05,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:05,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:05,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:05,665 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:51:05,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:06,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:06,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:06,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205028093] [2025-04-13 21:51:06,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205028093] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:06,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:06,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 21:51:06,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28540452] [2025-04-13 21:51:06,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:06,090 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:51:06,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:06,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:51:06,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:51:06,091 INFO L87 Difference]: Start difference. First operand 132 states and 265 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:06,373 INFO L93 Difference]: Finished difference Result 170 states and 336 transitions. [2025-04-13 21:51:06,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:51:06,373 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:06,373 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:06,374 INFO L225 Difference]: With dead ends: 170 [2025-04-13 21:51:06,374 INFO L226 Difference]: Without dead ends: 128 [2025-04-13 21:51:06,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:51:06,376 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:06,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:51:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-04-13 21:51:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2025-04-13 21:51:06,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.9912280701754386) internal successors, (227), 115 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 227 transitions. [2025-04-13 21:51:06,380 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 227 transitions. Word has length 19 [2025-04-13 21:51:06,380 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:06,380 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 227 transitions. [2025-04-13 21:51:06,380 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:06,380 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 227 transitions. [2025-04-13 21:51:06,380 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:06,380 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:06,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:06,380 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 21:51:06,380 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:06,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:06,381 INFO L85 PathProgramCache]: Analyzing trace with hash -697010830, now seen corresponding path program 10 times [2025-04-13 21:51:06,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:06,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208652600] [2025-04-13 21:51:06,381 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:51:06,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:06,398 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:51:06,403 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:06,403 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:51:06,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:06,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:06,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208652600] [2025-04-13 21:51:06,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208652600] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:06,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:06,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:51:06,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664978137] [2025-04-13 21:51:06,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:06,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:51:06,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:06,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:51:06,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:51:06,558 INFO L87 Difference]: Start difference. First operand 116 states and 227 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:06,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:06,726 INFO L93 Difference]: Finished difference Result 160 states and 307 transitions. [2025-04-13 21:51:06,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:51:06,727 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:06,727 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:06,727 INFO L225 Difference]: With dead ends: 160 [2025-04-13 21:51:06,727 INFO L226 Difference]: Without dead ends: 122 [2025-04-13 21:51:06,728 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:51:06,728 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:06,728 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:06,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-04-13 21:51:06,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2025-04-13 21:51:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 112 states have (on average 1.9821428571428572) internal successors, (222), 113 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 222 transitions. [2025-04-13 21:51:06,731 INFO L79 Accepts]: Start accepts. Automaton has 114 states and 222 transitions. Word has length 19 [2025-04-13 21:51:06,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:06,731 INFO L485 AbstractCegarLoop]: Abstraction has 114 states and 222 transitions. [2025-04-13 21:51:06,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:06,731 INFO L278 IsEmpty]: Start isEmpty. Operand 114 states and 222 transitions. [2025-04-13 21:51:06,731 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:06,731 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:06,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:06,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 21:51:06,732 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:06,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:06,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1908013562, now seen corresponding path program 11 times [2025-04-13 21:51:06,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:06,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405050509] [2025-04-13 21:51:06,732 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:51:06,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:06,744 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:06,748 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:06,748 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:51:06,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:06,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:06,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405050509] [2025-04-13 21:51:06,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405050509] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:06,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:06,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:51:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336207021] [2025-04-13 21:51:06,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:06,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:51:06,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:06,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:51:06,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:51:06,887 INFO L87 Difference]: Start difference. First operand 114 states and 222 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:07,072 INFO L93 Difference]: Finished difference Result 174 states and 329 transitions. [2025-04-13 21:51:07,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:51:07,073 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:07,073 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:07,073 INFO L225 Difference]: With dead ends: 174 [2025-04-13 21:51:07,074 INFO L226 Difference]: Without dead ends: 138 [2025-04-13 21:51:07,074 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:51:07,075 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:07,075 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:07,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-04-13 21:51:07,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 112. [2025-04-13 21:51:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 110 states have (on average 1.9545454545454546) internal successors, (215), 111 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 215 transitions. [2025-04-13 21:51:07,079 INFO L79 Accepts]: Start accepts. Automaton has 112 states and 215 transitions. Word has length 19 [2025-04-13 21:51:07,079 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:07,079 INFO L485 AbstractCegarLoop]: Abstraction has 112 states and 215 transitions. [2025-04-13 21:51:07,079 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:07,079 INFO L278 IsEmpty]: Start isEmpty. Operand 112 states and 215 transitions. [2025-04-13 21:51:07,080 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:07,080 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:07,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:07,080 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 21:51:07,080 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:07,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:07,080 INFO L85 PathProgramCache]: Analyzing trace with hash -571353274, now seen corresponding path program 12 times [2025-04-13 21:51:07,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:07,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207200289] [2025-04-13 21:51:07,083 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:51:07,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:07,098 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:07,104 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:07,104 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:51:07,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:07,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:07,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207200289] [2025-04-13 21:51:07,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207200289] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:07,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:07,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 21:51:07,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854254847] [2025-04-13 21:51:07,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:07,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:51:07,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:07,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:51:07,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:51:07,496 INFO L87 Difference]: Start difference. First operand 112 states and 215 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:07,794 INFO L93 Difference]: Finished difference Result 138 states and 259 transitions. [2025-04-13 21:51:07,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:51:07,795 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:07,795 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:07,795 INFO L225 Difference]: With dead ends: 138 [2025-04-13 21:51:07,795 INFO L226 Difference]: Without dead ends: 104 [2025-04-13 21:51:07,796 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:51:07,796 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:07,796 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:51:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-13 21:51:07,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-04-13 21:51:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.9705882352941178) internal successors, (201), 103 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 201 transitions. [2025-04-13 21:51:07,799 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 201 transitions. Word has length 19 [2025-04-13 21:51:07,800 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:07,800 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 201 transitions. [2025-04-13 21:51:07,800 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:07,800 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 201 transitions. [2025-04-13 21:51:07,800 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:07,801 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:07,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:07,801 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 21:51:07,801 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:07,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:07,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1896080399, now seen corresponding path program 5 times [2025-04-13 21:51:07,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:07,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828491059] [2025-04-13 21:51:07,801 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:51:07,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:07,814 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:07,819 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:07,819 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:51:07,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:08,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:08,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828491059] [2025-04-13 21:51:08,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828491059] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:08,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:08,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 21:51:08,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440405028] [2025-04-13 21:51:08,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:08,174 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:51:08,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:08,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:51:08,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:51:08,174 INFO L87 Difference]: Start difference. First operand 104 states and 201 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:08,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:08,552 INFO L93 Difference]: Finished difference Result 104 states and 201 transitions. [2025-04-13 21:51:08,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:51:08,553 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:08,553 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:08,553 INFO L225 Difference]: With dead ends: 104 [2025-04-13 21:51:08,553 INFO L226 Difference]: Without dead ends: 103 [2025-04-13 21:51:08,554 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:51:08,554 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:08,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-04-13 21:51:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 78. [2025-04-13 21:51:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 2.012987012987013) internal successors, (155), 77 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 155 transitions. [2025-04-13 21:51:08,556 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 155 transitions. Word has length 19 [2025-04-13 21:51:08,556 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:08,556 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 155 transitions. [2025-04-13 21:51:08,556 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:08,556 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 155 transitions. [2025-04-13 21:51:08,557 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:08,557 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:08,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:08,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 21:51:08,557 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:08,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:08,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1896080400, now seen corresponding path program 13 times [2025-04-13 21:51:08,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:08,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219827235] [2025-04-13 21:51:08,557 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:51:08,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:08,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:08,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:08,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:08,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:08,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 21:51:08,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:08,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219827235] [2025-04-13 21:51:08,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219827235] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:08,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:08,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 21:51:08,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948356080] [2025-04-13 21:51:08,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:08,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:51:08,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:08,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:51:08,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:51:08,990 INFO L87 Difference]: Start difference. First operand 78 states and 155 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:09,235 INFO L93 Difference]: Finished difference Result 104 states and 200 transitions. [2025-04-13 21:51:09,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:51:09,236 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:09,236 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:09,236 INFO L225 Difference]: With dead ends: 104 [2025-04-13 21:51:09,236 INFO L226 Difference]: Without dead ends: 62 [2025-04-13 21:51:09,236 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:51:09,237 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:09,237 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:51:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-13 21:51:09,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-04-13 21:51:09,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.9180327868852458) internal successors, (117), 61 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 117 transitions. [2025-04-13 21:51:09,239 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 117 transitions. Word has length 19 [2025-04-13 21:51:09,239 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:09,239 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 117 transitions. [2025-04-13 21:51:09,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:09,239 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 117 transitions. [2025-04-13 21:51:09,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:09,239 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:09,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:09,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 21:51:09,241 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:09,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:09,241 INFO L85 PathProgramCache]: Analyzing trace with hash 847235472, now seen corresponding path program 14 times [2025-04-13 21:51:09,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:09,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268805586] [2025-04-13 21:51:09,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:51:09,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:09,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:09,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:09,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:51:09,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:09,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:09,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268805586] [2025-04-13 21:51:09,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268805586] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:09,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:09,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:51:09,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78076824] [2025-04-13 21:51:09,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:09,418 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:51:09,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:09,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:51:09,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:51:09,419 INFO L87 Difference]: Start difference. First operand 62 states and 117 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:09,561 INFO L93 Difference]: Finished difference Result 108 states and 204 transitions. [2025-04-13 21:51:09,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:51:09,562 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:09,562 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:09,562 INFO L225 Difference]: With dead ends: 108 [2025-04-13 21:51:09,563 INFO L226 Difference]: Without dead ends: 72 [2025-04-13 21:51:09,563 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:51:09,563 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:09,563 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-13 21:51:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2025-04-13 21:51:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.873015873015873) internal successors, (118), 63 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 118 transitions. [2025-04-13 21:51:09,565 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 118 transitions. Word has length 19 [2025-04-13 21:51:09,565 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:09,565 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 118 transitions. [2025-04-13 21:51:09,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:09,565 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 118 transitions. [2025-04-13 21:51:09,565 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:09,565 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:09,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:09,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 21:51:09,565 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:09,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:09,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1632131364, now seen corresponding path program 15 times [2025-04-13 21:51:09,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:09,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994365973] [2025-04-13 21:51:09,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:51:09,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:09,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:09,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:09,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:51:09,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:09,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:09,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994365973] [2025-04-13 21:51:09,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994365973] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:09,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:09,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 21:51:09,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554324008] [2025-04-13 21:51:09,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:09,995 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:51:09,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:09,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:51:09,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:51:09,995 INFO L87 Difference]: Start difference. First operand 64 states and 118 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:10,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:10,236 INFO L93 Difference]: Finished difference Result 102 states and 189 transitions. [2025-04-13 21:51:10,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:51:10,236 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:10,236 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:10,237 INFO L225 Difference]: With dead ends: 102 [2025-04-13 21:51:10,237 INFO L226 Difference]: Without dead ends: 54 [2025-04-13 21:51:10,237 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:51:10,237 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:10,238 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-13 21:51:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-04-13 21:51:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.830188679245283) internal successors, (97), 53 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2025-04-13 21:51:10,240 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 19 [2025-04-13 21:51:10,240 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:10,240 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2025-04-13 21:51:10,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:10,240 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2025-04-13 21:51:10,240 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:10,240 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:10,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:10,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 21:51:10,240 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:10,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:10,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1062798960, now seen corresponding path program 16 times [2025-04-13 21:51:10,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:10,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632006868] [2025-04-13 21:51:10,241 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:51:10,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:10,257 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:51:10,264 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:10,265 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:51:10,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:10,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:10,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632006868] [2025-04-13 21:51:10,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632006868] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:10,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:10,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:51:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369526198] [2025-04-13 21:51:10,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:10,518 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:51:10,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:10,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:51:10,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:51:10,519 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:10,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:10,646 INFO L93 Difference]: Finished difference Result 76 states and 133 transitions. [2025-04-13 21:51:10,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:51:10,646 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:10,646 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:10,647 INFO L225 Difference]: With dead ends: 76 [2025-04-13 21:51:10,647 INFO L226 Difference]: Without dead ends: 44 [2025-04-13 21:51:10,647 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:51:10,648 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:10,648 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:10,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-13 21:51:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-04-13 21:51:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.697674418604651) internal successors, (73), 43 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 73 transitions. [2025-04-13 21:51:10,650 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 73 transitions. Word has length 19 [2025-04-13 21:51:10,650 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:10,650 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 73 transitions. [2025-04-13 21:51:10,650 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:10,650 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 73 transitions. [2025-04-13 21:51:10,650 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:10,650 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:10,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:10,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 21:51:10,650 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:10,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:10,650 INFO L85 PathProgramCache]: Analyzing trace with hash 725258234, now seen corresponding path program 17 times [2025-04-13 21:51:10,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:10,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27905224] [2025-04-13 21:51:10,651 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:51:10,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:10,661 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:10,671 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:10,671 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:51:10,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:51:11,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:11,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27905224] [2025-04-13 21:51:11,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27905224] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:11,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:11,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 21:51:11,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448754858] [2025-04-13 21:51:11,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:11,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:51:11,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:11,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:51:11,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:51:11,061 INFO L87 Difference]: Start difference. First operand 44 states and 73 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:11,201 INFO L93 Difference]: Finished difference Result 44 states and 73 transitions. [2025-04-13 21:51:11,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:51:11,202 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 21:51:11,202 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:11,202 INFO L225 Difference]: With dead ends: 44 [2025-04-13 21:51:11,202 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 21:51:11,202 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:51:11,203 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:11,203 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:11,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 21:51:11,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 21:51:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 21:51:11,204 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2025-04-13 21:51:11,204 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:11,204 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 21:51:11,204 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:51:11,204 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 21:51:11,204 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 21:51:11,207 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-04-13 21:51:11,207 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-13 21:51:11,207 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-13 21:51:11,207 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-13 21:51:11,207 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-13 21:51:11,207 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-13 21:51:11,207 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-04-13 21:51:11,207 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-04-13 21:51:11,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 21:51:11,209 INFO L422 BasicCegarLoop]: Path program histogram: [17, 5, 1] [2025-04-13 21:51:11,211 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:51:11,211 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:51:11,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:51:11 BasicIcfg [2025-04-13 21:51:11,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:51:11,213 INFO L158 Benchmark]: Toolchain (without parser) took 17687.49ms. Allocated memory was 155.2MB in the beginning and 637.5MB in the end (delta: 482.3MB). Free memory was 105.4MB in the beginning and 229.0MB in the end (delta: -123.6MB). Peak memory consumption was 357.8MB. Max. memory is 8.0GB. [2025-04-13 21:51:11,213 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:51:11,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.17ms. Allocated memory is still 155.2MB. Free memory was 105.4MB in the beginning and 71.7MB in the end (delta: 33.7MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-13 21:51:11,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.14ms. Allocated memory is still 155.2MB. Free memory was 71.7MB in the beginning and 69.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:51:11,213 INFO L158 Benchmark]: Boogie Preprocessor took 50.33ms. Allocated memory is still 155.2MB. Free memory was 69.0MB in the beginning and 65.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:51:11,214 INFO L158 Benchmark]: IcfgBuilder took 700.38ms. Allocated memory is still 155.2MB. Free memory was 65.5MB in the beginning and 75.0MB in the end (delta: -9.5MB). Peak memory consumption was 51.2MB. Max. memory is 8.0GB. [2025-04-13 21:51:11,214 INFO L158 Benchmark]: TraceAbstraction took 16376.37ms. Allocated memory was 155.2MB in the beginning and 637.5MB in the end (delta: 482.3MB). Free memory was 74.2MB in the beginning and 229.0MB in the end (delta: -154.7MB). Peak memory consumption was 327.6MB. Max. memory is 8.0GB. [2025-04-13 21:51:11,214 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.20ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 513.17ms. Allocated memory is still 155.2MB. Free memory was 105.4MB in the beginning and 71.7MB in the end (delta: 33.7MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.14ms. Allocated memory is still 155.2MB. Free memory was 71.7MB in the beginning and 69.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 50.33ms. Allocated memory is still 155.2MB. Free memory was 69.0MB in the beginning and 65.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 700.38ms. Allocated memory is still 155.2MB. Free memory was 65.5MB in the beginning and 75.0MB in the end (delta: -9.5MB). Peak memory consumption was 51.2MB. Max. memory is 8.0GB. * TraceAbstraction took 16376.37ms. Allocated memory was 155.2MB in the beginning and 637.5MB in the end (delta: 482.3MB). Free memory was 74.2MB in the beginning and 229.0MB in the end (delta: -154.7MB). Peak memory consumption was 327.6MB. 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 - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 36 locations, 43 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1521 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1521 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4920 IncrementalHoareTripleChecker+Invalid, 4991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 0 mSDtfsCounter, 4920 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=0, InterpolantAutomatonStates: 255, 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, 23 MinimizatonAttempts, 364 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 419 NumberOfCodeBlocks, 419 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 396 ConstructedInterpolants, 0 QuantifiedInterpolants, 5212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 21:51:11,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...