./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-back-serstep.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-back-serstep.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash d40980d2c8614c94b54cd9b1a78f16d5c08e5a02579fe7ca6623a61adbb8dfb6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 18:05:29,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 18:05:29,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 18:05:29,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 18:05:29,194 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 18:05:29,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 18:05:29,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 18:05:29,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 18:05:29,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 18:05:29,227 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 18:05:29,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 18:05:29,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 18:05:29,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 18:05:29,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 18:05:29,230 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 18:05:29,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 18:05:29,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 18:05:29,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 18:05:29,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 18:05:29,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 18:05:29,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 18:05:29,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 18:05:29,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 18:05:29,232 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 18:05:29,232 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 18:05:29,232 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 18:05:29,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 18:05:29,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 18:05:29,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 18:05:29,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:05:29,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 18:05:29,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 18:05:29,233 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 18:05:29,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 18:05:29,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 18:05:29,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 18:05:29,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 18:05:29,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 18:05:29,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 18:05:29,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 18:05:29,234 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d40980d2c8614c94b54cd9b1a78f16d5c08e5a02579fe7ca6623a61adbb8dfb6 [2025-02-05 18:05:29,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 18:05:29,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 18:05:29,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 18:05:29,553 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 18:05:29,554 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 18:05:29,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-back-serstep.c [2025-02-05 18:05:30,935 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/679dbb2c8/7990a51ed373418fa174e38be0ffc158/FLAGcc17230f3 [2025-02-05 18:05:31,321 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 18:05:31,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-back-serstep.c [2025-02-05 18:05:31,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/679dbb2c8/7990a51ed373418fa174e38be0ffc158/FLAGcc17230f3 [2025-02-05 18:05:31,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/679dbb2c8/7990a51ed373418fa174e38be0ffc158 [2025-02-05 18:05:31,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 18:05:31,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 18:05:31,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 18:05:31,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 18:05:31,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 18:05:31,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:05:31" (1/1) ... [2025-02-05 18:05:31,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2385ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:31, skipping insertion in model container [2025-02-05 18:05:31,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:05:31" (1/1) ... [2025-02-05 18:05:31,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 18:05:31,574 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/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-back-serstep.c[1174,1187] [2025-02-05 18:05:31,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:05:31,773 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 18:05:31,782 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/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-back-serstep.c[1174,1187] [2025-02-05 18:05:31,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:05:31,907 INFO L204 MainTranslator]: Completed translation [2025-02-05 18:05:31,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:31 WrapperNode [2025-02-05 18:05:31,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 18:05:31,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 18:05:31,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 18:05:31,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 18:05:31,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:31" (1/1) ... [2025-02-05 18:05:31,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:31" (1/1) ... [2025-02-05 18:05:32,137 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1948 [2025-02-05 18:05:32,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 18:05:32,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 18:05:32,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 18:05:32,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 18:05:32,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:31" (1/1) ... [2025-02-05 18:05:32,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:31" (1/1) ... [2025-02-05 18:05:32,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:31" (1/1) ... [2025-02-05 18:05:32,297 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 18:05:32,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:31" (1/1) ... [2025-02-05 18:05:32,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:31" (1/1) ... [2025-02-05 18:05:32,445 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:31" (1/1) ... [2025-02-05 18:05:32,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:31" (1/1) ... [2025-02-05 18:05:32,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:31" (1/1) ... [2025-02-05 18:05:32,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:31" (1/1) ... [2025-02-05 18:05:32,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 18:05:32,536 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 18:05:32,537 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 18:05:32,537 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 18:05:32,538 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:31" (1/1) ... [2025-02-05 18:05:32,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:05:32,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:32,578 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 18:05:32,584 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 18:05:32,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 18:05:32,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 18:05:32,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 18:05:32,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 18:05:32,842 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 18:05:32,843 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 18:05:35,546 INFO L? ?]: Removed 993 outVars from TransFormulas that were not future-live. [2025-02-05 18:05:35,546 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 18:05:35,678 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 18:05:35,682 INFO L337 CfgBuilder]: Removed 4 assume(true) statements. [2025-02-05 18:05:35,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:05:35 BoogieIcfgContainer [2025-02-05 18:05:35,683 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 18:05:35,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 18:05:35,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 18:05:35,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 18:05:35,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:05:31" (1/3) ... [2025-02-05 18:05:35,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307d7b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:05:35, skipping insertion in model container [2025-02-05 18:05:35,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:31" (2/3) ... [2025-02-05 18:05:35,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307d7b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:05:35, skipping insertion in model container [2025-02-05 18:05:35,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:05:35" (3/3) ... [2025-02-05 18:05:35,696 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.1.prop1-back-serstep.c [2025-02-05 18:05:35,716 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 18:05:35,720 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.adding.1.prop1-back-serstep.c that has 1 procedures, 686 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 18:05:35,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 18:05:35,824 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;@2674942a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 18:05:35,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 18:05:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 686 states, 684 states have (on average 1.5014619883040936) internal successors, (1027), 685 states have internal predecessors, (1027), 0 states have call successors, (0), 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 18:05:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 18:05:35,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:35,847 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, 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 18:05:35,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:35,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:35,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1723089930, now seen corresponding path program 1 times [2025-02-05 18:05:35,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:35,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87167222] [2025-02-05 18:05:35,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:35,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:35,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 18:05:36,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 18:05:36,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:36,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:36,830 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 18:05:36,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:36,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87167222] [2025-02-05 18:05:36,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87167222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:36,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:36,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:36,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256376897] [2025-02-05 18:05:36,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:36,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:36,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:36,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:36,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:36,863 INFO L87 Difference]: Start difference. First operand has 686 states, 684 states have (on average 1.5014619883040936) internal successors, (1027), 685 states have internal predecessors, (1027), 0 states have call successors, (0), 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 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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 18:05:37,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:37,388 INFO L93 Difference]: Finished difference Result 1325 states and 1987 transitions. [2025-02-05 18:05:37,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:37,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-02-05 18:05:37,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:37,404 INFO L225 Difference]: With dead ends: 1325 [2025-02-05 18:05:37,405 INFO L226 Difference]: Without dead ends: 685 [2025-02-05 18:05:37,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:37,413 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:37,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2548 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:05:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-02-05 18:05:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2025-02-05 18:05:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 684 states have (on average 1.4985380116959064) internal successors, (1025), 684 states have internal predecessors, (1025), 0 states have call successors, (0), 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 18:05:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1025 transitions. [2025-02-05 18:05:37,486 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1025 transitions. Word has length 85 [2025-02-05 18:05:37,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:37,489 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1025 transitions. [2025-02-05 18:05:37,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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 18:05:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1025 transitions. [2025-02-05 18:05:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 18:05:37,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:37,495 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, 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 18:05:37,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 18:05:37,498 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:37,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1880860329, now seen corresponding path program 1 times [2025-02-05 18:05:37,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:37,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315440175] [2025-02-05 18:05:37,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:37,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:37,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 18:05:37,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 18:05:37,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:37,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:37,806 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 18:05:37,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:37,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315440175] [2025-02-05 18:05:37,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315440175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:37,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:37,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:37,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230632171] [2025-02-05 18:05:37,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:37,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:37,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:37,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:37,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:37,810 INFO L87 Difference]: Start difference. First operand 685 states and 1025 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 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 18:05:38,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:38,224 INFO L93 Difference]: Finished difference Result 1326 states and 1985 transitions. [2025-02-05 18:05:38,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:38,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 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 18:05:38,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:38,227 INFO L225 Difference]: With dead ends: 1326 [2025-02-05 18:05:38,228 INFO L226 Difference]: Without dead ends: 687 [2025-02-05 18:05:38,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:38,232 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:38,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2545 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:05:38,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-02-05 18:05:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2025-02-05 18:05:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 1.4970845481049562) internal successors, (1027), 686 states have internal predecessors, (1027), 0 states have call successors, (0), 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 18:05:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1027 transitions. [2025-02-05 18:05:38,261 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1027 transitions. Word has length 86 [2025-02-05 18:05:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:38,263 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1027 transitions. [2025-02-05 18:05:38,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 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 18:05:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1027 transitions. [2025-02-05 18:05:38,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 18:05:38,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:38,266 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, 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 18:05:38,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 18:05:38,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:38,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:38,273 INFO L85 PathProgramCache]: Analyzing trace with hash 108638181, now seen corresponding path program 1 times [2025-02-05 18:05:38,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:38,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035277406] [2025-02-05 18:05:38,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:38,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:38,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 18:05:38,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 18:05:38,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:38,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:38,582 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 18:05:38,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:38,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035277406] [2025-02-05 18:05:38,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035277406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:38,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:38,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:38,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583228006] [2025-02-05 18:05:38,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:38,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:38,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:38,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:38,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:38,587 INFO L87 Difference]: Start difference. First operand 687 states and 1027 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 18:05:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:38,941 INFO L93 Difference]: Finished difference Result 1330 states and 1989 transitions. [2025-02-05 18:05:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:38,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-02-05 18:05:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:38,944 INFO L225 Difference]: With dead ends: 1330 [2025-02-05 18:05:38,945 INFO L226 Difference]: Without dead ends: 689 [2025-02-05 18:05:38,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:38,946 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:38,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2545 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:38,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-02-05 18:05:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2025-02-05 18:05:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.495639534883721) internal successors, (1029), 688 states have internal predecessors, (1029), 0 states have call successors, (0), 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 18:05:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1029 transitions. [2025-02-05 18:05:38,966 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1029 transitions. Word has length 87 [2025-02-05 18:05:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:38,966 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1029 transitions. [2025-02-05 18:05:38,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 18:05:38,967 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1029 transitions. [2025-02-05 18:05:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 18:05:38,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:38,972 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, 1, 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 18:05:38,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 18:05:38,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:38,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:38,973 INFO L85 PathProgramCache]: Analyzing trace with hash 961179726, now seen corresponding path program 1 times [2025-02-05 18:05:38,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:38,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183691238] [2025-02-05 18:05:38,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:38,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:39,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 18:05:39,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 18:05:39,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:39,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:39,276 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 18:05:39,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:39,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183691238] [2025-02-05 18:05:39,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183691238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:39,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:39,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:05:39,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201829061] [2025-02-05 18:05:39,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:39,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:05:39,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:39,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:05:39,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:05:39,282 INFO L87 Difference]: Start difference. First operand 689 states and 1029 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 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 18:05:40,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:40,025 INFO L93 Difference]: Finished difference Result 1961 states and 2932 transitions. [2025-02-05 18:05:40,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:05:40,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 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 18:05:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:40,032 INFO L225 Difference]: With dead ends: 1961 [2025-02-05 18:05:40,032 INFO L226 Difference]: Without dead ends: 1318 [2025-02-05 18:05:40,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:05:40,035 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 927 mSDsluCounter, 3330 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 4179 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:40,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 4179 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:05:40,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-02-05 18:05:40,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 797. [2025-02-05 18:05:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 1.4962311557788945) internal successors, (1191), 796 states have internal predecessors, (1191), 0 states have call successors, (0), 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 18:05:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1191 transitions. [2025-02-05 18:05:40,065 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1191 transitions. Word has length 88 [2025-02-05 18:05:40,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:40,066 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1191 transitions. [2025-02-05 18:05:40,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 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 18:05:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1191 transitions. [2025-02-05 18:05:40,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-02-05 18:05:40,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:40,076 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:40,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 18:05:40,077 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:40,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:40,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1710675479, now seen corresponding path program 1 times [2025-02-05 18:05:40,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:40,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551022154] [2025-02-05 18:05:40,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:40,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-02-05 18:05:40,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-02-05 18:05:40,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:40,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:05:41,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:41,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551022154] [2025-02-05 18:05:41,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551022154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:41,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:41,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 18:05:41,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946187630] [2025-02-05 18:05:41,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:41,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 18:05:41,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:41,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 18:05:41,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 18:05:41,111 INFO L87 Difference]: Start difference. First operand 797 states and 1191 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:05:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:41,383 INFO L93 Difference]: Finished difference Result 1441 states and 2154 transitions. [2025-02-05 18:05:41,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 18:05:41,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 393 [2025-02-05 18:05:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:41,389 INFO L225 Difference]: With dead ends: 1441 [2025-02-05 18:05:41,390 INFO L226 Difference]: Without dead ends: 798 [2025-02-05 18:05:41,391 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 18:05:41,392 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 0 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:41,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1699 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:05:41,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-02-05 18:05:41,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2025-02-05 18:05:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 1.4956085319949812) internal successors, (1192), 797 states have internal predecessors, (1192), 0 states have call successors, (0), 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 18:05:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1192 transitions. [2025-02-05 18:05:41,418 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1192 transitions. Word has length 393 [2025-02-05 18:05:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:41,418 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1192 transitions. [2025-02-05 18:05:41,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:05:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1192 transitions. [2025-02-05 18:05:41,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-02-05 18:05:41,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:41,429 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:41,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 18:05:41,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:41,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:41,431 INFO L85 PathProgramCache]: Analyzing trace with hash 12830968, now seen corresponding path program 1 times [2025-02-05 18:05:41,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:41,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330950972] [2025-02-05 18:05:41,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:41,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:41,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-02-05 18:05:41,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-02-05 18:05:41,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:41,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:05:42,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:42,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330950972] [2025-02-05 18:05:42,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330950972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:42,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:42,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 18:05:42,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367704318] [2025-02-05 18:05:42,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:42,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 18:05:42,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:42,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 18:05:42,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 18:05:42,273 INFO L87 Difference]: Start difference. First operand 798 states and 1192 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:05:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:42,542 INFO L93 Difference]: Finished difference Result 1443 states and 2156 transitions. [2025-02-05 18:05:42,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 18:05:42,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 393 [2025-02-05 18:05:42,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:42,546 INFO L225 Difference]: With dead ends: 1443 [2025-02-05 18:05:42,547 INFO L226 Difference]: Without dead ends: 799 [2025-02-05 18:05:42,548 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 18:05:42,549 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 0 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:42,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1699 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:05:42,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-02-05 18:05:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2025-02-05 18:05:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.494987468671679) internal successors, (1193), 798 states have internal predecessors, (1193), 0 states have call successors, (0), 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 18:05:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1193 transitions. [2025-02-05 18:05:42,593 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1193 transitions. Word has length 393 [2025-02-05 18:05:42,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:42,594 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1193 transitions. [2025-02-05 18:05:42,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:05:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1193 transitions. [2025-02-05 18:05:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-02-05 18:05:42,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:42,602 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:42,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 18:05:42,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:42,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1470923623, now seen corresponding path program 1 times [2025-02-05 18:05:42,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:42,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734515314] [2025-02-05 18:05:42,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:42,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:42,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-02-05 18:05:42,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-02-05 18:05:42,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:42,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:05:43,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:43,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734515314] [2025-02-05 18:05:43,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734515314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:43,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:43,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 18:05:43,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916816259] [2025-02-05 18:05:43,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:43,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 18:05:43,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:43,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 18:05:43,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 18:05:43,453 INFO L87 Difference]: Start difference. First operand 799 states and 1193 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:05:43,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:43,718 INFO L93 Difference]: Finished difference Result 1445 states and 2158 transitions. [2025-02-05 18:05:43,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 18:05:43,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 393 [2025-02-05 18:05:43,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:43,722 INFO L225 Difference]: With dead ends: 1445 [2025-02-05 18:05:43,723 INFO L226 Difference]: Without dead ends: 800 [2025-02-05 18:05:43,724 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 18:05:43,726 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 0 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:43,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1699 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:05:43,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-02-05 18:05:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2025-02-05 18:05:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 1.4943679599499373) internal successors, (1194), 799 states have internal predecessors, (1194), 0 states have call successors, (0), 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 18:05:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1194 transitions. [2025-02-05 18:05:43,748 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1194 transitions. Word has length 393 [2025-02-05 18:05:43,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:43,749 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1194 transitions. [2025-02-05 18:05:43,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:05:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1194 transitions. [2025-02-05 18:05:43,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-02-05 18:05:43,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:43,757 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:43,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 18:05:43,757 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:43,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:43,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2098614790, now seen corresponding path program 1 times [2025-02-05 18:05:43,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:43,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715180585] [2025-02-05 18:05:43,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:43,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:43,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-02-05 18:05:43,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-02-05 18:05:43,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:43,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 18:05:44,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:44,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715180585] [2025-02-05 18:05:44,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715180585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:44,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:44,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:44,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096213617] [2025-02-05 18:05:44,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:44,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:44,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:44,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:44,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:44,672 INFO L87 Difference]: Start difference. First operand 800 states and 1194 transitions. Second operand has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 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 18:05:45,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:45,025 INFO L93 Difference]: Finished difference Result 1452 states and 2167 transitions. [2025-02-05 18:05:45,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:45,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 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 393 [2025-02-05 18:05:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:45,030 INFO L225 Difference]: With dead ends: 1452 [2025-02-05 18:05:45,030 INFO L226 Difference]: Without dead ends: 804 [2025-02-05 18:05:45,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:45,032 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:45,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2545 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-02-05 18:05:45,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 802. [2025-02-05 18:05:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 801 states have (on average 1.4931335830212236) internal successors, (1196), 801 states have internal predecessors, (1196), 0 states have call successors, (0), 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 18:05:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1196 transitions. [2025-02-05 18:05:45,053 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1196 transitions. Word has length 393 [2025-02-05 18:05:45,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:45,053 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1196 transitions. [2025-02-05 18:05:45,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 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 18:05:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1196 transitions. [2025-02-05 18:05:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-02-05 18:05:45,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:45,061 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:45,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 18:05:45,062 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:45,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash 67249300, now seen corresponding path program 1 times [2025-02-05 18:05:45,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:45,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693456607] [2025-02-05 18:05:45,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:45,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:45,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-02-05 18:05:45,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-02-05 18:05:45,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:45,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 18:05:46,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:46,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693456607] [2025-02-05 18:05:46,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693456607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:46,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:46,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:05:46,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458729211] [2025-02-05 18:05:46,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:46,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:05:46,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:46,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:05:46,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:46,239 INFO L87 Difference]: Start difference. First operand 802 states and 1196 transitions. Second operand has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:05:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:46,583 INFO L93 Difference]: Finished difference Result 1460 states and 2177 transitions. [2025-02-05 18:05:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:46,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 394 [2025-02-05 18:05:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:46,588 INFO L225 Difference]: With dead ends: 1460 [2025-02-05 18:05:46,589 INFO L226 Difference]: Without dead ends: 806 [2025-02-05 18:05:46,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:46,590 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:46,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2545 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-02-05 18:05:46,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 804. [2025-02-05 18:05:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 803 states have (on average 1.4919053549190535) internal successors, (1198), 803 states have internal predecessors, (1198), 0 states have call successors, (0), 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 18:05:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1198 transitions. [2025-02-05 18:05:46,611 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1198 transitions. Word has length 394 [2025-02-05 18:05:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:46,611 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1198 transitions. [2025-02-05 18:05:46,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:05:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1198 transitions. [2025-02-05 18:05:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2025-02-05 18:05:46,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:46,618 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:46,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 18:05:46,618 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:46,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:46,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1953182623, now seen corresponding path program 1 times [2025-02-05 18:05:46,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:46,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421695479] [2025-02-05 18:05:46,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:46,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:46,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-02-05 18:05:46,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-02-05 18:05:46,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:46,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 18:05:47,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:47,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421695479] [2025-02-05 18:05:47,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421695479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:47,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:47,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:05:47,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922933283] [2025-02-05 18:05:47,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:47,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:05:47,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:47,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:05:47,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:47,652 INFO L87 Difference]: Start difference. First operand 804 states and 1198 transitions. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 0 states have call successors, (0), 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 18:05:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:48,077 INFO L93 Difference]: Finished difference Result 1468 states and 2187 transitions. [2025-02-05 18:05:48,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:48,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 0 states have call successors, (0), 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 395 [2025-02-05 18:05:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:48,082 INFO L225 Difference]: With dead ends: 1468 [2025-02-05 18:05:48,083 INFO L226 Difference]: Without dead ends: 808 [2025-02-05 18:05:48,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:48,084 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 2540 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3391 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:48,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3391 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:05:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-02-05 18:05:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 806. [2025-02-05 18:05:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 1.4906832298136645) internal successors, (1200), 805 states have internal predecessors, (1200), 0 states have call successors, (0), 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 18:05:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1200 transitions. [2025-02-05 18:05:48,106 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1200 transitions. Word has length 395 [2025-02-05 18:05:48,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:48,107 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1200 transitions. [2025-02-05 18:05:48,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 0 states have call successors, (0), 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 18:05:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1200 transitions. [2025-02-05 18:05:48,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-02-05 18:05:48,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:48,112 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:48,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 18:05:48,113 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:48,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:48,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1500906129, now seen corresponding path program 1 times [2025-02-05 18:05:48,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:48,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343366996] [2025-02-05 18:05:48,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:48,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:48,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-02-05 18:05:48,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-02-05 18:05:48,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:48,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 18:05:48,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:48,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343366996] [2025-02-05 18:05:48,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343366996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:48,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:48,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:48,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087847288] [2025-02-05 18:05:48,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:48,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:48,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:48,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:48,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:48,815 INFO L87 Difference]: Start difference. First operand 806 states and 1200 transitions. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 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 18:05:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:49,180 INFO L93 Difference]: Finished difference Result 1476 states and 2197 transitions. [2025-02-05 18:05:49,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:49,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 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 396 [2025-02-05 18:05:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:49,184 INFO L225 Difference]: With dead ends: 1476 [2025-02-05 18:05:49,184 INFO L226 Difference]: Without dead ends: 810 [2025-02-05 18:05:49,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:49,186 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:49,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2540 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-02-05 18:05:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2025-02-05 18:05:49,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 1.4894671623296158) internal successors, (1202), 807 states have internal predecessors, (1202), 0 states have call successors, (0), 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 18:05:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1202 transitions. [2025-02-05 18:05:49,207 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1202 transitions. Word has length 396 [2025-02-05 18:05:49,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:49,207 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1202 transitions. [2025-02-05 18:05:49,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 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 18:05:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1202 transitions. [2025-02-05 18:05:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-02-05 18:05:49,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:49,213 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:49,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 18:05:49,214 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:49,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:49,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1564409924, now seen corresponding path program 1 times [2025-02-05 18:05:49,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:49,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743566406] [2025-02-05 18:05:49,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:49,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:49,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes. [2025-02-05 18:05:49,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements. [2025-02-05 18:05:49,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:49,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 18:05:49,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:49,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743566406] [2025-02-05 18:05:49,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743566406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:49,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:49,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:49,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511605334] [2025-02-05 18:05:49,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:49,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:49,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:49,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:49,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:49,977 INFO L87 Difference]: Start difference. First operand 808 states and 1202 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 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 18:05:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:50,353 INFO L93 Difference]: Finished difference Result 1490 states and 2215 transitions. [2025-02-05 18:05:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:50,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 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 397 [2025-02-05 18:05:50,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:50,359 INFO L225 Difference]: With dead ends: 1490 [2025-02-05 18:05:50,359 INFO L226 Difference]: Without dead ends: 822 [2025-02-05 18:05:50,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:50,361 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 3 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:50,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2545 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:50,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-02-05 18:05:50,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 812. [2025-02-05 18:05:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 1.4895191122071516) internal successors, (1208), 811 states have internal predecessors, (1208), 0 states have call successors, (0), 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 18:05:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1208 transitions. [2025-02-05 18:05:50,386 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1208 transitions. Word has length 397 [2025-02-05 18:05:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:50,387 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1208 transitions. [2025-02-05 18:05:50,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 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 18:05:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1208 transitions. [2025-02-05 18:05:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-02-05 18:05:50,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:50,394 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:50,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 18:05:50,395 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:50,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:50,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1083803466, now seen corresponding path program 1 times [2025-02-05 18:05:50,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:50,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876027526] [2025-02-05 18:05:50,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:50,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:50,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-02-05 18:05:50,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-02-05 18:05:50,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:50,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:51,124 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 18:05:51,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:51,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876027526] [2025-02-05 18:05:51,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876027526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:51,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:51,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:51,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008048062] [2025-02-05 18:05:51,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:51,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:51,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:51,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:51,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:51,128 INFO L87 Difference]: Start difference. First operand 812 states and 1208 transitions. Second operand has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 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 18:05:51,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:51,471 INFO L93 Difference]: Finished difference Result 1504 states and 2237 transitions. [2025-02-05 18:05:51,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:51,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 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 398 [2025-02-05 18:05:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:51,476 INFO L225 Difference]: With dead ends: 1504 [2025-02-05 18:05:51,476 INFO L226 Difference]: Without dead ends: 824 [2025-02-05 18:05:51,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:51,478 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 4 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:51,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2545 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:51,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-02-05 18:05:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 818. [2025-02-05 18:05:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 817 states have (on average 1.4883720930232558) internal successors, (1216), 817 states have internal predecessors, (1216), 0 states have call successors, (0), 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 18:05:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1216 transitions. [2025-02-05 18:05:51,502 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1216 transitions. Word has length 398 [2025-02-05 18:05:51,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:51,502 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1216 transitions. [2025-02-05 18:05:51,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 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 18:05:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1216 transitions. [2025-02-05 18:05:51,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-02-05 18:05:51,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:51,510 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:51,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 18:05:51,511 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:51,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:51,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1386037646, now seen corresponding path program 1 times [2025-02-05 18:05:51,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:51,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931055926] [2025-02-05 18:05:51,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:51,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:51,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-02-05 18:05:51,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-02-05 18:05:51,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:51,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 18:05:52,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:52,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931055926] [2025-02-05 18:05:52,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931055926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:52,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:52,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:52,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270766408] [2025-02-05 18:05:52,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:52,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:52,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:52,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:52,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:52,187 INFO L87 Difference]: Start difference. First operand 818 states and 1216 transitions. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 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 18:05:52,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:52,541 INFO L93 Difference]: Finished difference Result 1516 states and 2253 transitions. [2025-02-05 18:05:52,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:52,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 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 399 [2025-02-05 18:05:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:52,546 INFO L225 Difference]: With dead ends: 1516 [2025-02-05 18:05:52,547 INFO L226 Difference]: Without dead ends: 822 [2025-02-05 18:05:52,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:52,549 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:52,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2545 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:52,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-02-05 18:05:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 820. [2025-02-05 18:05:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 819 states have (on average 1.4871794871794872) internal successors, (1218), 819 states have internal predecessors, (1218), 0 states have call successors, (0), 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 18:05:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1218 transitions. [2025-02-05 18:05:52,569 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1218 transitions. Word has length 399 [2025-02-05 18:05:52,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:52,570 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1218 transitions. [2025-02-05 18:05:52,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 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 18:05:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1218 transitions. [2025-02-05 18:05:52,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-02-05 18:05:52,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:52,576 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:52,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 18:05:52,577 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:52,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:52,578 INFO L85 PathProgramCache]: Analyzing trace with hash 564564997, now seen corresponding path program 1 times [2025-02-05 18:05:52,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:52,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266320443] [2025-02-05 18:05:52,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:52,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:52,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-02-05 18:05:52,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-02-05 18:05:52,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:52,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 18:05:53,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:53,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266320443] [2025-02-05 18:05:53,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266320443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:53,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:53,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:53,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959204124] [2025-02-05 18:05:53,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:53,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:53,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:53,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:53,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:53,218 INFO L87 Difference]: Start difference. First operand 820 states and 1218 transitions. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 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 18:05:53,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:53,579 INFO L93 Difference]: Finished difference Result 1524 states and 2263 transitions. [2025-02-05 18:05:53,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:53,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 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 400 [2025-02-05 18:05:53,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:53,584 INFO L225 Difference]: With dead ends: 1524 [2025-02-05 18:05:53,584 INFO L226 Difference]: Without dead ends: 824 [2025-02-05 18:05:53,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:53,586 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:53,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2540 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-02-05 18:05:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 822. [2025-02-05 18:05:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 821 states have (on average 1.4859926918392206) internal successors, (1220), 821 states have internal predecessors, (1220), 0 states have call successors, (0), 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 18:05:53,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1220 transitions. [2025-02-05 18:05:53,607 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1220 transitions. Word has length 400 [2025-02-05 18:05:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:53,608 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1220 transitions. [2025-02-05 18:05:53,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 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 18:05:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1220 transitions. [2025-02-05 18:05:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-02-05 18:05:53,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:53,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:53,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 18:05:53,615 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:53,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1471799725, now seen corresponding path program 1 times [2025-02-05 18:05:53,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:53,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17184473] [2025-02-05 18:05:53,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:53,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:53,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-05 18:05:53,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-05 18:05:53,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:53,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 18:05:54,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:54,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17184473] [2025-02-05 18:05:54,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17184473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:54,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:54,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:05:54,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491175390] [2025-02-05 18:05:54,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:54,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:05:54,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:54,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:05:54,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:54,380 INFO L87 Difference]: Start difference. First operand 822 states and 1220 transitions. Second operand has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:05:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:54,745 INFO L93 Difference]: Finished difference Result 1538 states and 2281 transitions. [2025-02-05 18:05:54,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:05:54,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 401 [2025-02-05 18:05:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:54,750 INFO L225 Difference]: With dead ends: 1538 [2025-02-05 18:05:54,750 INFO L226 Difference]: Without dead ends: 836 [2025-02-05 18:05:54,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:54,752 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 4 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2541 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:54,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2541 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-02-05 18:05:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 826. [2025-02-05 18:05:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 1.486060606060606) internal successors, (1226), 825 states have internal predecessors, (1226), 0 states have call successors, (0), 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 18:05:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1226 transitions. [2025-02-05 18:05:54,773 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1226 transitions. Word has length 401 [2025-02-05 18:05:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:54,774 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1226 transitions. [2025-02-05 18:05:54,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:05:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1226 transitions. [2025-02-05 18:05:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-02-05 18:05:54,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:54,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:54,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 18:05:54,780 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:54,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:54,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1998960192, now seen corresponding path program 1 times [2025-02-05 18:05:54,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:54,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896124720] [2025-02-05 18:05:54,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:54,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:54,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-02-05 18:05:54,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-02-05 18:05:54,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:54,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 18:05:55,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:55,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896124720] [2025-02-05 18:05:55,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896124720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:55,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:55,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:55,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493301419] [2025-02-05 18:05:55,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:55,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:55,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:55,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:55,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:55,355 INFO L87 Difference]: Start difference. First operand 826 states and 1226 transitions. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 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 18:05:55,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:55,700 INFO L93 Difference]: Finished difference Result 1544 states and 2291 transitions. [2025-02-05 18:05:55,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:55,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 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 402 [2025-02-05 18:05:55,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:55,705 INFO L225 Difference]: With dead ends: 1544 [2025-02-05 18:05:55,706 INFO L226 Difference]: Without dead ends: 830 [2025-02-05 18:05:55,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:55,708 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:55,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2540 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-02-05 18:05:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 828. [2025-02-05 18:05:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 1.4848851269649335) internal successors, (1228), 827 states have internal predecessors, (1228), 0 states have call successors, (0), 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 18:05:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1228 transitions. [2025-02-05 18:05:55,729 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1228 transitions. Word has length 402 [2025-02-05 18:05:55,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:55,730 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1228 transitions. [2025-02-05 18:05:55,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 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 18:05:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1228 transitions. [2025-02-05 18:05:55,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-05 18:05:55,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:55,733 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:55,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 18:05:55,734 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:55,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:55,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2036292120, now seen corresponding path program 1 times [2025-02-05 18:05:55,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:55,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877397309] [2025-02-05 18:05:55,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:55,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:55,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-05 18:05:55,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-05 18:05:55,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:55,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:05:56,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:56,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877397309] [2025-02-05 18:05:56,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877397309] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:05:56,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948309967] [2025-02-05 18:05:56,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:56,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:05:56,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:56,633 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 18:05:56,635 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 18:05:56,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-05 18:05:57,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-05 18:05:57,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:57,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:57,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 1703 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 18:05:57,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:05:58,224 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:05:58,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 18:05:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:05:59,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948309967] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 18:05:59,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 18:05:59,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2025-02-05 18:05:59,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055103803] [2025-02-05 18:05:59,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 18:05:59,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 18:05:59,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:59,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 18:05:59,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-02-05 18:05:59,206 INFO L87 Difference]: Start difference. First operand 828 states and 1228 transitions. Second operand has 15 states, 15 states have (on average 54.8) internal successors, (822), 15 states have internal predecessors, (822), 0 states have call successors, (0), 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 18:06:01,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:01,953 INFO L93 Difference]: Finished difference Result 6458 states and 9561 transitions. [2025-02-05 18:06:01,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-05 18:06:01,954 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 54.8) internal successors, (822), 15 states have internal predecessors, (822), 0 states have call successors, (0), 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 403 [2025-02-05 18:06:01,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:01,969 INFO L225 Difference]: With dead ends: 6458 [2025-02-05 18:06:01,970 INFO L226 Difference]: Without dead ends: 3718 [2025-02-05 18:06:01,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 801 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=391, Invalid=2365, Unknown=0, NotChecked=0, Total=2756 [2025-02-05 18:06:01,976 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 15783 mSDsluCounter, 8728 mSDsCounter, 0 mSdLazyCounter, 2907 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15783 SdHoareTripleChecker+Valid, 9561 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:01,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15783 Valid, 9561 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2907 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 18:06:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2025-02-05 18:06:02,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 1596. [2025-02-05 18:06:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1595 states have (on average 1.484012539184953) internal successors, (2367), 1595 states have internal predecessors, (2367), 0 states have call successors, (0), 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 18:06:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2367 transitions. [2025-02-05 18:06:02,041 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2367 transitions. Word has length 403 [2025-02-05 18:06:02,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:02,042 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 2367 transitions. [2025-02-05 18:06:02,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 54.8) internal successors, (822), 15 states have internal predecessors, (822), 0 states have call successors, (0), 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 18:06:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2367 transitions. [2025-02-05 18:06:02,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-02-05 18:06:02,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:02,047 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:02,062 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 18:06:02,251 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,SelfDestructingSolverStorable17 [2025-02-05 18:06:02,252 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:02,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:02,253 INFO L85 PathProgramCache]: Analyzing trace with hash 21784668, now seen corresponding path program 1 times [2025-02-05 18:06:02,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:02,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384568636] [2025-02-05 18:06:02,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:02,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:02,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-05 18:06:02,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-05 18:06:02,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:02,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:03,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:03,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384568636] [2025-02-05 18:06:03,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384568636] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:06:03,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991550671] [2025-02-05 18:06:03,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:03,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:03,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:06:03,062 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 18:06:03,065 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 18:06:03,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-05 18:06:03,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-05 18:06:03,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:03,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:03,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 1709 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 18:06:03,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:06:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 18:06:04,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:06:04,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991550671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:04,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 18:06:04,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-02-05 18:06:04,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304867744] [2025-02-05 18:06:04,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:04,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:06:04,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:04,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:06:04,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-05 18:06:04,042 INFO L87 Difference]: Start difference. First operand 1596 states and 2367 transitions. Second operand has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 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 18:06:04,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:04,745 INFO L93 Difference]: Finished difference Result 4148 states and 6148 transitions. [2025-02-05 18:06:04,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:06:04,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 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 405 [2025-02-05 18:06:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:04,752 INFO L225 Difference]: With dead ends: 4148 [2025-02-05 18:06:04,752 INFO L226 Difference]: Without dead ends: 2706 [2025-02-05 18:06:04,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-05 18:06:04,755 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 1746 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 2936 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:04,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 2936 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:06:04,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2025-02-05 18:06:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 1624. [2025-02-05 18:06:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1623 states have (on average 1.4793592113370302) internal successors, (2401), 1623 states have internal predecessors, (2401), 0 states have call successors, (0), 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 18:06:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2401 transitions. [2025-02-05 18:06:04,803 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2401 transitions. Word has length 405 [2025-02-05 18:06:04,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:04,803 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2401 transitions. [2025-02-05 18:06:04,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 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 18:06:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2401 transitions. [2025-02-05 18:06:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-02-05 18:06:04,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:04,808 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:04,823 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 18:06:05,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:05,009 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:05,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:05,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1601800485, now seen corresponding path program 1 times [2025-02-05 18:06:05,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:05,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500390236] [2025-02-05 18:06:05,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:05,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:05,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-05 18:06:05,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-05 18:06:05,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:05,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:05,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:05,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500390236] [2025-02-05 18:06:05,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500390236] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:06:05,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528068824] [2025-02-05 18:06:05,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:05,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:05,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:06:05,855 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 18:06:05,864 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 18:06:06,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-05 18:06:06,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-05 18:06:06,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:06,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:06,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 18:06:06,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:06:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:06,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:06:06,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528068824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:06,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 18:06:06,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-02-05 18:06:06,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978641638] [2025-02-05 18:06:06,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:06,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:06:06,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:06,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:06:06,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 18:06:06,833 INFO L87 Difference]: Start difference. First operand 1624 states and 2401 transitions. Second operand has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:07,592 INFO L93 Difference]: Finished difference Result 3982 states and 5879 transitions. [2025-02-05 18:06:07,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:06:07,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 406 [2025-02-05 18:06:07,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:07,600 INFO L225 Difference]: With dead ends: 3982 [2025-02-05 18:06:07,600 INFO L226 Difference]: Without dead ends: 2540 [2025-02-05 18:06:07,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-05 18:06:07,602 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 1983 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1983 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:07,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1983 Valid, 2592 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:06:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2025-02-05 18:06:07,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2060. [2025-02-05 18:06:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 2059 states have (on average 1.4672170956775135) internal successors, (3021), 2059 states have internal predecessors, (3021), 0 states have call successors, (0), 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 18:06:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 3021 transitions. [2025-02-05 18:06:07,634 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 3021 transitions. Word has length 406 [2025-02-05 18:06:07,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:07,634 INFO L471 AbstractCegarLoop]: Abstraction has 2060 states and 3021 transitions. [2025-02-05 18:06:07,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:07,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 3021 transitions. [2025-02-05 18:06:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-02-05 18:06:07,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:07,639 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:07,655 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 18:06:07,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:07,840 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:07,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:07,840 INFO L85 PathProgramCache]: Analyzing trace with hash 227161199, now seen corresponding path program 1 times [2025-02-05 18:06:07,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:07,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797308977] [2025-02-05 18:06:07,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:07,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:07,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-02-05 18:06:07,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-02-05 18:06:07,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:07,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:08,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:08,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797308977] [2025-02-05 18:06:08,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797308977] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:06:08,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170457405] [2025-02-05 18:06:08,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:08,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:08,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:06:08,530 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 18:06:08,532 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 18:06:08,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-02-05 18:06:09,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-02-05 18:06:09,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:09,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:09,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 18:06:09,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:06:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:09,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:06:09,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170457405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:09,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 18:06:09,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-02-05 18:06:09,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751182456] [2025-02-05 18:06:09,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:09,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:06:09,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:09,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:06:09,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 18:06:09,775 INFO L87 Difference]: Start difference. First operand 2060 states and 3021 transitions. Second operand has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 0 states have call successors, (0), 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 18:06:10,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:10,699 INFO L93 Difference]: Finished difference Result 4354 states and 6414 transitions. [2025-02-05 18:06:10,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 18:06:10,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 0 states have call successors, (0), 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 407 [2025-02-05 18:06:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:10,707 INFO L225 Difference]: With dead ends: 4354 [2025-02-05 18:06:10,707 INFO L226 Difference]: Without dead ends: 2540 [2025-02-05 18:06:10,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-05 18:06:10,710 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 1188 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 2590 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:10,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 2590 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 18:06:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2025-02-05 18:06:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2536. [2025-02-05 18:06:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2535 states have (on average 1.4725838264299802) internal successors, (3733), 2535 states have internal predecessors, (3733), 0 states have call successors, (0), 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 18:06:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3733 transitions. [2025-02-05 18:06:10,748 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3733 transitions. Word has length 407 [2025-02-05 18:06:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:10,748 INFO L471 AbstractCegarLoop]: Abstraction has 2536 states and 3733 transitions. [2025-02-05 18:06:10,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 0 states have call successors, (0), 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 18:06:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3733 transitions. [2025-02-05 18:06:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-02-05 18:06:10,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:10,754 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:10,767 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 18:06:10,955 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,SelfDestructingSolverStorable20 [2025-02-05 18:06:10,955 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:10,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:10,957 INFO L85 PathProgramCache]: Analyzing trace with hash 280750556, now seen corresponding path program 1 times [2025-02-05 18:06:10,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:10,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023193099] [2025-02-05 18:06:10,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:10,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:10,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-02-05 18:06:11,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-02-05 18:06:11,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:11,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:11,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:11,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023193099] [2025-02-05 18:06:11,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023193099] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:06:11,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970414385] [2025-02-05 18:06:11,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:11,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:11,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:06:11,637 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 18:06:11,638 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 18:06:12,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-02-05 18:06:12,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-02-05 18:06:12,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:12,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:12,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-05 18:06:12,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:06:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:13,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 18:06:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 36 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:14,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970414385] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 18:06:14,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 18:06:14,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 12] total 31 [2025-02-05 18:06:14,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313718098] [2025-02-05 18:06:14,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 18:06:14,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-05 18:06:14,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:14,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-05 18:06:14,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2025-02-05 18:06:14,772 INFO L87 Difference]: Start difference. First operand 2536 states and 3733 transitions. Second operand has 31 states, 31 states have (on average 35.096774193548384) internal successors, (1088), 31 states have internal predecessors, (1088), 0 states have call successors, (0), 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 18:06:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:21,466 INFO L93 Difference]: Finished difference Result 35904 states and 52965 transitions. [2025-02-05 18:06:21,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2025-02-05 18:06:21,470 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 35.096774193548384) internal successors, (1088), 31 states have internal predecessors, (1088), 0 states have call successors, (0), 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 407 [2025-02-05 18:06:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:21,550 INFO L225 Difference]: With dead ends: 35904 [2025-02-05 18:06:21,551 INFO L226 Difference]: Without dead ends: 33614 [2025-02-05 18:06:21,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 970 GetRequests, 801 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10391 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2460, Invalid=26610, Unknown=0, NotChecked=0, Total=29070 [2025-02-05 18:06:21,569 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 18178 mSDsluCounter, 34157 mSDsCounter, 0 mSdLazyCounter, 8644 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18178 SdHoareTripleChecker+Valid, 35701 SdHoareTripleChecker+Invalid, 8676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 8644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:21,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18178 Valid, 35701 Invalid, 8676 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 8644 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 18:06:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33614 states. [2025-02-05 18:06:21,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33614 to 6968. [2025-02-05 18:06:21,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6968 states, 6967 states have (on average 1.4702167360413376) internal successors, (10243), 6967 states have internal predecessors, (10243), 0 states have call successors, (0), 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 18:06:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6968 states to 6968 states and 10243 transitions. [2025-02-05 18:06:21,801 INFO L78 Accepts]: Start accepts. Automaton has 6968 states and 10243 transitions. Word has length 407 [2025-02-05 18:06:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:21,801 INFO L471 AbstractCegarLoop]: Abstraction has 6968 states and 10243 transitions. [2025-02-05 18:06:21,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 35.096774193548384) internal successors, (1088), 31 states have internal predecessors, (1088), 0 states have call successors, (0), 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 18:06:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 6968 states and 10243 transitions. [2025-02-05 18:06:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-05 18:06:21,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:21,818 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:21,832 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 18:06:22,019 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,SelfDestructingSolverStorable21 [2025-02-05 18:06:22,019 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:22,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:22,020 INFO L85 PathProgramCache]: Analyzing trace with hash -482144826, now seen corresponding path program 1 times [2025-02-05 18:06:22,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:22,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711905907] [2025-02-05 18:06:22,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:22,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:22,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-05 18:06:22,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-05 18:06:22,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:22,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 18:06:22,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:22,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711905907] [2025-02-05 18:06:22,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711905907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:22,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:22,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:22,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496330104] [2025-02-05 18:06:22,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:22,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:22,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:22,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:22,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:22,512 INFO L87 Difference]: Start difference. First operand 6968 states and 10243 transitions. Second operand has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 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 18:06:22,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:22,907 INFO L93 Difference]: Finished difference Result 13402 states and 19734 transitions. [2025-02-05 18:06:22,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:06:22,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 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 409 [2025-02-05 18:06:22,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:22,934 INFO L225 Difference]: With dead ends: 13402 [2025-02-05 18:06:22,935 INFO L226 Difference]: Without dead ends: 7016 [2025-02-05 18:06:22,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:22,955 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 0 mSDsluCounter, 1690 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2543 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:22,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2543 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:06:22,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7016 states. [2025-02-05 18:06:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7016 to 6968. [2025-02-05 18:06:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6968 states, 6967 states have (on average 1.4702167360413376) internal successors, (10243), 6967 states have internal predecessors, (10243), 0 states have call successors, (0), 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 18:06:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6968 states to 6968 states and 10243 transitions. [2025-02-05 18:06:23,086 INFO L78 Accepts]: Start accepts. Automaton has 6968 states and 10243 transitions. Word has length 409 [2025-02-05 18:06:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:23,087 INFO L471 AbstractCegarLoop]: Abstraction has 6968 states and 10243 transitions. [2025-02-05 18:06:23,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 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 18:06:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 6968 states and 10243 transitions. [2025-02-05 18:06:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-02-05 18:06:23,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:23,098 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:23,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 18:06:23,099 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:23,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:23,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1656777965, now seen corresponding path program 1 times [2025-02-05 18:06:23,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:23,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467822074] [2025-02-05 18:06:23,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:23,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:23,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-02-05 18:06:23,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-02-05 18:06:23,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:23,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:24,351 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:24,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:24,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467822074] [2025-02-05 18:06:24,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467822074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:24,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:24,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:06:24,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903195046] [2025-02-05 18:06:24,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:24,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:06:24,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:24,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:06:24,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:06:24,355 INFO L87 Difference]: Start difference. First operand 6968 states and 10243 transitions. Second operand has 8 states, 8 states have (on average 51.25) internal successors, (410), 8 states have internal predecessors, (410), 0 states have call successors, (0), 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 18:06:26,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:26,074 INFO L93 Difference]: Finished difference Result 19391 states and 28519 transitions. [2025-02-05 18:06:26,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:06:26,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 51.25) internal successors, (410), 8 states have internal predecessors, (410), 0 states have call successors, (0), 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 410 [2025-02-05 18:06:26,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:26,098 INFO L225 Difference]: With dead ends: 19391 [2025-02-05 18:06:26,098 INFO L226 Difference]: Without dead ends: 13005 [2025-02-05 18:06:26,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:06:26,110 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 1971 mSDsluCounter, 4468 mSDsCounter, 0 mSdLazyCounter, 3319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1971 SdHoareTripleChecker+Valid, 5834 SdHoareTripleChecker+Invalid, 3320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:26,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1971 Valid, 5834 Invalid, 3320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3319 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 18:06:26,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13005 states. [2025-02-05 18:06:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13005 to 8840. [2025-02-05 18:06:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8840 states, 8839 states have (on average 1.4688313157597013) internal successors, (12983), 8839 states have internal predecessors, (12983), 0 states have call successors, (0), 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 18:06:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12983 transitions. [2025-02-05 18:06:26,268 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12983 transitions. Word has length 410 [2025-02-05 18:06:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:26,269 INFO L471 AbstractCegarLoop]: Abstraction has 8840 states and 12983 transitions. [2025-02-05 18:06:26,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 51.25) internal successors, (410), 8 states have internal predecessors, (410), 0 states have call successors, (0), 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 18:06:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12983 transitions. [2025-02-05 18:06:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-02-05 18:06:26,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:26,283 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:26,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 18:06:26,283 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:26,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:26,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1311970635, now seen corresponding path program 1 times [2025-02-05 18:06:26,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:26,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932984312] [2025-02-05 18:06:26,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:26,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:26,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-02-05 18:06:26,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-02-05 18:06:26,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:26,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 18:06:27,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:27,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932984312] [2025-02-05 18:06:27,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932984312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:27,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:27,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:06:27,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852002897] [2025-02-05 18:06:27,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:27,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:06:27,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:27,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:06:27,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:06:27,159 INFO L87 Difference]: Start difference. First operand 8840 states and 12983 transitions. Second operand has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 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 18:06:27,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:27,901 INFO L93 Difference]: Finished difference Result 22275 states and 32742 transitions. [2025-02-05 18:06:27,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:06:27,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 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 410 [2025-02-05 18:06:27,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:27,922 INFO L225 Difference]: With dead ends: 22275 [2025-02-05 18:06:27,922 INFO L226 Difference]: Without dead ends: 14092 [2025-02-05 18:06:27,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:06:27,936 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 1724 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 2938 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:27,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 2938 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:06:27,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14092 states. [2025-02-05 18:06:28,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14092 to 8840. [2025-02-05 18:06:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8840 states, 8839 states have (on average 1.4670211562393936) internal successors, (12967), 8839 states have internal predecessors, (12967), 0 states have call successors, (0), 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 18:06:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12967 transitions. [2025-02-05 18:06:28,131 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12967 transitions. Word has length 410 [2025-02-05 18:06:28,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:28,131 INFO L471 AbstractCegarLoop]: Abstraction has 8840 states and 12967 transitions. [2025-02-05 18:06:28,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 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 18:06:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12967 transitions. [2025-02-05 18:06:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-02-05 18:06:28,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:28,145 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:28,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 18:06:28,146 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:28,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:28,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2029026437, now seen corresponding path program 1 times [2025-02-05 18:06:28,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:28,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293841558] [2025-02-05 18:06:28,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:28,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:28,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-02-05 18:06:28,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-02-05 18:06:28,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:28,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 18:06:29,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:29,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293841558] [2025-02-05 18:06:29,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293841558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:29,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:29,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:06:29,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430970054] [2025-02-05 18:06:29,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:29,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:06:29,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:29,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:06:29,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:06:29,181 INFO L87 Difference]: Start difference. First operand 8840 states and 12967 transitions. Second operand has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 6 states have internal predecessors, (404), 0 states have call successors, (0), 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 18:06:30,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:30,184 INFO L93 Difference]: Finished difference Result 22215 states and 32684 transitions. [2025-02-05 18:06:30,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:06:30,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 6 states have internal predecessors, (404), 0 states have call successors, (0), 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 411 [2025-02-05 18:06:30,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:30,204 INFO L225 Difference]: With dead ends: 22215 [2025-02-05 18:06:30,205 INFO L226 Difference]: Without dead ends: 14128 [2025-02-05 18:06:30,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:06:30,218 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 905 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 3478 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:30,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 3478 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 18:06:30,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14128 states. [2025-02-05 18:06:30,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14128 to 8936. [2025-02-05 18:06:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8936 states, 8935 states have (on average 1.463794068270845) internal successors, (13079), 8935 states have internal predecessors, (13079), 0 states have call successors, (0), 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 18:06:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8936 states to 8936 states and 13079 transitions. [2025-02-05 18:06:30,390 INFO L78 Accepts]: Start accepts. Automaton has 8936 states and 13079 transitions. Word has length 411 [2025-02-05 18:06:30,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:30,390 INFO L471 AbstractCegarLoop]: Abstraction has 8936 states and 13079 transitions. [2025-02-05 18:06:30,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 6 states have internal predecessors, (404), 0 states have call successors, (0), 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 18:06:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 8936 states and 13079 transitions. [2025-02-05 18:06:30,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-02-05 18:06:30,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:30,407 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:30,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 18:06:30,407 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:30,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:30,409 INFO L85 PathProgramCache]: Analyzing trace with hash 642830800, now seen corresponding path program 1 times [2025-02-05 18:06:30,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:30,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555363225] [2025-02-05 18:06:30,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:30,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:30,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-02-05 18:06:30,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-02-05 18:06:30,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:30,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:31,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:31,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555363225] [2025-02-05 18:06:31,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555363225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:31,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:31,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:06:31,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998931348] [2025-02-05 18:06:31,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:31,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:06:31,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:31,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:06:31,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:06:31,140 INFO L87 Difference]: Start difference. First operand 8936 states and 13079 transitions. Second operand has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 0 states have call successors, (0), 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 18:06:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:31,952 INFO L93 Difference]: Finished difference Result 24623 states and 36086 transitions. [2025-02-05 18:06:31,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:06:31,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 0 states have call successors, (0), 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 412 [2025-02-05 18:06:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:31,969 INFO L225 Difference]: With dead ends: 24623 [2025-02-05 18:06:31,970 INFO L226 Difference]: Without dead ends: 16536 [2025-02-05 18:06:31,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:06:31,980 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 1521 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 2335 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:31,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 2335 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:06:31,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16536 states. [2025-02-05 18:06:32,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16536 to 12968. [2025-02-05 18:06:32,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12968 states, 12967 states have (on average 1.4503740263746434) internal successors, (18807), 12967 states have internal predecessors, (18807), 0 states have call successors, (0), 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 18:06:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12968 states to 12968 states and 18807 transitions. [2025-02-05 18:06:32,170 INFO L78 Accepts]: Start accepts. Automaton has 12968 states and 18807 transitions. Word has length 412 [2025-02-05 18:06:32,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:32,170 INFO L471 AbstractCegarLoop]: Abstraction has 12968 states and 18807 transitions. [2025-02-05 18:06:32,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 0 states have call successors, (0), 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 18:06:32,171 INFO L276 IsEmpty]: Start isEmpty. Operand 12968 states and 18807 transitions. [2025-02-05 18:06:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-02-05 18:06:32,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:32,191 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:32,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 18:06:32,192 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:32,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:32,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1563291921, now seen corresponding path program 1 times [2025-02-05 18:06:32,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:32,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870349646] [2025-02-05 18:06:32,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:32,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:32,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-02-05 18:06:32,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-02-05 18:06:32,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:32,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat