./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.resistance.2.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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.resistance.2.prop1-func-interl.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 59c5b0fec2c8389c789b70da0fb8f52d302636f5359ca29eb60fdedc799a96d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:52:25,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:52:25,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:52:25,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:52:25,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:52:25,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:52:25,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:52:25,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:52:25,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:52:25,799 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:52:25,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:52:25,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:52:25,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:52:25,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:52:25,800 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:52:25,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:52:25,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:52:25,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:52:25,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:52:25,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:52:25,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:52:25,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:52:25,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:52:25,800 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:52:25,801 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:52:25,801 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:52:25,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:52:25,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:52:25,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:52:25,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:52:25,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:52:25,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:52:25,804 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:52:25,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:52:25,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:52:25,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:52:25,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:52:25,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:52:25,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:52:25,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:52:25,805 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 -> 59c5b0fec2c8389c789b70da0fb8f52d302636f5359ca29eb60fdedc799a96d3 [2025-02-07 23:52:26,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:52:26,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:52:26,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:52:26,070 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:52:26,070 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:52:26,072 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.resistance.2.prop1-func-interl.c [2025-02-07 23:52:27,235 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e703ca2d/55c6fe66c40e423b9c33e98a32447b22/FLAGefa2f6e15 [2025-02-07 23:52:27,590 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:52:27,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.resistance.2.prop1-func-interl.c [2025-02-07 23:52:27,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e703ca2d/55c6fe66c40e423b9c33e98a32447b22/FLAGefa2f6e15 [2025-02-07 23:52:27,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e703ca2d/55c6fe66c40e423b9c33e98a32447b22 [2025-02-07 23:52:27,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:52:27,630 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:52:27,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:52:27,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:52:27,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:52:27,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:52:27" (1/1) ... [2025-02-07 23:52:27,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a9df4a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:27, skipping insertion in model container [2025-02-07 23:52:27,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:52:27" (1/1) ... [2025-02-07 23:52:27,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:52:27,779 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.resistance.2.prop1-func-interl.c[1177,1190] [2025-02-07 23:52:28,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:52:28,070 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:52:28,077 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.resistance.2.prop1-func-interl.c[1177,1190] [2025-02-07 23:52:28,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:52:28,243 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:52:28,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:28 WrapperNode [2025-02-07 23:52:28,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:52:28,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:52:28,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:52:28,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:52:28,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:28" (1/1) ... [2025-02-07 23:52:28,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:28" (1/1) ... [2025-02-07 23:52:28,884 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 6401 [2025-02-07 23:52:28,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:52:28,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:52:28,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:52:28,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:52:28,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:28" (1/1) ... [2025-02-07 23:52:28,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:28" (1/1) ... [2025-02-07 23:52:29,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:28" (1/1) ... [2025-02-07 23:52:29,154 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-07 23:52:29,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:28" (1/1) ... [2025-02-07 23:52:29,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:28" (1/1) ... [2025-02-07 23:52:29,278 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:28" (1/1) ... [2025-02-07 23:52:29,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:28" (1/1) ... [2025-02-07 23:52:29,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:28" (1/1) ... [2025-02-07 23:52:29,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:28" (1/1) ... [2025-02-07 23:52:29,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:52:29,443 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:52:29,443 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:52:29,443 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:52:29,444 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:28" (1/1) ... [2025-02-07 23:52:29,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:52:29,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:52:29,468 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-07 23:52:29,474 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-07 23:52:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:52:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:52:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:52:29,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:52:29,832 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:52:29,838 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:52:36,478 INFO L? ?]: Removed 3556 outVars from TransFormulas that were not future-live. [2025-02-07 23:52:36,479 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:52:36,676 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:52:36,677 INFO L337 CfgBuilder]: Removed 3 assume(true) statements. [2025-02-07 23:52:36,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:52:36 BoogieIcfgContainer [2025-02-07 23:52:36,677 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:52:36,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:52:36,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:52:36,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:52:36,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:52:27" (1/3) ... [2025-02-07 23:52:36,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c541c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:52:36, skipping insertion in model container [2025-02-07 23:52:36,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:28" (2/3) ... [2025-02-07 23:52:36,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c541c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:52:36, skipping insertion in model container [2025-02-07 23:52:36,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:52:36" (3/3) ... [2025-02-07 23:52:36,688 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.resistance.2.prop1-func-interl.c [2025-02-07 23:52:36,699 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:52:36,701 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.resistance.2.prop1-func-interl.c that has 1 procedures, 2285 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:52:36,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:52:36,790 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;@33e4df16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:52:36,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:52:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 2285 states, 2283 states have (on average 1.5006570302233904) internal successors, (3426), 2284 states have internal predecessors, (3426), 0 states have call successors, (0), 0 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-07 23:52:36,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-07 23:52:36,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:36,811 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, 1, 1, 1, 1, 1, 1, 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-07 23:52:36,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:36,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:36,816 INFO L85 PathProgramCache]: Analyzing trace with hash 390704961, now seen corresponding path program 1 times [2025-02-07 23:52:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:36,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928853004] [2025-02-07 23:52:36,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:36,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:36,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-07 23:52:36,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-07 23:52:36,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:36,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:37,370 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-07 23:52:37,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:37,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928853004] [2025-02-07 23:52:37,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928853004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:37,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:37,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:52:37,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785529316] [2025-02-07 23:52:37,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:37,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 23:52:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:37,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 23:52:37,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 23:52:37,392 INFO L87 Difference]: Start difference. First operand has 2285 states, 2283 states have (on average 1.5006570302233904) internal successors, (3426), 2284 states have internal predecessors, (3426), 0 states have call successors, (0), 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 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:38,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:38,188 INFO L93 Difference]: Finished difference Result 4452 states and 6678 transitions. [2025-02-07 23:52:38,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 23:52:38,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-02-07 23:52:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:38,206 INFO L225 Difference]: With dead ends: 4452 [2025-02-07 23:52:38,206 INFO L226 Difference]: Without dead ends: 2284 [2025-02-07 23:52:38,211 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-07 23:52:38,213 INFO L435 NwaCegarLoop]: 2852 mSDtfsCounter, 0 mSDsluCounter, 2847 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5699 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:38,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5699 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:52:38,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2025-02-07 23:52:38,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2284. [2025-02-07 23:52:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 2283 states have (on average 1.4997809899255365) internal successors, (3424), 2283 states have internal predecessors, (3424), 0 states have call successors, (0), 0 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-07 23:52:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3424 transitions. [2025-02-07 23:52:38,286 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3424 transitions. Word has length 118 [2025-02-07 23:52:38,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:38,287 INFO L471 AbstractCegarLoop]: Abstraction has 2284 states and 3424 transitions. [2025-02-07 23:52:38,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:38,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3424 transitions. [2025-02-07 23:52:38,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-07 23:52:38,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:38,289 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, 1, 1, 1, 1, 1, 1, 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-07 23:52:38,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:52:38,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:38,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:38,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2032134878, now seen corresponding path program 1 times [2025-02-07 23:52:38,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:38,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066421618] [2025-02-07 23:52:38,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:38,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:38,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-07 23:52:38,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-07 23:52:38,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:38,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:38,783 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-07 23:52:38,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:38,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066421618] [2025-02-07 23:52:38,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066421618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:38,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:38,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:52:38,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699729233] [2025-02-07 23:52:38,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:38,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:52:38,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:38,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:52:38,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:52:38,786 INFO L87 Difference]: Start difference. First operand 2284 states and 3424 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:39,646 INFO L93 Difference]: Finished difference Result 2288 states and 3428 transitions. [2025-02-07 23:52:39,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:52:39,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-02-07 23:52:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:39,655 INFO L225 Difference]: With dead ends: 2288 [2025-02-07 23:52:39,655 INFO L226 Difference]: Without dead ends: 2286 [2025-02-07 23:52:39,656 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-07 23:52:39,657 INFO L435 NwaCegarLoop]: 2851 mSDtfsCounter, 0 mSDsluCounter, 5697 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8548 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:39,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8548 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:52:39,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2025-02-07 23:52:39,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2286. [2025-02-07 23:52:39,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2286 states, 2285 states have (on average 1.499343544857768) internal successors, (3426), 2285 states have internal predecessors, (3426), 0 states have call successors, (0), 0 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-07 23:52:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 3426 transitions. [2025-02-07 23:52:39,719 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 3426 transitions. Word has length 118 [2025-02-07 23:52:39,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:39,723 INFO L471 AbstractCegarLoop]: Abstraction has 2286 states and 3426 transitions. [2025-02-07 23:52:39,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 3426 transitions. [2025-02-07 23:52:39,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-07 23:52:39,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:39,724 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, 1, 1, 1, 1, 1, 1, 1, 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-07 23:52:39,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:52:39,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:39,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:39,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1433010940, now seen corresponding path program 1 times [2025-02-07 23:52:39,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:39,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044117419] [2025-02-07 23:52:39,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:39,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:39,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-07 23:52:39,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-07 23:52:39,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:39,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:39,986 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-07 23:52:39,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:39,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044117419] [2025-02-07 23:52:39,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044117419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:39,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:39,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:52:39,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690024629] [2025-02-07 23:52:39,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:39,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:52:39,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:39,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:52:39,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:52:39,987 INFO L87 Difference]: Start difference. First operand 2286 states and 3426 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-07 23:52:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:40,844 INFO L93 Difference]: Finished difference Result 4457 states and 6680 transitions. [2025-02-07 23:52:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:52:40,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-02-07 23:52:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:40,851 INFO L225 Difference]: With dead ends: 4457 [2025-02-07 23:52:40,851 INFO L226 Difference]: Without dead ends: 2288 [2025-02-07 23:52:40,853 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-07 23:52:40,854 INFO L435 NwaCegarLoop]: 2851 mSDtfsCounter, 0 mSDsluCounter, 5694 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8545 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:40,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8545 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:52:40,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2025-02-07 23:52:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2288. [2025-02-07 23:52:40,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2288 states, 2287 states have (on average 1.4989068648885002) internal successors, (3428), 2287 states have internal predecessors, (3428), 0 states have call successors, (0), 0 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-07 23:52:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 3428 transitions. [2025-02-07 23:52:40,937 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 3428 transitions. Word has length 119 [2025-02-07 23:52:40,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:40,938 INFO L471 AbstractCegarLoop]: Abstraction has 2288 states and 3428 transitions. [2025-02-07 23:52:40,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-07 23:52:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 3428 transitions. [2025-02-07 23:52:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-07 23:52:40,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:40,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:52:40,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:52:40,943 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:40,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:40,944 INFO L85 PathProgramCache]: Analyzing trace with hash -889788323, now seen corresponding path program 1 times [2025-02-07 23:52:40,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:40,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921078798] [2025-02-07 23:52:40,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:40,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:41,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-07 23:52:41,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-07 23:52:41,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:41,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:41,277 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-07 23:52:41,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:41,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921078798] [2025-02-07 23:52:41,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921078798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:41,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:41,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:52:41,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851281031] [2025-02-07 23:52:41,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:41,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:52:41,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:41,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:52:41,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:52:41,279 INFO L87 Difference]: Start difference. First operand 2288 states and 3428 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 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-07 23:52:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:42,083 INFO L93 Difference]: Finished difference Result 4461 states and 6684 transitions. [2025-02-07 23:52:42,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:52:42,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-02-07 23:52:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:42,089 INFO L225 Difference]: With dead ends: 4461 [2025-02-07 23:52:42,089 INFO L226 Difference]: Without dead ends: 2290 [2025-02-07 23:52:42,092 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-07 23:52:42,092 INFO L435 NwaCegarLoop]: 2851 mSDtfsCounter, 0 mSDsluCounter, 5689 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8540 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:42,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8540 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:52:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2025-02-07 23:52:42,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2290. [2025-02-07 23:52:42,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2290 states, 2289 states have (on average 1.4984709480122325) internal successors, (3430), 2289 states have internal predecessors, (3430), 0 states have call successors, (0), 0 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-07 23:52:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 3430 transitions. [2025-02-07 23:52:42,124 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 3430 transitions. Word has length 120 [2025-02-07 23:52:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:42,124 INFO L471 AbstractCegarLoop]: Abstraction has 2290 states and 3430 transitions. [2025-02-07 23:52:42,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 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-07 23:52:42,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 3430 transitions. [2025-02-07 23:52:42,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-07 23:52:42,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:42,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:52:42,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:52:42,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:42,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash 74731841, now seen corresponding path program 1 times [2025-02-07 23:52:42,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:42,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490724484] [2025-02-07 23:52:42,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:42,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:42,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-07 23:52:42,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-07 23:52:42,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:42,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:42,315 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-07 23:52:42,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:42,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490724484] [2025-02-07 23:52:42,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490724484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:42,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:42,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:52:42,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038281730] [2025-02-07 23:52:42,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:42,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:52:42,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:42,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:52:42,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:52:42,317 INFO L87 Difference]: Start difference. First operand 2290 states and 3430 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-07 23:52:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:43,337 INFO L93 Difference]: Finished difference Result 4471 states and 6696 transitions. [2025-02-07 23:52:43,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:52:43,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-02-07 23:52:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:43,345 INFO L225 Difference]: With dead ends: 4471 [2025-02-07 23:52:43,345 INFO L226 Difference]: Without dead ends: 2298 [2025-02-07 23:52:43,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:52:43,347 INFO L435 NwaCegarLoop]: 2850 mSDtfsCounter, 3 mSDsluCounter, 8540 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11390 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:43,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11390 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 23:52:43,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2025-02-07 23:52:43,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 2294. [2025-02-07 23:52:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2293 states have (on average 1.4984736153510685) internal successors, (3436), 2293 states have internal predecessors, (3436), 0 states have call successors, (0), 0 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-07 23:52:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 3436 transitions. [2025-02-07 23:52:43,373 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 3436 transitions. Word has length 121 [2025-02-07 23:52:43,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:43,374 INFO L471 AbstractCegarLoop]: Abstraction has 2294 states and 3436 transitions. [2025-02-07 23:52:43,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-07 23:52:43,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 3436 transitions. [2025-02-07 23:52:43,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-07 23:52:43,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:43,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:52:43,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 23:52:43,375 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:43,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1278479208, now seen corresponding path program 1 times [2025-02-07 23:52:43,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:43,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173348770] [2025-02-07 23:52:43,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:43,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:43,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-07 23:52:43,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-07 23:52:43,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:43,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:43,528 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-07 23:52:43,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:43,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173348770] [2025-02-07 23:52:43,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173348770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:43,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:43,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:52:43,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460461052] [2025-02-07 23:52:43,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:43,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:52:43,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:43,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:52:43,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:52:43,530 INFO L87 Difference]: Start difference. First operand 2294 states and 3436 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 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-07 23:52:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:44,334 INFO L93 Difference]: Finished difference Result 4473 states and 6700 transitions. [2025-02-07 23:52:44,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:52:44,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-02-07 23:52:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:44,341 INFO L225 Difference]: With dead ends: 4473 [2025-02-07 23:52:44,341 INFO L226 Difference]: Without dead ends: 2296 [2025-02-07 23:52:44,343 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-07 23:52:44,344 INFO L435 NwaCegarLoop]: 2851 mSDtfsCounter, 0 mSDsluCounter, 5689 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8540 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:44,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8540 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:52:44,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2025-02-07 23:52:44,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2296. [2025-02-07 23:52:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2296 states, 2295 states have (on average 1.4980392156862745) internal successors, (3438), 2295 states have internal predecessors, (3438), 0 states have call successors, (0), 0 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-07 23:52:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 3438 transitions. [2025-02-07 23:52:44,370 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 3438 transitions. Word has length 122 [2025-02-07 23:52:44,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:44,370 INFO L471 AbstractCegarLoop]: Abstraction has 2296 states and 3438 transitions. [2025-02-07 23:52:44,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 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-07 23:52:44,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3438 transitions. [2025-02-07 23:52:44,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-07 23:52:44,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:44,371 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:52:44,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 23:52:44,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:44,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:44,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1109692794, now seen corresponding path program 1 times [2025-02-07 23:52:44,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:44,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283687849] [2025-02-07 23:52:44,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:44,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:44,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-07 23:52:44,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-07 23:52:44,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:44,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:44,616 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-07 23:52:44,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:44,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283687849] [2025-02-07 23:52:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283687849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:44,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:44,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:52:44,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363013442] [2025-02-07 23:52:44,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:44,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:52:44,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:44,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:52:44,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:52:44,618 INFO L87 Difference]: Start difference. First operand 2296 states and 3438 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-07 23:52:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:46,204 INFO L93 Difference]: Finished difference Result 4473 states and 6699 transitions. [2025-02-07 23:52:46,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:52:46,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-02-07 23:52:46,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:46,209 INFO L225 Difference]: With dead ends: 4473 [2025-02-07 23:52:46,209 INFO L226 Difference]: Without dead ends: 2294 [2025-02-07 23:52:46,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:52:46,212 INFO L435 NwaCegarLoop]: 2243 mSDtfsCounter, 3317 mSDsluCounter, 3553 mSDsCounter, 0 mSdLazyCounter, 2934 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3317 SdHoareTripleChecker+Valid, 5796 SdHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:46,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3317 Valid, 5796 Invalid, 2935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2934 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-07 23:52:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2025-02-07 23:52:46,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2294. [2025-02-07 23:52:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2293 states have (on average 1.497601395551679) internal successors, (3434), 2293 states have internal predecessors, (3434), 0 states have call successors, (0), 0 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-07 23:52:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 3434 transitions. [2025-02-07 23:52:46,238 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 3434 transitions. Word has length 123 [2025-02-07 23:52:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:46,238 INFO L471 AbstractCegarLoop]: Abstraction has 2294 states and 3434 transitions. [2025-02-07 23:52:46,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-07 23:52:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 3434 transitions. [2025-02-07 23:52:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-07 23:52:46,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:46,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:52:46,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 23:52:46,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:46,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:46,240 INFO L85 PathProgramCache]: Analyzing trace with hash 240875621, now seen corresponding path program 1 times [2025-02-07 23:52:46,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:46,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804233113] [2025-02-07 23:52:46,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:46,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:46,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-07 23:52:46,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-07 23:52:46,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:46,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:46,727 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-07 23:52:46,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:46,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804233113] [2025-02-07 23:52:46,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804233113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:46,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:46,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:52:46,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836215077] [2025-02-07 23:52:46,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:46,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:52:46,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:46,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:52:46,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:52:46,733 INFO L87 Difference]: Start difference. First operand 2294 states and 3434 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 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-07 23:52:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:48,079 INFO L93 Difference]: Finished difference Result 4477 states and 6700 transitions. [2025-02-07 23:52:48,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:52:48,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-02-07 23:52:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:48,084 INFO L225 Difference]: With dead ends: 4477 [2025-02-07 23:52:48,084 INFO L226 Difference]: Without dead ends: 2300 [2025-02-07 23:52:48,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:52:48,087 INFO L435 NwaCegarLoop]: 2845 mSDtfsCounter, 3322 mSDsluCounter, 11361 mSDsCounter, 0 mSdLazyCounter, 2898 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3322 SdHoareTripleChecker+Valid, 14206 SdHoareTripleChecker+Invalid, 2899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:48,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3322 Valid, 14206 Invalid, 2899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2898 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-07 23:52:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2300 states. [2025-02-07 23:52:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2300 to 2300. [2025-02-07 23:52:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2300 states, 2299 states have (on average 1.4963027403218792) internal successors, (3440), 2299 states have internal predecessors, (3440), 0 states have call successors, (0), 0 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-07 23:52:48,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 2300 states and 3440 transitions. [2025-02-07 23:52:48,108 INFO L78 Accepts]: Start accepts. Automaton has 2300 states and 3440 transitions. Word has length 124 [2025-02-07 23:52:48,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:48,109 INFO L471 AbstractCegarLoop]: Abstraction has 2300 states and 3440 transitions. [2025-02-07 23:52:48,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 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-07 23:52:48,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2300 states and 3440 transitions. [2025-02-07 23:52:48,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-07 23:52:48,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:48,113 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:52:48,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 23:52:48,113 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:48,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:48,113 INFO L85 PathProgramCache]: Analyzing trace with hash -372431176, now seen corresponding path program 1 times [2025-02-07 23:52:48,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:48,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755756793] [2025-02-07 23:52:48,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:48,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:48,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-07 23:52:48,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-07 23:52:48,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:48,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:48,809 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-07 23:52:48,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:48,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755756793] [2025-02-07 23:52:48,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755756793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:48,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:48,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:52:48,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109458671] [2025-02-07 23:52:48,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:48,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:52:48,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:48,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:52:48,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:52:48,812 INFO L87 Difference]: Start difference. First operand 2300 states and 3440 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-07 23:52:49,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:49,818 INFO L93 Difference]: Finished difference Result 4480 states and 6702 transitions. [2025-02-07 23:52:49,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:52:49,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-02-07 23:52:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:49,828 INFO L225 Difference]: With dead ends: 4480 [2025-02-07 23:52:49,829 INFO L226 Difference]: Without dead ends: 2297 [2025-02-07 23:52:49,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:52:49,831 INFO L435 NwaCegarLoop]: 2798 mSDtfsCounter, 3322 mSDsluCounter, 2796 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3322 SdHoareTripleChecker+Valid, 5594 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:49,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3322 Valid, 5594 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 23:52:49,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2025-02-07 23:52:49,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2297. [2025-02-07 23:52:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2297 states, 2296 states have (on average 1.4952090592334495) internal successors, (3433), 2296 states have internal predecessors, (3433), 0 states have call successors, (0), 0 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-07 23:52:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 3433 transitions. [2025-02-07 23:52:49,860 INFO L78 Accepts]: Start accepts. Automaton has 2297 states and 3433 transitions. Word has length 125 [2025-02-07 23:52:49,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:49,861 INFO L471 AbstractCegarLoop]: Abstraction has 2297 states and 3433 transitions. [2025-02-07 23:52:49,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-07 23:52:49,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 3433 transitions. [2025-02-07 23:52:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-07 23:52:49,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:49,863 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:52:49,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 23:52:49,863 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:49,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash -486510193, now seen corresponding path program 1 times [2025-02-07 23:52:49,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:49,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479930253] [2025-02-07 23:52:49,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:49,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:49,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-07 23:52:49,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-07 23:52:49,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:49,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:50,105 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-07 23:52:50,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:50,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479930253] [2025-02-07 23:52:50,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479930253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:50,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:50,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:52:50,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178800539] [2025-02-07 23:52:50,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:50,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:52:50,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:50,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:52:50,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:52:50,106 INFO L87 Difference]: Start difference. First operand 2297 states and 3433 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-07 23:52:52,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:52,542 INFO L93 Difference]: Finished difference Result 6645 states and 9931 transitions. [2025-02-07 23:52:52,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:52:52,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-02-07 23:52:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:52,552 INFO L225 Difference]: With dead ends: 6645 [2025-02-07 23:52:52,552 INFO L226 Difference]: Without dead ends: 4465 [2025-02-07 23:52:52,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:52:52,554 INFO L435 NwaCegarLoop]: 2252 mSDtfsCounter, 3280 mSDsluCounter, 6672 mSDsCounter, 0 mSdLazyCounter, 4557 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3280 SdHoareTripleChecker+Valid, 8924 SdHoareTripleChecker+Invalid, 4558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:52,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3280 Valid, 8924 Invalid, 4558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4557 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-07 23:52:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4465 states. [2025-02-07 23:52:52,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4465 to 2416. [2025-02-07 23:52:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 2415 states have (on average 1.491511387163561) internal successors, (3602), 2415 states have internal predecessors, (3602), 0 states have call successors, (0), 0 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-07 23:52:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3602 transitions. [2025-02-07 23:52:52,659 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3602 transitions. Word has length 126 [2025-02-07 23:52:52,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:52,660 INFO L471 AbstractCegarLoop]: Abstraction has 2416 states and 3602 transitions. [2025-02-07 23:52:52,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-07 23:52:52,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3602 transitions. [2025-02-07 23:52:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-07 23:52:52,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:52,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:52:52,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 23:52:52,665 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:52,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:52,665 INFO L85 PathProgramCache]: Analyzing trace with hash 303936733, now seen corresponding path program 1 times [2025-02-07 23:52:52,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:52,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094132190] [2025-02-07 23:52:52,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:52,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:52,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-07 23:52:52,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-07 23:52:52,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:52,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:53,146 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-07 23:52:53,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:53,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094132190] [2025-02-07 23:52:53,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094132190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:53,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:53,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:52:53,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396936539] [2025-02-07 23:52:53,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:53,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:52:53,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:53,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:52:53,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:52:53,148 INFO L87 Difference]: Start difference. First operand 2416 states and 3602 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-07 23:52:54,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:54,331 INFO L93 Difference]: Finished difference Result 6063 states and 9055 transitions. [2025-02-07 23:52:54,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:52:54,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-02-07 23:52:54,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:54,342 INFO L225 Difference]: With dead ends: 6063 [2025-02-07 23:52:54,342 INFO L226 Difference]: Without dead ends: 3867 [2025-02-07 23:52:54,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:52:54,344 INFO L435 NwaCegarLoop]: 2835 mSDtfsCounter, 2415 mSDsluCounter, 8355 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2415 SdHoareTripleChecker+Valid, 11190 SdHoareTripleChecker+Invalid, 2291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:54,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2415 Valid, 11190 Invalid, 2291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-07 23:52:54,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2025-02-07 23:52:54,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 2403. [2025-02-07 23:52:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2403 states, 2402 states have (on average 1.4929225645295587) internal successors, (3586), 2402 states have internal predecessors, (3586), 0 states have call successors, (0), 0 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-07 23:52:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 3586 transitions. [2025-02-07 23:52:54,431 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 3586 transitions. Word has length 127 [2025-02-07 23:52:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:54,431 INFO L471 AbstractCegarLoop]: Abstraction has 2403 states and 3586 transitions. [2025-02-07 23:52:54,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-07 23:52:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 3586 transitions. [2025-02-07 23:52:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1204 [2025-02-07 23:52:54,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:54,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:52:54,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 23:52:54,453 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:54,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:54,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1900498452, now seen corresponding path program 1 times [2025-02-07 23:52:54,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:54,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566018768] [2025-02-07 23:52:54,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:54,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:54,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1203 statements into 1 equivalence classes. [2025-02-07 23:52:54,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1203 of 1203 statements. [2025-02-07 23:52:54,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:54,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:56,280 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-07 23:52:56,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:56,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566018768] [2025-02-07 23:52:56,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566018768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:56,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:56,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:52:56,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852673960] [2025-02-07 23:52:56,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:56,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 23:52:56,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:56,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 23:52:56,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 23:52:56,284 INFO L87 Difference]: Start difference. First operand 2403 states and 3586 transitions. Second operand has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 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-07 23:52:56,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:56,868 INFO L93 Difference]: Finished difference Result 4584 states and 6846 transitions. [2025-02-07 23:52:56,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 23:52:56,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 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 1203 [2025-02-07 23:52:56,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:56,872 INFO L225 Difference]: With dead ends: 4584 [2025-02-07 23:52:56,875 INFO L226 Difference]: Without dead ends: 2404 [2025-02-07 23:52:56,877 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-07 23:52:56,879 INFO L435 NwaCegarLoop]: 2846 mSDtfsCounter, 0 mSDsluCounter, 2841 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5687 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:56,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5687 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:52:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2025-02-07 23:52:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2404. [2025-02-07 23:52:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 2403 states have (on average 1.4927174365376612) internal successors, (3587), 2403 states have internal predecessors, (3587), 0 states have call successors, (0), 0 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-07 23:52:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 3587 transitions. [2025-02-07 23:52:56,897 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 3587 transitions. Word has length 1203 [2025-02-07 23:52:56,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:56,898 INFO L471 AbstractCegarLoop]: Abstraction has 2404 states and 3587 transitions. [2025-02-07 23:52:56,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 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-07 23:52:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 3587 transitions. [2025-02-07 23:52:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1204 [2025-02-07 23:52:56,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:56,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:52:56,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 23:52:56,923 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:56,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:56,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1743626285, now seen corresponding path program 1 times [2025-02-07 23:52:56,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:56,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837358405] [2025-02-07 23:52:56,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:56,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:57,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1203 statements into 1 equivalence classes. [2025-02-07 23:52:57,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1203 of 1203 statements. [2025-02-07 23:52:57,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:57,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:58,603 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-07 23:52:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:58,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837358405] [2025-02-07 23:52:58,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837358405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:58,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:58,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:52:58,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307144375] [2025-02-07 23:52:58,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:58,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 23:52:58,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:58,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 23:52:58,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 23:52:58,606 INFO L87 Difference]: Start difference. First operand 2404 states and 3587 transitions. Second operand has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 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-07 23:52:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:59,127 INFO L93 Difference]: Finished difference Result 4586 states and 6848 transitions. [2025-02-07 23:52:59,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 23:52:59,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 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 1203 [2025-02-07 23:52:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:59,131 INFO L225 Difference]: With dead ends: 4586 [2025-02-07 23:52:59,131 INFO L226 Difference]: Without dead ends: 2405 [2025-02-07 23:52:59,133 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-07 23:52:59,134 INFO L435 NwaCegarLoop]: 2846 mSDtfsCounter, 0 mSDsluCounter, 2841 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5687 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:59,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5687 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:52:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2025-02-07 23:52:59,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2405. [2025-02-07 23:52:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 2404 states have (on average 1.4925124792013311) internal successors, (3588), 2404 states have internal predecessors, (3588), 0 states have call successors, (0), 0 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-07 23:52:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 3588 transitions. [2025-02-07 23:52:59,161 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 3588 transitions. Word has length 1203 [2025-02-07 23:52:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:59,162 INFO L471 AbstractCegarLoop]: Abstraction has 2405 states and 3588 transitions. [2025-02-07 23:52:59,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 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-07 23:52:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 3588 transitions. [2025-02-07 23:52:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1204 [2025-02-07 23:52:59,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:59,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:52:59,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 23:52:59,189 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:59,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:59,190 INFO L85 PathProgramCache]: Analyzing trace with hash -8266798, now seen corresponding path program 1 times [2025-02-07 23:52:59,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:59,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70677891] [2025-02-07 23:52:59,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:59,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:59,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1203 statements into 1 equivalence classes. [2025-02-07 23:52:59,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1203 of 1203 statements. [2025-02-07 23:52:59,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:59,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:53:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 60 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:53:02,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:53:02,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70677891] [2025-02-07 23:53:02,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70677891] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:53:02,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854448538] [2025-02-07 23:53:02,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:53:02,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:53:02,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:53:02,096 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-07 23:53:02,097 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-07 23:53:02,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1203 statements into 1 equivalence classes. [2025-02-07 23:53:03,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1203 of 1203 statements. [2025-02-07 23:53:03,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:53:03,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:53:03,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 5183 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 23:53:03,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:53:07,188 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-07 23:53:07,188 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:53:07,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854448538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:53:07,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 23:53:07,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2025-02-07 23:53:07,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647444174] [2025-02-07 23:53:07,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:53:07,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:53:07,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:53:07,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:53:07,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:53:07,194 INFO L87 Difference]: Start difference. First operand 2405 states and 3588 transitions. Second operand has 6 states, 6 states have (on average 200.5) internal successors, (1203), 6 states have internal predecessors, (1203), 0 states have call successors, (0), 0 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-07 23:53:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:53:09,809 INFO L93 Difference]: Finished difference Result 6627 states and 9904 transitions. [2025-02-07 23:53:09,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:53:09,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 200.5) internal successors, (1203), 6 states have internal predecessors, (1203), 0 states have call successors, (0), 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 1203 [2025-02-07 23:53:09,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:53:09,818 INFO L225 Difference]: With dead ends: 6627 [2025-02-07 23:53:09,819 INFO L226 Difference]: Without dead ends: 4445 [2025-02-07 23:53:09,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1210 GetRequests, 1200 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:53:09,822 INFO L435 NwaCegarLoop]: 2244 mSDtfsCounter, 7491 mSDsluCounter, 6707 mSDsCounter, 0 mSdLazyCounter, 4688 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7491 SdHoareTripleChecker+Valid, 8951 SdHoareTripleChecker+Invalid, 4689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:53:09,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7491 Valid, 8951 Invalid, 4689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4688 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-07 23:53:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4445 states. [2025-02-07 23:53:09,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4445 to 4443. [2025-02-07 23:53:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4443 states, 4442 states have (on average 1.494822152183701) internal successors, (6640), 4442 states have internal predecessors, (6640), 0 states have call successors, (0), 0 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-07 23:53:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4443 states to 4443 states and 6640 transitions. [2025-02-07 23:53:09,863 INFO L78 Accepts]: Start accepts. Automaton has 4443 states and 6640 transitions. Word has length 1203 [2025-02-07 23:53:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:53:09,864 INFO L471 AbstractCegarLoop]: Abstraction has 4443 states and 6640 transitions. [2025-02-07 23:53:09,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.5) internal successors, (1203), 6 states have internal predecessors, (1203), 0 states have call successors, (0), 0 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-07 23:53:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 4443 states and 6640 transitions. [2025-02-07 23:53:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1205 [2025-02-07 23:53:09,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:53:09,873 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:53:09,893 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-07 23:53:10,074 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,SelfDestructingSolverStorable13 [2025-02-07 23:53:10,075 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:53:10,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:53:10,076 INFO L85 PathProgramCache]: Analyzing trace with hash 819995926, now seen corresponding path program 1 times [2025-02-07 23:53:10,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:53:10,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527176123] [2025-02-07 23:53:10,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:53:10,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:53:10,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1204 statements into 1 equivalence classes. [2025-02-07 23:53:10,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1204 of 1204 statements. [2025-02-07 23:53:10,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:53:10,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:53:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 60 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:53:13,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:53:13,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527176123] [2025-02-07 23:53:13,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527176123] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:53:13,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279575530] [2025-02-07 23:53:13,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:53:13,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:53:13,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:53:13,210 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-07 23:53:13,213 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-07 23:53:14,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1204 statements into 1 equivalence classes. [2025-02-07 23:53:14,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1204 of 1204 statements. [2025-02-07 23:53:14,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:53:14,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:53:14,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 5186 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 23:53:14,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:53:17,193 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-07 23:53:17,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:53:17,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279575530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:53:17,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 23:53:17,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-02-07 23:53:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108650860] [2025-02-07 23:53:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:53:17,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:53:17,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:53:17,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:53:17,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:53:17,195 INFO L87 Difference]: Start difference. First operand 4443 states and 6640 transitions. Second operand has 5 states, 5 states have (on average 240.8) internal successors, (1204), 5 states have internal predecessors, (1204), 0 states have call successors, (0), 0 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-07 23:53:20,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:53:20,326 INFO L93 Difference]: Finished difference Result 10715 states and 16023 transitions. [2025-02-07 23:53:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:53:20,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 240.8) internal successors, (1204), 5 states have internal predecessors, (1204), 0 states have call successors, (0), 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 1204 [2025-02-07 23:53:20,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:53:20,337 INFO L225 Difference]: With dead ends: 10715 [2025-02-07 23:53:20,337 INFO L226 Difference]: Without dead ends: 6495 [2025-02-07 23:53:20,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1211 GetRequests, 1202 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:53:20,343 INFO L435 NwaCegarLoop]: 2420 mSDtfsCounter, 2046 mSDsluCounter, 6890 mSDsCounter, 0 mSdLazyCounter, 4371 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2046 SdHoareTripleChecker+Valid, 9310 SdHoareTripleChecker+Invalid, 4371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:53:20,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2046 Valid, 9310 Invalid, 4371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4371 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-07 23:53:20,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6495 states. [2025-02-07 23:53:20,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6495 to 6492. [2025-02-07 23:53:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6492 states, 6491 states have (on average 1.495609305191804) internal successors, (9708), 6491 states have internal predecessors, (9708), 0 states have call successors, (0), 0 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-07 23:53:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6492 states to 6492 states and 9708 transitions. [2025-02-07 23:53:20,399 INFO L78 Accepts]: Start accepts. Automaton has 6492 states and 9708 transitions. Word has length 1204 [2025-02-07 23:53:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:53:20,400 INFO L471 AbstractCegarLoop]: Abstraction has 6492 states and 9708 transitions. [2025-02-07 23:53:20,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 240.8) internal successors, (1204), 5 states have internal predecessors, (1204), 0 states have call successors, (0), 0 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-07 23:53:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 6492 states and 9708 transitions. [2025-02-07 23:53:20,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1206 [2025-02-07 23:53:20,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:53:20,408 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:53:20,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 23:53:20,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-07 23:53:20,609 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:53:20,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:53:20,613 INFO L85 PathProgramCache]: Analyzing trace with hash 265134269, now seen corresponding path program 1 times [2025-02-07 23:53:20,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:53:20,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726007457] [2025-02-07 23:53:20,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:53:20,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:53:20,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1205 statements into 1 equivalence classes. [2025-02-07 23:53:21,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1205 of 1205 statements. [2025-02-07 23:53:21,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:53:21,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:53:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 60 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:53:23,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:53:23,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726007457] [2025-02-07 23:53:23,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726007457] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:53:23,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185088979] [2025-02-07 23:53:23,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:53:23,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:53:23,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:53:23,182 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-07 23:53:23,187 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-07 23:53:23,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1205 statements into 1 equivalence classes. [2025-02-07 23:53:24,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1205 of 1205 statements. [2025-02-07 23:53:24,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:53:24,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:53:24,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 5187 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-07 23:53:24,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:53:27,088 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-07 23:53:27,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:53:27,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185088979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:53:27,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 23:53:27,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 20 [2025-02-07 23:53:27,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995293623] [2025-02-07 23:53:27,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:53:27,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 23:53:27,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:53:27,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 23:53:27,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-02-07 23:53:27,091 INFO L87 Difference]: Start difference. First operand 6492 states and 9708 transitions. Second operand has 15 states, 15 states have (on average 80.33333333333333) internal successors, (1205), 15 states have internal predecessors, (1205), 0 states have call successors, (0), 0 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-07 23:53:32,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:53:32,226 INFO L93 Difference]: Finished difference Result 20447 states and 30583 transitions. [2025-02-07 23:53:32,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 23:53:32,226 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 80.33333333333333) internal successors, (1205), 15 states have internal predecessors, (1205), 0 states have call successors, (0), 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 1205 [2025-02-07 23:53:32,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:53:32,253 INFO L225 Difference]: With dead ends: 20447 [2025-02-07 23:53:32,256 INFO L226 Difference]: Without dead ends: 14178 [2025-02-07 23:53:32,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1216 GetRequests, 1193 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2025-02-07 23:53:32,275 INFO L435 NwaCegarLoop]: 2498 mSDtfsCounter, 6410 mSDsluCounter, 26126 mSDsCounter, 0 mSdLazyCounter, 12036 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6410 SdHoareTripleChecker+Valid, 28624 SdHoareTripleChecker+Invalid, 12048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 12036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-02-07 23:53:32,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6410 Valid, 28624 Invalid, 12048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 12036 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-02-07 23:53:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14178 states. [2025-02-07 23:53:32,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14178 to 10345. [2025-02-07 23:53:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10345 states, 10344 states have (on average 1.4942962103634958) internal successors, (15457), 10344 states have internal predecessors, (15457), 0 states have call successors, (0), 0 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-07 23:53:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10345 states to 10345 states and 15457 transitions. [2025-02-07 23:53:32,376 INFO L78 Accepts]: Start accepts. Automaton has 10345 states and 15457 transitions. Word has length 1205 [2025-02-07 23:53:32,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:53:32,377 INFO L471 AbstractCegarLoop]: Abstraction has 10345 states and 15457 transitions. [2025-02-07 23:53:32,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 80.33333333333333) internal successors, (1205), 15 states have internal predecessors, (1205), 0 states have call successors, (0), 0 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-07 23:53:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 10345 states and 15457 transitions. [2025-02-07 23:53:32,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1207 [2025-02-07 23:53:32,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:53:32,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:53:32,410 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-07 23:53:32,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:53:32,592 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:53:32,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:53:32,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1595513723, now seen corresponding path program 1 times [2025-02-07 23:53:32,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:53:32,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649568810] [2025-02-07 23:53:32,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:53:32,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:53:32,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1206 statements into 1 equivalence classes. [2025-02-07 23:53:33,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1206 of 1206 statements. [2025-02-07 23:53:33,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:53:33,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:53:35,511 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 60 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:53:35,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:53:35,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649568810] [2025-02-07 23:53:35,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649568810] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:53:35,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945821711] [2025-02-07 23:53:35,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:53:35,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:53:35,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:53:35,514 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-07 23:53:35,516 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-07 23:53:36,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1206 statements into 1 equivalence classes. [2025-02-07 23:53:37,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1206 of 1206 statements. [2025-02-07 23:53:37,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:53:37,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:53:37,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 5190 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-07 23:53:37,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:53:39,503 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-07 23:53:39,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:53:39,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945821711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:53:39,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 23:53:39,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 17 [2025-02-07 23:53:39,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56169631] [2025-02-07 23:53:39,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:53:39,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 23:53:39,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:53:39,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 23:53:39,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-02-07 23:53:39,507 INFO L87 Difference]: Start difference. First operand 10345 states and 15457 transitions. Second operand has 12 states, 12 states have (on average 100.5) internal successors, (1206), 12 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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-07 23:53:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:53:44,202 INFO L93 Difference]: Finished difference Result 28536 states and 42685 transitions. [2025-02-07 23:53:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 23:53:44,203 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 100.5) internal successors, (1206), 12 states have internal predecessors, (1206), 0 states have call successors, (0), 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 1206 [2025-02-07 23:53:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:53:44,223 INFO L225 Difference]: With dead ends: 28536 [2025-02-07 23:53:44,223 INFO L226 Difference]: Without dead ends: 18496 [2025-02-07 23:53:44,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1220 GetRequests, 1197 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-02-07 23:53:44,234 INFO L435 NwaCegarLoop]: 2224 mSDtfsCounter, 7365 mSDsluCounter, 15250 mSDsCounter, 0 mSdLazyCounter, 9433 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7365 SdHoareTripleChecker+Valid, 17474 SdHoareTripleChecker+Invalid, 9435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:53:44,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7365 Valid, 17474 Invalid, 9435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9433 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-02-07 23:53:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18496 states. [2025-02-07 23:53:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18496 to 17620. [2025-02-07 23:53:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17620 states, 17619 states have (on average 1.49605539474431) internal successors, (26359), 17619 states have internal predecessors, (26359), 0 states have call successors, (0), 0 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-07 23:53:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17620 states to 17620 states and 26359 transitions. [2025-02-07 23:53:44,384 INFO L78 Accepts]: Start accepts. Automaton has 17620 states and 26359 transitions. Word has length 1206 [2025-02-07 23:53:44,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:53:44,384 INFO L471 AbstractCegarLoop]: Abstraction has 17620 states and 26359 transitions. [2025-02-07 23:53:44,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 100.5) internal successors, (1206), 12 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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-07 23:53:44,385 INFO L276 IsEmpty]: Start isEmpty. Operand 17620 states and 26359 transitions. [2025-02-07 23:53:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1208 [2025-02-07 23:53:44,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:53:44,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:53:44,417 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-07 23:53:44,602 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,SelfDestructingSolverStorable16 [2025-02-07 23:53:44,602 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:53:44,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:53:44,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2065642669, now seen corresponding path program 1 times [2025-02-07 23:53:44,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:53:44,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972237334] [2025-02-07 23:53:44,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:53:44,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:53:44,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1207 statements into 1 equivalence classes. [2025-02-07 23:53:45,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1207 of 1207 statements. [2025-02-07 23:53:45,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:53:45,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat