./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c505ae1adfc08ba258d60bd75ac11e8743fcfab06e2df8bbc0556c70ed343ff7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:42:17,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:42:17,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:42:17,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:42:17,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:42:17,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:42:17,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:42:17,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:42:17,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:42:17,948 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:42:17,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:42:17,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:42:17,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:42:17,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:42:17,949 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:42:17,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:42:17,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:42:17,951 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:42:17,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:42:17,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:42:17,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:42:17,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:42:17,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:42:17,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:42:17,951 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:42:17,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:42:17,952 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:42:17,952 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:42:17,952 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:42:17,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:42:17,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:42:17,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:42:17,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:42:17,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:42:17,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:42:17,952 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:42:17,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:42:17,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:42:17,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:42:17,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:42:17,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:42:17,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:42:17,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:42:17,953 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c505ae1adfc08ba258d60bd75ac11e8743fcfab06e2df8bbc0556c70ed343ff7 [2025-02-05 17:42:18,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:42:18,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:42:18,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:42:18,253 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:42:18,254 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:42:18,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-02-05 17:42:19,689 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0891f6e4c/c1a75fea13a74dbd98736a0d07d34197/FLAGd42d24b2d [2025-02-05 17:42:20,159 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:42:20,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-02-05 17:42:20,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0891f6e4c/c1a75fea13a74dbd98736a0d07d34197/FLAGd42d24b2d [2025-02-05 17:42:20,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0891f6e4c/c1a75fea13a74dbd98736a0d07d34197 [2025-02-05 17:42:20,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:42:20,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:42:20,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:42:20,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:42:20,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:42:20,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:42:20" (1/1) ... [2025-02-05 17:42:20,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b87d394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:42:20, skipping insertion in model container [2025-02-05 17:42:20,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:42:20" (1/1) ... [2025-02-05 17:42:20,313 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:42:20,663 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c[11668,11681] [2025-02-05 17:42:20,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c[18958,18971] [2025-02-05 17:42:21,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:42:21,268 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:42:21,306 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c[11668,11681] [2025-02-05 17:42:21,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c[18958,18971] [2025-02-05 17:42:21,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:42:21,644 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:42:21,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:42:21 WrapperNode [2025-02-05 17:42:21,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:42:21,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:42:21,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:42:21,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:42:21,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:42:21" (1/1) ... [2025-02-05 17:42:21,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:42:21" (1/1) ... [2025-02-05 17:42:22,009 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5091 [2025-02-05 17:42:22,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:42:22,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:42:22,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:42:22,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:42:22,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:42:21" (1/1) ... [2025-02-05 17:42:22,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:42:21" (1/1) ... [2025-02-05 17:42:22,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:42:21" (1/1) ... [2025-02-05 17:42:22,232 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:42:22,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:42:21" (1/1) ... [2025-02-05 17:42:22,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:42:21" (1/1) ... [2025-02-05 17:42:22,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:42:21" (1/1) ... [2025-02-05 17:42:22,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:42:21" (1/1) ... [2025-02-05 17:42:22,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:42:21" (1/1) ... [2025-02-05 17:42:22,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:42:21" (1/1) ... [2025-02-05 17:42:22,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:42:22,496 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:42:22,496 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:42:22,497 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:42:22,498 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:42:21" (1/1) ... [2025-02-05 17:42:22,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:42:22,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:42:22,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:42:22,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:42:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:42:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:42:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:42:22,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:42:22,654 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:42:22,657 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:42:26,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: havoc calculate_output_#t~ret37#1; [2025-02-05 17:42:26,908 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608: havoc calculate_output2_#t~ret38#1; [2025-02-05 17:42:26,908 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5098: havoc calculate_output3_#t~ret39#1; [2025-02-05 17:42:27,086 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-02-05 17:42:27,086 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:42:27,125 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:42:27,125 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:42:27,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:42:27 BoogieIcfgContainer [2025-02-05 17:42:27,126 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:42:27,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:42:27,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:42:27,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:42:27,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:42:20" (1/3) ... [2025-02-05 17:42:27,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b28e0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:42:27, skipping insertion in model container [2025-02-05 17:42:27,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:42:21" (2/3) ... [2025-02-05 17:42:27,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b28e0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:42:27, skipping insertion in model container [2025-02-05 17:42:27,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:42:27" (3/3) ... [2025-02-05 17:42:27,135 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-02-05 17:42:27,155 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:42:27,158 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label02.c that has 1 procedures, 900 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:42:27,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:42:27,256 INFO L333 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=PETRI_NET, 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;@1ec30bec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:42:27,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:42:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 900 states, 897 states have (on average 1.9030100334448161) internal successors, (1707), 899 states have internal predecessors, (1707), 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-02-05 17:42:27,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 17:42:27,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:27,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:27,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:27,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash -29917392, now seen corresponding path program 1 times [2025-02-05 17:42:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:27,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423259620] [2025-02-05 17:42:27,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:27,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:27,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 17:42:27,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 17:42:27,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:27,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:27,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:27,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423259620] [2025-02-05 17:42:27,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423259620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:27,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:27,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:42:27,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958359155] [2025-02-05 17:42:27,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:27,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:42:27,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:27,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:42:27,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:42:27,551 INFO L87 Difference]: Start difference. First operand has 900 states, 897 states have (on average 1.9030100334448161) internal successors, (1707), 899 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:42:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:27,623 INFO L93 Difference]: Finished difference Result 1762 states and 3343 transitions. [2025-02-05 17:42:27,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:42:27,628 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 17:42:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:27,644 INFO L225 Difference]: With dead ends: 1762 [2025-02-05 17:42:27,645 INFO L226 Difference]: Without dead ends: 835 [2025-02-05 17:42:27,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:42:27,653 INFO L435 NwaCegarLoop]: 1641 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:27,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:42:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-02-05 17:42:27,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2025-02-05 17:42:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 833 states have (on average 1.893157262905162) internal successors, (1577), 834 states have internal predecessors, (1577), 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-02-05 17:42:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1577 transitions. [2025-02-05 17:42:27,756 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1577 transitions. Word has length 24 [2025-02-05 17:42:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:27,756 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1577 transitions. [2025-02-05 17:42:27,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:42:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1577 transitions. [2025-02-05 17:42:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 17:42:27,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:27,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:27,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:42:27,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:27,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:27,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1026989745, now seen corresponding path program 1 times [2025-02-05 17:42:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:27,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895983280] [2025-02-05 17:42:27,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:27,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 17:42:27,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 17:42:27,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:27,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:28,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:28,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:28,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895983280] [2025-02-05 17:42:28,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895983280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:28,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:28,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:42:28,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48819596] [2025-02-05 17:42:28,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:28,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:42:28,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:28,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:42:28,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:42:28,068 INFO L87 Difference]: Start difference. First operand 835 states and 1577 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:42:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:28,190 INFO L93 Difference]: Finished difference Result 883 states and 1651 transitions. [2025-02-05 17:42:28,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:42:28,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 17:42:28,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:28,195 INFO L225 Difference]: With dead ends: 883 [2025-02-05 17:42:28,195 INFO L226 Difference]: Without dead ends: 835 [2025-02-05 17:42:28,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:42:28,196 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 0 mSDsluCounter, 4689 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6264 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:28,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6264 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:42:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-02-05 17:42:28,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2025-02-05 17:42:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 833 states have (on average 1.8559423769507803) internal successors, (1546), 834 states have internal predecessors, (1546), 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-02-05 17:42:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1546 transitions. [2025-02-05 17:42:28,221 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1546 transitions. Word has length 24 [2025-02-05 17:42:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:28,221 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1546 transitions. [2025-02-05 17:42:28,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:42:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1546 transitions. [2025-02-05 17:42:28,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:42:28,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:28,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:28,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:42:28,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:28,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:28,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1149039, now seen corresponding path program 1 times [2025-02-05 17:42:28,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:28,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571724715] [2025-02-05 17:42:28,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:28,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:28,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:42:28,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:42:28,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:28,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:28,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:28,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571724715] [2025-02-05 17:42:28,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571724715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:28,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:28,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:42:28,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868161029] [2025-02-05 17:42:28,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:28,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:42:28,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:28,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:42:28,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:42:28,495 INFO L87 Difference]: Start difference. First operand 835 states and 1546 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-02-05 17:42:28,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:28,791 INFO L93 Difference]: Finished difference Result 1275 states and 2246 transitions. [2025-02-05 17:42:28,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 17:42:28,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 54 [2025-02-05 17:42:28,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:28,801 INFO L225 Difference]: With dead ends: 1275 [2025-02-05 17:42:28,801 INFO L226 Difference]: Without dead ends: 1231 [2025-02-05 17:42:28,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-02-05 17:42:28,803 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 7979 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7979 SdHoareTripleChecker+Valid, 2696 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:28,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7979 Valid, 2696 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:42:28,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2025-02-05 17:42:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 877. [2025-02-05 17:42:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 875 states have (on average 1.8434285714285714) internal successors, (1613), 876 states have internal predecessors, (1613), 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-02-05 17:42:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1613 transitions. [2025-02-05 17:42:28,837 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1613 transitions. Word has length 54 [2025-02-05 17:42:28,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:28,837 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1613 transitions. [2025-02-05 17:42:28,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-02-05 17:42:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1613 transitions. [2025-02-05 17:42:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:42:28,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:28,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:28,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:42:28,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:28,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:28,842 INFO L85 PathProgramCache]: Analyzing trace with hash 16126764, now seen corresponding path program 1 times [2025-02-05 17:42:28,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:28,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342853854] [2025-02-05 17:42:28,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:28,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:28,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:42:28,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:42:28,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:28,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:28,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:28,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342853854] [2025-02-05 17:42:28,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342853854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:28,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:28,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:42:28,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104659015] [2025-02-05 17:42:28,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:28,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:42:28,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:28,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:42:28,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:28,985 INFO L87 Difference]: Start difference. First operand 877 states and 1613 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-05 17:42:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:29,078 INFO L93 Difference]: Finished difference Result 1038 states and 1868 transitions. [2025-02-05 17:42:29,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:42:29,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 56 [2025-02-05 17:42:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:29,084 INFO L225 Difference]: With dead ends: 1038 [2025-02-05 17:42:29,084 INFO L226 Difference]: Without dead ends: 952 [2025-02-05 17:42:29,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:29,086 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1484 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:29,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1605 Invalid, 15 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:42:29,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-02-05 17:42:29,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 948. [2025-02-05 17:42:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 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-02-05 17:42:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1723 transitions. [2025-02-05 17:42:29,119 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1723 transitions. Word has length 56 [2025-02-05 17:42:29,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:29,121 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1723 transitions. [2025-02-05 17:42:29,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-05 17:42:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1723 transitions. [2025-02-05 17:42:29,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:42:29,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:29,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:29,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:42:29,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:29,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:29,126 INFO L85 PathProgramCache]: Analyzing trace with hash 48449999, now seen corresponding path program 1 times [2025-02-05 17:42:29,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:29,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349180212] [2025-02-05 17:42:29,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:29,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:29,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:42:29,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:42:29,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:29,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:29,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:29,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349180212] [2025-02-05 17:42:29,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349180212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:29,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:29,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:42:29,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835464513] [2025-02-05 17:42:29,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:29,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:42:29,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:29,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:42:29,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:42:29,449 INFO L87 Difference]: Start difference. First operand 948 states and 1723 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-02-05 17:42:29,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:29,637 INFO L93 Difference]: Finished difference Result 1107 states and 1971 transitions. [2025-02-05 17:42:29,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:42:29,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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 56 [2025-02-05 17:42:29,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:29,643 INFO L225 Difference]: With dead ends: 1107 [2025-02-05 17:42:29,643 INFO L226 Difference]: Without dead ends: 950 [2025-02-05 17:42:29,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:42:29,645 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 5976 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5976 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:29,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5976 Valid, 1805 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:42:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-02-05 17:42:29,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 948. [2025-02-05 17:42:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 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-02-05 17:42:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1721 transitions. [2025-02-05 17:42:29,668 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1721 transitions. Word has length 56 [2025-02-05 17:42:29,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:29,669 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1721 transitions. [2025-02-05 17:42:29,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-02-05 17:42:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1721 transitions. [2025-02-05 17:42:29,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 17:42:29,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:29,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:29,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:42:29,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:29,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:29,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1532487703, now seen corresponding path program 1 times [2025-02-05 17:42:29,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:29,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872023134] [2025-02-05 17:42:29,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:29,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:29,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 17:42:29,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 17:42:29,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:29,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:29,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:29,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872023134] [2025-02-05 17:42:29,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872023134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:29,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:29,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:42:29,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700822572] [2025-02-05 17:42:29,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:29,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:42:29,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:29,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:42:29,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:42:29,984 INFO L87 Difference]: Start difference. First operand 948 states and 1721 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:42:30,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:30,059 INFO L93 Difference]: Finished difference Result 956 states and 1730 transitions. [2025-02-05 17:42:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:42:30,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-02-05 17:42:30,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:30,066 INFO L225 Difference]: With dead ends: 956 [2025-02-05 17:42:30,066 INFO L226 Difference]: Without dead ends: 954 [2025-02-05 17:42:30,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:42:30,069 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 0 mSDsluCounter, 9227 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10767 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:30,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10767 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:42:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-02-05 17:42:30,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 954. [2025-02-05 17:42:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 952 states have (on average 1.8130252100840336) internal successors, (1726), 953 states have internal predecessors, (1726), 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-02-05 17:42:30,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1726 transitions. [2025-02-05 17:42:30,095 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1726 transitions. Word has length 57 [2025-02-05 17:42:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:30,096 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1726 transitions. [2025-02-05 17:42:30,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:42:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1726 transitions. [2025-02-05 17:42:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:42:30,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:30,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:30,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:42:30,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:30,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1331006163, now seen corresponding path program 1 times [2025-02-05 17:42:30,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:30,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662684174] [2025-02-05 17:42:30,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:30,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:30,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:42:30,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:42:30,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:30,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:30,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:30,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662684174] [2025-02-05 17:42:30,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662684174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:30,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:30,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:42:30,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125911696] [2025-02-05 17:42:30,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:30,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:42:30,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:30,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:42:30,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:30,171 INFO L87 Difference]: Start difference. First operand 954 states and 1726 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:42:30,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:30,197 INFO L93 Difference]: Finished difference Result 1264 states and 2198 transitions. [2025-02-05 17:42:30,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:42:30,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-05 17:42:30,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:30,203 INFO L225 Difference]: With dead ends: 1264 [2025-02-05 17:42:30,203 INFO L226 Difference]: Without dead ends: 1101 [2025-02-05 17:42:30,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:30,204 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1497 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:30,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1668 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:42:30,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2025-02-05 17:42:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1099. [2025-02-05 17:42:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1097 states have (on average 1.7711941659070192) internal successors, (1943), 1098 states have internal predecessors, (1943), 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-02-05 17:42:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1943 transitions. [2025-02-05 17:42:30,230 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1943 transitions. Word has length 58 [2025-02-05 17:42:30,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:30,231 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1943 transitions. [2025-02-05 17:42:30,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:42:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1943 transitions. [2025-02-05 17:42:30,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:42:30,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:30,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:30,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:42:30,232 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:30,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:30,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1778951699, now seen corresponding path program 1 times [2025-02-05 17:42:30,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:30,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553949475] [2025-02-05 17:42:30,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:30,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:30,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:42:30,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:42:30,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:30,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:30,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:30,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553949475] [2025-02-05 17:42:30,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553949475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:30,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:30,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:42:30,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922114103] [2025-02-05 17:42:30,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:30,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:42:30,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:30,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:42:30,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:30,306 INFO L87 Difference]: Start difference. First operand 1099 states and 1943 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:42:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:30,337 INFO L93 Difference]: Finished difference Result 1683 states and 2821 transitions. [2025-02-05 17:42:30,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:42:30,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-05 17:42:30,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:30,345 INFO L225 Difference]: With dead ends: 1683 [2025-02-05 17:42:30,345 INFO L226 Difference]: Without dead ends: 1375 [2025-02-05 17:42:30,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:30,347 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 1495 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:30,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1670 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:42:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-02-05 17:42:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1373. [2025-02-05 17:42:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1371 states have (on average 1.7104303428154632) internal successors, (2345), 1372 states have internal predecessors, (2345), 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-02-05 17:42:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 2345 transitions. [2025-02-05 17:42:30,381 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 2345 transitions. Word has length 58 [2025-02-05 17:42:30,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:30,382 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 2345 transitions. [2025-02-05 17:42:30,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:42:30,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2345 transitions. [2025-02-05 17:42:30,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:42:30,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:30,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:30,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:42:30,385 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:30,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:30,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1363775827, now seen corresponding path program 1 times [2025-02-05 17:42:30,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:30,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391632744] [2025-02-05 17:42:30,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:30,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:30,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:42:30,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:42:30,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:30,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:30,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:30,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391632744] [2025-02-05 17:42:30,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391632744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:30,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:30,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:42:30,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171216948] [2025-02-05 17:42:30,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:30,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:42:30,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:30,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:42:30,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:30,451 INFO L87 Difference]: Start difference. First operand 1373 states and 2345 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:42:30,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:30,488 INFO L93 Difference]: Finished difference Result 2473 states and 3971 transitions. [2025-02-05 17:42:30,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:42:30,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-05 17:42:30,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:30,496 INFO L225 Difference]: With dead ends: 2473 [2025-02-05 17:42:30,496 INFO L226 Difference]: Without dead ends: 1891 [2025-02-05 17:42:30,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:30,498 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 1493 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:30,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1672 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:42:30,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2025-02-05 17:42:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1889. [2025-02-05 17:42:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1887 states have (on average 1.634870164281929) internal successors, (3085), 1888 states have internal predecessors, (3085), 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-02-05 17:42:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 3085 transitions. [2025-02-05 17:42:30,551 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 3085 transitions. Word has length 58 [2025-02-05 17:42:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:30,551 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 3085 transitions. [2025-02-05 17:42:30,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:42:30,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 3085 transitions. [2025-02-05 17:42:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:42:30,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:30,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:30,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:42:30,553 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:30,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:30,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1850494099, now seen corresponding path program 1 times [2025-02-05 17:42:30,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:30,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41410992] [2025-02-05 17:42:30,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:30,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:30,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:42:30,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:42:30,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:30,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:30,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:30,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41410992] [2025-02-05 17:42:30,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41410992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:30,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:30,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:42:30,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558836510] [2025-02-05 17:42:30,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:30,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:42:30,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:30,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:42:30,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:30,616 INFO L87 Difference]: Start difference. First operand 1889 states and 3085 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:42:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:30,672 INFO L93 Difference]: Finished difference Result 3957 states and 6079 transitions. [2025-02-05 17:42:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:42:30,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-05 17:42:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:30,685 INFO L225 Difference]: With dead ends: 3957 [2025-02-05 17:42:30,685 INFO L226 Difference]: Without dead ends: 2859 [2025-02-05 17:42:30,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:30,688 INFO L435 NwaCegarLoop]: 1587 mSDtfsCounter, 1491 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:30,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1674 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:42:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2025-02-05 17:42:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2857. [2025-02-05 17:42:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2855 states have (on average 1.5541155866900176) internal successors, (4437), 2856 states have internal predecessors, (4437), 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-02-05 17:42:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 4437 transitions. [2025-02-05 17:42:30,771 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 4437 transitions. Word has length 58 [2025-02-05 17:42:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:30,771 INFO L471 AbstractCegarLoop]: Abstraction has 2857 states and 4437 transitions. [2025-02-05 17:42:30,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:42:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4437 transitions. [2025-02-05 17:42:30,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 17:42:30,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:30,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:30,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:42:30,772 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:30,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash 291030893, now seen corresponding path program 1 times [2025-02-05 17:42:30,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:30,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882127836] [2025-02-05 17:42:30,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:30,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:30,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:42:30,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:42:30,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:30,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:30,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:30,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882127836] [2025-02-05 17:42:30,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882127836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:30,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:30,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:42:30,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198390589] [2025-02-05 17:42:30,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:30,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:42:30,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:30,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:42:30,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:30,828 INFO L87 Difference]: Start difference. First operand 2857 states and 4437 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:42:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:30,962 INFO L93 Difference]: Finished difference Result 5040 states and 7611 transitions. [2025-02-05 17:42:30,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:42:30,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-05 17:42:30,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:30,976 INFO L225 Difference]: With dead ends: 5040 [2025-02-05 17:42:30,977 INFO L226 Difference]: Without dead ends: 3853 [2025-02-05 17:42:30,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:30,979 INFO L435 NwaCegarLoop]: 1598 mSDtfsCounter, 1496 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:30,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1669 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:42:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2025-02-05 17:42:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3851. [2025-02-05 17:42:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.5149389451805664) internal successors, (5831), 3850 states have internal predecessors, (5831), 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-02-05 17:42:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5831 transitions. [2025-02-05 17:42:31,075 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5831 transitions. Word has length 60 [2025-02-05 17:42:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:31,075 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 5831 transitions. [2025-02-05 17:42:31,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:42:31,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5831 transitions. [2025-02-05 17:42:31,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 17:42:31,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:31,076 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:31,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:42:31,077 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:31,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:31,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1641812152, now seen corresponding path program 1 times [2025-02-05 17:42:31,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:31,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510366270] [2025-02-05 17:42:31,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:31,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:31,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 17:42:31,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 17:42:31,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:31,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:31,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:31,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510366270] [2025-02-05 17:42:31,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510366270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:31,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:31,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:42:31,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117125379] [2025-02-05 17:42:31,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:31,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:42:31,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:31,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:42:31,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:42:31,219 INFO L87 Difference]: Start difference. First operand 3851 states and 5831 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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-02-05 17:42:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:36,781 INFO L93 Difference]: Finished difference Result 6106 states and 10140 transitions. [2025-02-05 17:42:36,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:42:36,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2025-02-05 17:42:36,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:36,799 INFO L225 Difference]: With dead ends: 6106 [2025-02-05 17:42:36,799 INFO L226 Difference]: Without dead ends: 5353 [2025-02-05 17:42:36,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:42:36,801 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 2407 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2407 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:36,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2407 Valid, 818 Invalid, 6399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-02-05 17:42:36,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5353 states. [2025-02-05 17:42:36,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5353 to 5353. [2025-02-05 17:42:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5353 states, 5351 states have (on average 1.4589796299757054) internal successors, (7807), 5352 states have internal predecessors, (7807), 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-02-05 17:42:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5353 states to 5353 states and 7807 transitions. [2025-02-05 17:42:36,922 INFO L78 Accepts]: Start accepts. Automaton has 5353 states and 7807 transitions. Word has length 63 [2025-02-05 17:42:36,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:36,922 INFO L471 AbstractCegarLoop]: Abstraction has 5353 states and 7807 transitions. [2025-02-05 17:42:36,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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-02-05 17:42:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 5353 states and 7807 transitions. [2025-02-05 17:42:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:42:36,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:36,925 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:36,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:42:36,925 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:36,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:36,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1155468229, now seen corresponding path program 1 times [2025-02-05 17:42:36,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:36,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107709910] [2025-02-05 17:42:36,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:36,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:36,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:42:36,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:42:36,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:36,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:42:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:37,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107709910] [2025-02-05 17:42:37,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107709910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:37,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:37,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:42:37,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945109494] [2025-02-05 17:42:37,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:37,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:42:37,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:37,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:42:37,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:42:37,072 INFO L87 Difference]: Start difference. First operand 5353 states and 7807 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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-02-05 17:42:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:37,514 INFO L93 Difference]: Finished difference Result 21301 states and 30469 transitions. [2025-02-05 17:42:37,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:42:37,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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 77 [2025-02-05 17:42:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:37,570 INFO L225 Difference]: With dead ends: 21301 [2025-02-05 17:42:37,570 INFO L226 Difference]: Without dead ends: 18243 [2025-02-05 17:42:37,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:42:37,579 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 6328 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6328 SdHoareTripleChecker+Valid, 3660 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:37,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6328 Valid, 3660 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:42:37,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18243 states. [2025-02-05 17:42:37,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18243 to 8409. [2025-02-05 17:42:37,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8409 states, 8407 states have (on average 1.4405852265968835) internal successors, (12111), 8408 states have internal predecessors, (12111), 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-02-05 17:42:37,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8409 states to 8409 states and 12111 transitions. [2025-02-05 17:42:37,919 INFO L78 Accepts]: Start accepts. Automaton has 8409 states and 12111 transitions. Word has length 77 [2025-02-05 17:42:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:37,920 INFO L471 AbstractCegarLoop]: Abstraction has 8409 states and 12111 transitions. [2025-02-05 17:42:37,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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-02-05 17:42:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 8409 states and 12111 transitions. [2025-02-05 17:42:37,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:42:37,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:37,923 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:37,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:42:37,923 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:37,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:37,923 INFO L85 PathProgramCache]: Analyzing trace with hash 707522693, now seen corresponding path program 1 times [2025-02-05 17:42:37,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:37,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493684105] [2025-02-05 17:42:37,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:37,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:42:37,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:42:37,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:37,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:42:38,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:38,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493684105] [2025-02-05 17:42:38,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493684105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:38,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:38,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:42:38,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041147798] [2025-02-05 17:42:38,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:38,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:42:38,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:38,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:42:38,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:42:38,088 INFO L87 Difference]: Start difference. First operand 8409 states and 12111 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-02-05 17:42:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:38,488 INFO L93 Difference]: Finished difference Result 24357 states and 34773 transitions. [2025-02-05 17:42:38,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:42:38,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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 77 [2025-02-05 17:42:38,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:38,534 INFO L225 Difference]: With dead ends: 24357 [2025-02-05 17:42:38,535 INFO L226 Difference]: Without dead ends: 21299 [2025-02-05 17:42:38,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:42:38,547 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 6357 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6357 SdHoareTripleChecker+Valid, 3567 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:38,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6357 Valid, 3567 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:42:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21299 states. [2025-02-05 17:42:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21299 to 13001. [2025-02-05 17:42:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13001 states, 12999 states have (on average 1.4252634818062928) internal successors, (18527), 13000 states have internal predecessors, (18527), 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-02-05 17:42:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13001 states to 13001 states and 18527 transitions. [2025-02-05 17:42:38,991 INFO L78 Accepts]: Start accepts. Automaton has 13001 states and 18527 transitions. Word has length 77 [2025-02-05 17:42:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:38,993 INFO L471 AbstractCegarLoop]: Abstraction has 13001 states and 18527 transitions. [2025-02-05 17:42:38,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-02-05 17:42:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 13001 states and 18527 transitions. [2025-02-05 17:42:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:42:38,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:38,996 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:38,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:42:38,997 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:38,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:38,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1122698565, now seen corresponding path program 1 times [2025-02-05 17:42:38,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:38,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139873580] [2025-02-05 17:42:38,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:38,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:39,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:42:39,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:42:39,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:39,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 17:42:39,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:39,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139873580] [2025-02-05 17:42:39,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139873580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:39,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:39,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:42:39,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188331493] [2025-02-05 17:42:39,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:39,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:42:39,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:39,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:42:39,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:42:39,163 INFO L87 Difference]: Start difference. First operand 13001 states and 18527 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-02-05 17:42:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:39,631 INFO L93 Difference]: Finished difference Result 27413 states and 39077 transitions. [2025-02-05 17:42:39,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:42:39,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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 77 [2025-02-05 17:42:39,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:39,684 INFO L225 Difference]: With dead ends: 27413 [2025-02-05 17:42:39,684 INFO L226 Difference]: Without dead ends: 24355 [2025-02-05 17:42:39,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:42:39,699 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 6394 mSDsluCounter, 1970 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6394 SdHoareTripleChecker+Valid, 3577 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:39,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6394 Valid, 3577 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:42:39,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24355 states. [2025-02-05 17:42:40,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24355 to 16057. [2025-02-05 17:42:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16057 states, 16055 states have (on average 1.422049205854874) internal successors, (22831), 16056 states have internal predecessors, (22831), 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-02-05 17:42:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16057 states to 16057 states and 22831 transitions. [2025-02-05 17:42:40,174 INFO L78 Accepts]: Start accepts. Automaton has 16057 states and 22831 transitions. Word has length 77 [2025-02-05 17:42:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:40,175 INFO L471 AbstractCegarLoop]: Abstraction has 16057 states and 22831 transitions. [2025-02-05 17:42:40,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-02-05 17:42:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 16057 states and 22831 transitions. [2025-02-05 17:42:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:42:40,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:40,177 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:40,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:42:40,178 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:40,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:40,178 INFO L85 PathProgramCache]: Analyzing trace with hash 635980293, now seen corresponding path program 1 times [2025-02-05 17:42:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:40,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947530521] [2025-02-05 17:42:40,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:40,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:40,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:42:40,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:42:40,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:40,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 17:42:40,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:40,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947530521] [2025-02-05 17:42:40,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947530521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:40,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:40,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:42:40,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097597057] [2025-02-05 17:42:40,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:40,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:42:40,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:40,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:42:40,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:42:40,346 INFO L87 Difference]: Start difference. First operand 16057 states and 22831 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-02-05 17:42:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:40,883 INFO L93 Difference]: Finished difference Result 30469 states and 43381 transitions. [2025-02-05 17:42:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:42:40,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 77 [2025-02-05 17:42:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:40,942 INFO L225 Difference]: With dead ends: 30469 [2025-02-05 17:42:40,943 INFO L226 Difference]: Without dead ends: 27411 [2025-02-05 17:42:40,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:42:40,954 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 6343 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6343 SdHoareTripleChecker+Valid, 3641 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:40,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6343 Valid, 3641 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:42:40,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27411 states. [2025-02-05 17:42:41,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27411 to 19113. [2025-02-05 17:42:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19113 states, 19111 states have (on average 1.419862906179687) internal successors, (27135), 19112 states have internal predecessors, (27135), 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-02-05 17:42:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19113 states to 19113 states and 27135 transitions. [2025-02-05 17:42:41,394 INFO L78 Accepts]: Start accepts. Automaton has 19113 states and 27135 transitions. Word has length 77 [2025-02-05 17:42:41,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:41,395 INFO L471 AbstractCegarLoop]: Abstraction has 19113 states and 27135 transitions. [2025-02-05 17:42:41,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-02-05 17:42:41,395 INFO L276 IsEmpty]: Start isEmpty. Operand 19113 states and 27135 transitions. [2025-02-05 17:42:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:42:41,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:41,399 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:41,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:42:41,399 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:41,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:41,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1791105029, now seen corresponding path program 1 times [2025-02-05 17:42:41,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:41,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756347144] [2025-02-05 17:42:41,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:41,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:41,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:42:41,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:42:41,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:41,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:42:41,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:41,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756347144] [2025-02-05 17:42:41,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756347144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:41,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:41,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:42:41,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158678340] [2025-02-05 17:42:41,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:41,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:42:41,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:41,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:42:41,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:42:41,554 INFO L87 Difference]: Start difference. First operand 19113 states and 27135 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-02-05 17:42:42,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:42,251 INFO L93 Difference]: Finished difference Result 31765 states and 45253 transitions. [2025-02-05 17:42:42,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:42:42,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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 79 [2025-02-05 17:42:42,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:42,307 INFO L225 Difference]: With dead ends: 31765 [2025-02-05 17:42:42,307 INFO L226 Difference]: Without dead ends: 29587 [2025-02-05 17:42:42,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:42:42,322 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 6326 mSDsluCounter, 2120 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6326 SdHoareTripleChecker+Valid, 3734 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:42,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6326 Valid, 3734 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:42:42,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29587 states. [2025-02-05 17:42:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29587 to 21289. [2025-02-05 17:42:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21289 states, 21287 states have (on average 1.4205383567435523) internal successors, (30239), 21288 states have internal predecessors, (30239), 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-02-05 17:42:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21289 states to 21289 states and 30239 transitions. [2025-02-05 17:42:42,944 INFO L78 Accepts]: Start accepts. Automaton has 21289 states and 30239 transitions. Word has length 79 [2025-02-05 17:42:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:42,944 INFO L471 AbstractCegarLoop]: Abstraction has 21289 states and 30239 transitions. [2025-02-05 17:42:42,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-02-05 17:42:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 21289 states and 30239 transitions. [2025-02-05 17:42:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:42:42,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:42,948 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:42,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:42:42,948 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:42,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash -838885117, now seen corresponding path program 1 times [2025-02-05 17:42:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:42,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580113668] [2025-02-05 17:42:42,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:42,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:42,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:42:42,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:42:42,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:42,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:43,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:43,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580113668] [2025-02-05 17:42:43,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580113668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:43,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:43,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:42:43,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971522013] [2025-02-05 17:42:43,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:43,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:42:43,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:43,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:42:43,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:43,040 INFO L87 Difference]: Start difference. First operand 21289 states and 30239 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-02-05 17:42:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:43,372 INFO L93 Difference]: Finished difference Result 35457 states and 50438 transitions. [2025-02-05 17:42:43,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:42:43,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2025-02-05 17:42:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:43,400 INFO L225 Difference]: With dead ends: 35457 [2025-02-05 17:42:43,400 INFO L226 Difference]: Without dead ends: 16463 [2025-02-05 17:42:43,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:43,418 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 50 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3117 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:43,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3117 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:42:43,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16463 states. [2025-02-05 17:42:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16463 to 16461. [2025-02-05 17:42:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16461 states, 16459 states have (on average 1.4243271158636612) internal successors, (23443), 16460 states have internal predecessors, (23443), 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-02-05 17:42:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16461 states to 16461 states and 23443 transitions. [2025-02-05 17:42:43,777 INFO L78 Accepts]: Start accepts. Automaton has 16461 states and 23443 transitions. Word has length 79 [2025-02-05 17:42:43,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:43,777 INFO L471 AbstractCegarLoop]: Abstraction has 16461 states and 23443 transitions. [2025-02-05 17:42:43,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-02-05 17:42:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 16461 states and 23443 transitions. [2025-02-05 17:42:43,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:42:43,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:43,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:43,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:42:43,780 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:43,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:43,781 INFO L85 PathProgramCache]: Analyzing trace with hash 97319945, now seen corresponding path program 1 times [2025-02-05 17:42:43,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:43,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905024115] [2025-02-05 17:42:43,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:43,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:43,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:42:43,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:42:43,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:43,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:43,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:43,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905024115] [2025-02-05 17:42:43,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905024115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:43,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:43,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:42:43,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585984416] [2025-02-05 17:42:43,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:43,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:42:43,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:43,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:42:43,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:43,878 INFO L87 Difference]: Start difference. First operand 16461 states and 23443 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-02-05 17:42:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:44,032 INFO L93 Difference]: Finished difference Result 23537 states and 33429 transitions. [2025-02-05 17:42:44,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:42:44,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2025-02-05 17:42:44,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:44,052 INFO L225 Difference]: With dead ends: 23537 [2025-02-05 17:42:44,052 INFO L226 Difference]: Without dead ends: 9391 [2025-02-05 17:42:44,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:44,066 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 45 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3102 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:44,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3102 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:42:44,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9391 states. [2025-02-05 17:42:44,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9391 to 9389. [2025-02-05 17:42:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9389 states, 9387 states have (on average 1.4227122616384362) internal successors, (13355), 9388 states have internal predecessors, (13355), 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-02-05 17:42:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9389 states to 9389 states and 13355 transitions. [2025-02-05 17:42:44,252 INFO L78 Accepts]: Start accepts. Automaton has 9389 states and 13355 transitions. Word has length 80 [2025-02-05 17:42:44,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:44,252 INFO L471 AbstractCegarLoop]: Abstraction has 9389 states and 13355 transitions. [2025-02-05 17:42:44,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-02-05 17:42:44,253 INFO L276 IsEmpty]: Start isEmpty. Operand 9389 states and 13355 transitions. [2025-02-05 17:42:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 17:42:44,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:44,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:44,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:42:44,256 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:44,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:44,256 INFO L85 PathProgramCache]: Analyzing trace with hash -755676880, now seen corresponding path program 1 times [2025-02-05 17:42:44,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:44,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359956071] [2025-02-05 17:42:44,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:44,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:44,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 17:42:44,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 17:42:44,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:44,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:44,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:44,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359956071] [2025-02-05 17:42:44,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359956071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:44,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:44,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:42:44,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241626384] [2025-02-05 17:42:44,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:44,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:42:44,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:44,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:42:44,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:44,346 INFO L87 Difference]: Start difference. First operand 9389 states and 13355 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-02-05 17:42:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:44,433 INFO L93 Difference]: Finished difference Result 12929 states and 18297 transitions. [2025-02-05 17:42:44,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:42:44,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 82 [2025-02-05 17:42:44,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:44,442 INFO L225 Difference]: With dead ends: 12929 [2025-02-05 17:42:44,442 INFO L226 Difference]: Without dead ends: 5855 [2025-02-05 17:42:44,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:44,450 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 42 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3087 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:44,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3087 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:42:44,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2025-02-05 17:42:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 5853. [2025-02-05 17:42:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 5851 states have (on average 1.4293283199453084) internal successors, (8363), 5852 states have internal predecessors, (8363), 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-02-05 17:42:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 8363 transitions. [2025-02-05 17:42:44,603 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 8363 transitions. Word has length 82 [2025-02-05 17:42:44,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:44,603 INFO L471 AbstractCegarLoop]: Abstraction has 5853 states and 8363 transitions. [2025-02-05 17:42:44,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-02-05 17:42:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 8363 transitions. [2025-02-05 17:42:44,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 17:42:44,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:44,605 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:44,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:42:44,606 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:44,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1816537225, now seen corresponding path program 1 times [2025-02-05 17:42:44,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:44,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526364156] [2025-02-05 17:42:44,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:44,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:44,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 17:42:44,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 17:42:44,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:44,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:44,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:44,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526364156] [2025-02-05 17:42:44,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526364156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:44,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:44,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:42:44,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883999857] [2025-02-05 17:42:44,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:44,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:42:44,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:44,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:42:44,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:44,692 INFO L87 Difference]: Start difference. First operand 5853 states and 8363 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-02-05 17:42:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:44,747 INFO L93 Difference]: Finished difference Result 7625 states and 10809 transitions. [2025-02-05 17:42:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:42:44,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 84 [2025-02-05 17:42:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:44,755 INFO L225 Difference]: With dead ends: 7625 [2025-02-05 17:42:44,756 INFO L226 Difference]: Without dead ends: 4087 [2025-02-05 17:42:44,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:44,762 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 39 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3072 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:44,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3072 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:42:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4087 states. [2025-02-05 17:42:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4087 to 4085. [2025-02-05 17:42:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4085 states, 4083 states have (on average 1.4433014939995101) internal successors, (5893), 4084 states have internal predecessors, (5893), 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-02-05 17:42:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 5893 transitions. [2025-02-05 17:42:44,827 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 5893 transitions. Word has length 84 [2025-02-05 17:42:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:44,828 INFO L471 AbstractCegarLoop]: Abstraction has 4085 states and 5893 transitions. [2025-02-05 17:42:44,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-02-05 17:42:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 5893 transitions. [2025-02-05 17:42:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 17:42:44,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:44,829 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:44,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:42:44,830 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:44,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:44,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1212344610, now seen corresponding path program 1 times [2025-02-05 17:42:44,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:44,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133043858] [2025-02-05 17:42:44,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:44,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:44,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 17:42:44,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 17:42:44,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:44,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:44,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:44,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133043858] [2025-02-05 17:42:44,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133043858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:42:44,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:42:44,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:42:44,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387106208] [2025-02-05 17:42:44,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:42:44,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:42:44,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:44,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:42:44,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:44,919 INFO L87 Difference]: Start difference. First operand 4085 states and 5893 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-02-05 17:42:44,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:44,957 INFO L93 Difference]: Finished difference Result 4973 states and 7104 transitions. [2025-02-05 17:42:44,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:42:44,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 86 [2025-02-05 17:42:44,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:44,966 INFO L225 Difference]: With dead ends: 4973 [2025-02-05 17:42:44,966 INFO L226 Difference]: Without dead ends: 3203 [2025-02-05 17:42:44,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:42:44,969 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 36 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3057 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:44,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3057 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:42:44,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3203 states. [2025-02-05 17:42:45,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3203 to 3201. [2025-02-05 17:42:45,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3199 states have (on average 1.4601437949359175) internal successors, (4671), 3200 states have internal predecessors, (4671), 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-02-05 17:42:45,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4671 transitions. [2025-02-05 17:42:45,016 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4671 transitions. Word has length 86 [2025-02-05 17:42:45,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:45,016 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 4671 transitions. [2025-02-05 17:42:45,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-02-05 17:42:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4671 transitions. [2025-02-05 17:42:45,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 17:42:45,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:45,017 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:45,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:42:45,018 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:45,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:45,018 INFO L85 PathProgramCache]: Analyzing trace with hash -705464475, now seen corresponding path program 1 times [2025-02-05 17:42:45,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:45,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762974546] [2025-02-05 17:42:45,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:45,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:45,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 17:42:45,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 17:42:45,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:45,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:45,832 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:45,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:45,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762974546] [2025-02-05 17:42:45,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762974546] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:42:45,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448574366] [2025-02-05 17:42:45,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:45,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:42:45,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:42:45,836 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:42:45,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:42:45,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 17:42:45,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 17:42:45,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:45,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:45,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 17:42:45,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:42:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:46,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:42:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:46,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448574366] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:42:46,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:42:46,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-02-05 17:42:46,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553782112] [2025-02-05 17:42:46,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:42:46,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 17:42:46,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:46,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 17:42:46,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-02-05 17:42:46,722 INFO L87 Difference]: Start difference. First operand 3201 states and 4671 transitions. Second operand has 22 states, 22 states have (on average 11.409090909090908) internal successors, (251), 22 states have internal predecessors, (251), 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-02-05 17:42:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:50,584 INFO L93 Difference]: Finished difference Result 11153 states and 15252 transitions. [2025-02-05 17:42:50,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-02-05 17:42:50,585 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 11.409090909090908) internal successors, (251), 22 states have internal predecessors, (251), 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 88 [2025-02-05 17:42:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:50,603 INFO L225 Difference]: With dead ends: 11153 [2025-02-05 17:42:50,603 INFO L226 Difference]: Without dead ends: 10181 [2025-02-05 17:42:50,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2849 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1313, Invalid=7243, Unknown=0, NotChecked=0, Total=8556 [2025-02-05 17:42:50,610 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 15198 mSDsluCounter, 9596 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15198 SdHoareTripleChecker+Valid, 11135 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:50,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15198 Valid, 11135 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1940 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 17:42:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10181 states. [2025-02-05 17:42:50,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10181 to 9571. [2025-02-05 17:42:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9571 states, 9569 states have (on average 1.3572996133347268) internal successors, (12988), 9570 states have internal predecessors, (12988), 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-02-05 17:42:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9571 states to 9571 states and 12988 transitions. [2025-02-05 17:42:50,820 INFO L78 Accepts]: Start accepts. Automaton has 9571 states and 12988 transitions. Word has length 88 [2025-02-05 17:42:50,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:50,820 INFO L471 AbstractCegarLoop]: Abstraction has 9571 states and 12988 transitions. [2025-02-05 17:42:50,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.409090909090908) internal successors, (251), 22 states have internal predecessors, (251), 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-02-05 17:42:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 9571 states and 12988 transitions. [2025-02-05 17:42:50,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 17:42:50,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:50,822 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:50,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:42:51,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-05 17:42:51,026 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:51,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:51,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1536780076, now seen corresponding path program 1 times [2025-02-05 17:42:51,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:51,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986001677] [2025-02-05 17:42:51,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:51,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:51,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:42:51,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:42:51,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:51,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:51,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:51,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986001677] [2025-02-05 17:42:51,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986001677] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:42:51,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337454670] [2025-02-05 17:42:51,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:51,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:42:51,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:42:51,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:42:51,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 17:42:51,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:42:51,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:42:51,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:51,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:51,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 17:42:51,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:42:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:52,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:42:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:52,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337454670] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:42:52,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:42:52,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-02-05 17:42:52,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086651312] [2025-02-05 17:42:52,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:42:52,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 17:42:52,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:52,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 17:42:52,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2025-02-05 17:42:52,887 INFO L87 Difference]: Start difference. First operand 9571 states and 12988 transitions. Second operand has 29 states, 29 states have (on average 7.551724137931035) internal successors, (219), 29 states have internal predecessors, (219), 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-02-05 17:42:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:53,735 INFO L93 Difference]: Finished difference Result 24405 states and 32513 transitions. [2025-02-05 17:42:53,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 17:42:53,735 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.551724137931035) internal successors, (219), 29 states have internal predecessors, (219), 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 89 [2025-02-05 17:42:53,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:53,758 INFO L225 Difference]: With dead ends: 24405 [2025-02-05 17:42:53,759 INFO L226 Difference]: Without dead ends: 17223 [2025-02-05 17:42:53,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=437, Invalid=1455, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 17:42:53,770 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 10663 mSDsluCounter, 6464 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10663 SdHoareTripleChecker+Valid, 7987 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:53,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10663 Valid, 7987 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:42:53,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17223 states. [2025-02-05 17:42:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17223 to 17059. [2025-02-05 17:42:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17059 states, 17057 states have (on average 1.3236208008442283) internal successors, (22577), 17058 states have internal predecessors, (22577), 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-02-05 17:42:54,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17059 states to 17059 states and 22577 transitions. [2025-02-05 17:42:54,206 INFO L78 Accepts]: Start accepts. Automaton has 17059 states and 22577 transitions. Word has length 89 [2025-02-05 17:42:54,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:54,206 INFO L471 AbstractCegarLoop]: Abstraction has 17059 states and 22577 transitions. [2025-02-05 17:42:54,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.551724137931035) internal successors, (219), 29 states have internal predecessors, (219), 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-02-05 17:42:54,206 INFO L276 IsEmpty]: Start isEmpty. Operand 17059 states and 22577 transitions. [2025-02-05 17:42:54,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 17:42:54,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:54,208 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:54,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 17:42:54,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:42:54,408 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:54,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:54,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1731525900, now seen corresponding path program 1 times [2025-02-05 17:42:54,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:54,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676824002] [2025-02-05 17:42:54,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:54,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:54,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:42:54,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:42:54,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:54,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:54,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:54,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676824002] [2025-02-05 17:42:54,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676824002] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:42:54,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228229590] [2025-02-05 17:42:54,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:54,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:42:54,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:42:54,700 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:42:54,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 17:42:54,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:42:54,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:42:54,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:54,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:54,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:42:54,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:42:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:55,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:42:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:55,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228229590] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:42:55,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:42:55,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-02-05 17:42:55,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130895759] [2025-02-05 17:42:55,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:42:55,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 17:42:55,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:42:55,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 17:42:55,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-02-05 17:42:55,995 INFO L87 Difference]: Start difference. First operand 17059 states and 22577 transitions. Second operand has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 25 states have internal predecessors, (245), 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-02-05 17:42:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:42:57,886 INFO L93 Difference]: Finished difference Result 48303 states and 63185 transitions. [2025-02-05 17:42:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-05 17:42:57,887 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 25 states have internal predecessors, (245), 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 89 [2025-02-05 17:42:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:42:57,921 INFO L225 Difference]: With dead ends: 48303 [2025-02-05 17:42:57,921 INFO L226 Difference]: Without dead ends: 33703 [2025-02-05 17:42:57,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=656, Invalid=2536, Unknown=0, NotChecked=0, Total=3192 [2025-02-05 17:42:57,932 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 18773 mSDsluCounter, 6929 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18773 SdHoareTripleChecker+Valid, 8494 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:42:57,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18773 Valid, 8494 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:42:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33703 states. [2025-02-05 17:42:58,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33703 to 29683. [2025-02-05 17:42:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29683 states, 29681 states have (on average 1.2881641454128905) internal successors, (38234), 29682 states have internal predecessors, (38234), 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-02-05 17:42:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29683 states to 29683 states and 38234 transitions. [2025-02-05 17:42:58,967 INFO L78 Accepts]: Start accepts. Automaton has 29683 states and 38234 transitions. Word has length 89 [2025-02-05 17:42:58,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:42:58,967 INFO L471 AbstractCegarLoop]: Abstraction has 29683 states and 38234 transitions. [2025-02-05 17:42:58,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 25 states have internal predecessors, (245), 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-02-05 17:42:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand 29683 states and 38234 transitions. [2025-02-05 17:42:58,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:42:58,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:42:58,970 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:42:58,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 17:42:59,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:42:59,171 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:42:59,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:42:59,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1758561150, now seen corresponding path program 1 times [2025-02-05 17:42:59,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:42:59,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838739154] [2025-02-05 17:42:59,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:59,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:42:59,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:42:59,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:42:59,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:59,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:42:59,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:42:59,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838739154] [2025-02-05 17:42:59,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838739154] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:42:59,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039632831] [2025-02-05 17:42:59,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:42:59,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:42:59,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:42:59,590 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:42:59,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 17:42:59,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:42:59,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:42:59,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:42:59,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:42:59,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:42:59,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:43:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:00,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:43:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:00,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039632831] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:43:00,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:43:00,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-02-05 17:43:00,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327682580] [2025-02-05 17:43:00,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:43:00,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 17:43:00,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:00,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 17:43:00,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2025-02-05 17:43:00,890 INFO L87 Difference]: Start difference. First operand 29683 states and 38234 transitions. Second operand has 22 states, 22 states have (on average 8.636363636363637) internal successors, (190), 21 states have internal predecessors, (190), 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-02-05 17:43:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:02,446 INFO L93 Difference]: Finished difference Result 83069 states and 105983 transitions. [2025-02-05 17:43:02,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 17:43:02,447 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.636363636363637) internal successors, (190), 21 states have internal predecessors, (190), 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 90 [2025-02-05 17:43:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:02,503 INFO L225 Difference]: With dead ends: 83069 [2025-02-05 17:43:02,503 INFO L226 Difference]: Without dead ends: 56663 [2025-02-05 17:43:02,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2025-02-05 17:43:02,518 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 12223 mSDsluCounter, 3318 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12223 SdHoareTripleChecker+Valid, 4831 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:02,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12223 Valid, 4831 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:43:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56663 states. [2025-02-05 17:43:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56663 to 56659. [2025-02-05 17:43:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56659 states, 56657 states have (on average 1.2730112783945498) internal successors, (72125), 56658 states have internal predecessors, (72125), 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-02-05 17:43:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56659 states to 56659 states and 72125 transitions. [2025-02-05 17:43:04,342 INFO L78 Accepts]: Start accepts. Automaton has 56659 states and 72125 transitions. Word has length 90 [2025-02-05 17:43:04,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:04,343 INFO L471 AbstractCegarLoop]: Abstraction has 56659 states and 72125 transitions. [2025-02-05 17:43:04,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.636363636363637) internal successors, (190), 21 states have internal predecessors, (190), 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-02-05 17:43:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand 56659 states and 72125 transitions. [2025-02-05 17:43:04,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:43:04,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:04,346 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:04,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 17:43:04,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-05 17:43:04,546 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:04,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:04,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1872225329, now seen corresponding path program 1 times [2025-02-05 17:43:04,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:04,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552223781] [2025-02-05 17:43:04,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:04,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:04,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:43:04,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:43:04,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:04,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:05,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:05,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552223781] [2025-02-05 17:43:05,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552223781] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:43:05,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100349312] [2025-02-05 17:43:05,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:05,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:43:05,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:43:05,016 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:43:05,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 17:43:05,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:43:05,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:43:05,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:05,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:05,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 17:43:05,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:43:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:06,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:43:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:07,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100349312] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:43:07,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:43:07,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2025-02-05 17:43:07,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601610475] [2025-02-05 17:43:07,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:43:07,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 17:43:07,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:07,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 17:43:07,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2025-02-05 17:43:07,190 INFO L87 Difference]: Start difference. First operand 56659 states and 72125 transitions. Second operand has 30 states, 30 states have (on average 8.433333333333334) internal successors, (253), 30 states have internal predecessors, (253), 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-02-05 17:43:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:12,741 INFO L93 Difference]: Finished difference Result 174335 states and 222063 transitions. [2025-02-05 17:43:12,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-05 17:43:12,741 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.433333333333334) internal successors, (253), 30 states have internal predecessors, (253), 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 91 [2025-02-05 17:43:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:12,887 INFO L225 Difference]: With dead ends: 174335 [2025-02-05 17:43:12,887 INFO L226 Difference]: Without dead ends: 122773 [2025-02-05 17:43:12,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=816, Invalid=3606, Unknown=0, NotChecked=0, Total=4422 [2025-02-05 17:43:12,923 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 19973 mSDsluCounter, 14020 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19973 SdHoareTripleChecker+Valid, 15532 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:12,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19973 Valid, 15532 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:43:12,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122773 states. [2025-02-05 17:43:16,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122773 to 78355. [2025-02-05 17:43:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78355 states, 78353 states have (on average 1.2587265324875883) internal successors, (98625), 78354 states have internal predecessors, (98625), 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-02-05 17:43:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78355 states to 78355 states and 98625 transitions. [2025-02-05 17:43:16,428 INFO L78 Accepts]: Start accepts. Automaton has 78355 states and 98625 transitions. Word has length 91 [2025-02-05 17:43:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:16,429 INFO L471 AbstractCegarLoop]: Abstraction has 78355 states and 98625 transitions. [2025-02-05 17:43:16,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.433333333333334) internal successors, (253), 30 states have internal predecessors, (253), 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-02-05 17:43:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 78355 states and 98625 transitions. [2025-02-05 17:43:16,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 17:43:16,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:16,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:16,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 17:43:16,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-05 17:43:16,631 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:16,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:16,632 INFO L85 PathProgramCache]: Analyzing trace with hash -201120643, now seen corresponding path program 1 times [2025-02-05 17:43:16,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:16,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350867931] [2025-02-05 17:43:16,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:16,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:16,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 17:43:16,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 17:43:16,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:16,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350867931] [2025-02-05 17:43:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350867931] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:43:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925115811] [2025-02-05 17:43:19,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:19,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:43:19,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:43:19,232 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:43:19,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 17:43:19,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 17:43:19,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 17:43:19,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:19,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:19,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-05 17:43:19,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:43:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:23,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:43:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:25,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925115811] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:43:25,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:43:25,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20, 17] total 64 [2025-02-05 17:43:25,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74302177] [2025-02-05 17:43:25,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:43:25,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-02-05 17:43:25,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:25,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-02-05 17:43:25,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=3740, Unknown=0, NotChecked=0, Total=4032 [2025-02-05 17:43:25,610 INFO L87 Difference]: Start difference. First operand 78355 states and 98625 transitions. Second operand has 64 states, 64 states have (on average 3.890625) internal successors, (249), 64 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)